/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:10:50,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:10:50,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:10:50,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:10:50,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:10:50,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:10:50,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:10:50,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:10:50,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:10:50,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:10:50,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:10:50,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:10:50,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:10:50,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:10:50,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:10:50,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:10:50,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:10:50,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:10:50,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:10:50,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:10:50,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:10:50,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:10:50,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:10:50,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:10:50,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:10:50,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:10:50,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:10:50,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:10:50,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:10:50,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:10:50,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:10:50,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:10:50,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:10:50,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:10:50,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:10:50,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:10:50,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:10:50,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:10:50,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:10:50,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:10:50,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:10:50,124 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:10:50,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:10:50,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:10:50,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:10:50,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:10:50,156 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:10:50,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:10:50,156 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:10:50,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:10:50,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:10:50,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:10:50,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:10:50,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:10:50,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:10:50,158 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:10:50,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:10:50,158 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:10:50,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:10:50,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:10:50,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:10:50,159 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:10:50,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:10:50,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:10:50,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:10:50,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:10:50,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:10:50,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:10:50,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:10:50,165 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:10:50,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:10:50,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:10:50,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:10:50,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:10:50,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:10:50,456 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:10:50,456 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:10:50,457 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i [2019-12-27 05:10:50,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3555380e0/94c90b28e3214933a7769e626d547d62/FLAGb3f7f4603 [2019-12-27 05:10:51,088 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:10:51,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i [2019-12-27 05:10:51,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3555380e0/94c90b28e3214933a7769e626d547d62/FLAGb3f7f4603 [2019-12-27 05:10:51,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3555380e0/94c90b28e3214933a7769e626d547d62 [2019-12-27 05:10:51,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:10:51,365 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:10:51,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:10:51,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:10:51,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:10:51,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:10:51" (1/1) ... [2019-12-27 05:10:51,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75debd2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:51, skipping insertion in model container [2019-12-27 05:10:51,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:10:51" (1/1) ... [2019-12-27 05:10:51,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:10:51,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:10:51,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:10:51,975 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:10:52,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:10:52,140 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:10:52,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:52 WrapperNode [2019-12-27 05:10:52,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:10:52,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:10:52,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:10:52,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:10:52,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:52" (1/1) ... [2019-12-27 05:10:52,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:52" (1/1) ... [2019-12-27 05:10:52,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:10:52,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:10:52,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:10:52,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:10:52,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:52" (1/1) ... [2019-12-27 05:10:52,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:52" (1/1) ... [2019-12-27 05:10:52,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:52" (1/1) ... [2019-12-27 05:10:52,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:52" (1/1) ... [2019-12-27 05:10:52,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:52" (1/1) ... [2019-12-27 05:10:52,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:52" (1/1) ... [2019-12-27 05:10:52,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:52" (1/1) ... [2019-12-27 05:10:52,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:10:52,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:10:52,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:10:52,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:10:52,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:10:52,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:10:52,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:10:52,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:10:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:10:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:10:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:10:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:10:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:10:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:10:52,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:10:52,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:10:52,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:10:52,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:10:52,364 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:10:53,135 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:10:53,135 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:10:53,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:10:53 BoogieIcfgContainer [2019-12-27 05:10:53,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:10:53,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:10:53,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:10:53,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:10:53,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:10:51" (1/3) ... [2019-12-27 05:10:53,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d29e201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:10:53, skipping insertion in model container [2019-12-27 05:10:53,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:52" (2/3) ... [2019-12-27 05:10:53,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d29e201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:10:53, skipping insertion in model container [2019-12-27 05:10:53,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:10:53" (3/3) ... [2019-12-27 05:10:53,146 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_pso.oepc.i [2019-12-27 05:10:53,155 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:10:53,156 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:10:53,163 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:10:53,164 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:10:53,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,207 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,209 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,240 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,240 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,254 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,255 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,301 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,303 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,310 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,311 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,311 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,313 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,313 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:53,330 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:10:53,351 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:10:53,351 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:10:53,352 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:10:53,352 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:10:53,352 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:10:53,352 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:10:53,352 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:10:53,352 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:10:53,370 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 05:10:53,372 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 05:10:53,481 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 05:10:53,481 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:10:53,497 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:10:53,524 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 05:10:53,582 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 05:10:53,582 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:10:53,591 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:10:53,612 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:10:53,613 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:10:57,236 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 05:10:57,379 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 05:10:57,406 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82443 [2019-12-27 05:10:57,407 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 05:10:57,411 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-27 05:11:19,085 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120992 states. [2019-12-27 05:11:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 120992 states. [2019-12-27 05:11:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:11:19,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:19,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:11:19,094 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash 913992, now seen corresponding path program 1 times [2019-12-27 05:11:19,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:19,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273477395] [2019-12-27 05:11:19,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:11:19,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273477395] [2019-12-27 05:11:19,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:19,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:11:19,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849085770] [2019-12-27 05:11:19,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:11:19,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:19,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:11:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:11:19,434 INFO L87 Difference]: Start difference. First operand 120992 states. Second operand 3 states. [2019-12-27 05:11:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:20,712 INFO L93 Difference]: Finished difference Result 119518 states and 508908 transitions. [2019-12-27 05:11:20,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:11:20,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:11:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:24,372 INFO L225 Difference]: With dead ends: 119518 [2019-12-27 05:11:24,372 INFO L226 Difference]: Without dead ends: 112056 [2019-12-27 05:11:24,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:11:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112056 states. [2019-12-27 05:11:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112056 to 112056. [2019-12-27 05:11:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112056 states. [2019-12-27 05:11:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112056 states to 112056 states and 476484 transitions. [2019-12-27 05:11:32,296 INFO L78 Accepts]: Start accepts. Automaton has 112056 states and 476484 transitions. Word has length 3 [2019-12-27 05:11:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:32,297 INFO L462 AbstractCegarLoop]: Abstraction has 112056 states and 476484 transitions. [2019-12-27 05:11:32,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:11:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 112056 states and 476484 transitions. [2019-12-27 05:11:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:11:32,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:32,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:32,300 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:32,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:32,301 INFO L82 PathProgramCache]: Analyzing trace with hash -224245043, now seen corresponding path program 1 times [2019-12-27 05:11:32,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:32,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595299688] [2019-12-27 05:11:32,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:11:32,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595299688] [2019-12-27 05:11:32,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:32,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:11:32,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472364355] [2019-12-27 05:11:32,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:11:32,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:32,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:11:32,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:11:32,399 INFO L87 Difference]: Start difference. First operand 112056 states and 476484 transitions. Second operand 4 states. [2019-12-27 05:11:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:38,007 INFO L93 Difference]: Finished difference Result 173434 states and 704626 transitions. [2019-12-27 05:11:38,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:11:38,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:11:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:38,631 INFO L225 Difference]: With dead ends: 173434 [2019-12-27 05:11:38,632 INFO L226 Difference]: Without dead ends: 173385 [2019-12-27 05:11:38,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:11:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173385 states. [2019-12-27 05:11:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173385 to 158867. [2019-12-27 05:11:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158867 states. [2019-12-27 05:11:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158867 states to 158867 states and 654272 transitions. [2019-12-27 05:11:50,715 INFO L78 Accepts]: Start accepts. Automaton has 158867 states and 654272 transitions. Word has length 11 [2019-12-27 05:11:50,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:50,716 INFO L462 AbstractCegarLoop]: Abstraction has 158867 states and 654272 transitions. [2019-12-27 05:11:50,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:11:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 158867 states and 654272 transitions. [2019-12-27 05:11:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:11:50,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:50,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:50,724 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:50,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:50,724 INFO L82 PathProgramCache]: Analyzing trace with hash 703391521, now seen corresponding path program 1 times [2019-12-27 05:11:50,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:50,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872029118] [2019-12-27 05:11:50,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:11:50,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872029118] [2019-12-27 05:11:50,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:50,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:11:50,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337811919] [2019-12-27 05:11:50,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:11:50,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:50,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:11:50,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:11:50,782 INFO L87 Difference]: Start difference. First operand 158867 states and 654272 transitions. Second operand 3 states. [2019-12-27 05:11:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:50,914 INFO L93 Difference]: Finished difference Result 34345 states and 110990 transitions. [2019-12-27 05:11:50,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:11:50,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:11:50,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:50,972 INFO L225 Difference]: With dead ends: 34345 [2019-12-27 05:11:50,972 INFO L226 Difference]: Without dead ends: 34345 [2019-12-27 05:11:50,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:11:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34345 states. [2019-12-27 05:11:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34345 to 34345. [2019-12-27 05:11:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34345 states. [2019-12-27 05:11:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34345 states to 34345 states and 110990 transitions. [2019-12-27 05:11:56,699 INFO L78 Accepts]: Start accepts. Automaton has 34345 states and 110990 transitions. Word has length 13 [2019-12-27 05:11:56,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:56,700 INFO L462 AbstractCegarLoop]: Abstraction has 34345 states and 110990 transitions. [2019-12-27 05:11:56,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:11:56,700 INFO L276 IsEmpty]: Start isEmpty. Operand 34345 states and 110990 transitions. [2019-12-27 05:11:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:11:56,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:56,703 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:56,703 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:56,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:56,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1949648440, now seen corresponding path program 1 times [2019-12-27 05:11:56,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:56,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350985228] [2019-12-27 05:11:56,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:11:56,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350985228] [2019-12-27 05:11:56,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:56,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:11:56,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893603466] [2019-12-27 05:11:56,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:11:56,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:56,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:11:56,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:11:56,826 INFO L87 Difference]: Start difference. First operand 34345 states and 110990 transitions. Second operand 4 states. [2019-12-27 05:11:57,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:57,188 INFO L93 Difference]: Finished difference Result 41968 states and 135253 transitions. [2019-12-27 05:11:57,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:11:57,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:11:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:57,251 INFO L225 Difference]: With dead ends: 41968 [2019-12-27 05:11:57,251 INFO L226 Difference]: Without dead ends: 41968 [2019-12-27 05:11:57,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:11:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41968 states. [2019-12-27 05:11:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41968 to 37815. [2019-12-27 05:11:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37815 states. [2019-12-27 05:11:57,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37815 states to 37815 states and 122278 transitions. [2019-12-27 05:11:57,891 INFO L78 Accepts]: Start accepts. Automaton has 37815 states and 122278 transitions. Word has length 16 [2019-12-27 05:11:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:57,892 INFO L462 AbstractCegarLoop]: Abstraction has 37815 states and 122278 transitions. [2019-12-27 05:11:57,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:11:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 37815 states and 122278 transitions. [2019-12-27 05:11:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:11:57,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:57,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:57,902 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:57,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:57,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1390855021, now seen corresponding path program 1 times [2019-12-27 05:11:57,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:57,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135219369] [2019-12-27 05:11:57,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:11:57,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135219369] [2019-12-27 05:11:57,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:57,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:11:57,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327384932] [2019-12-27 05:11:57,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:11:57,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:57,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:11:57,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:11:57,998 INFO L87 Difference]: Start difference. First operand 37815 states and 122278 transitions. Second operand 5 states. [2019-12-27 05:11:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:58,675 INFO L93 Difference]: Finished difference Result 48568 states and 154032 transitions. [2019-12-27 05:11:58,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:11:58,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:11:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:58,758 INFO L225 Difference]: With dead ends: 48568 [2019-12-27 05:11:58,758 INFO L226 Difference]: Without dead ends: 48561 [2019-12-27 05:11:58,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:11:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48561 states. [2019-12-27 05:11:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48561 to 37245. [2019-12-27 05:11:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37245 states. [2019-12-27 05:11:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37245 states to 37245 states and 120198 transitions. [2019-12-27 05:11:59,795 INFO L78 Accepts]: Start accepts. Automaton has 37245 states and 120198 transitions. Word has length 22 [2019-12-27 05:11:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:59,796 INFO L462 AbstractCegarLoop]: Abstraction has 37245 states and 120198 transitions. [2019-12-27 05:11:59,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:11:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 37245 states and 120198 transitions. [2019-12-27 05:11:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:11:59,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:59,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:59,808 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:59,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:59,809 INFO L82 PathProgramCache]: Analyzing trace with hash 896315521, now seen corresponding path program 1 times [2019-12-27 05:11:59,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:59,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138548795] [2019-12-27 05:11:59,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:11:59,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138548795] [2019-12-27 05:11:59,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:59,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:11:59,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073875991] [2019-12-27 05:11:59,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:11:59,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:59,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:11:59,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:11:59,873 INFO L87 Difference]: Start difference. First operand 37245 states and 120198 transitions. Second operand 4 states. [2019-12-27 05:11:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:59,954 INFO L93 Difference]: Finished difference Result 14946 states and 45537 transitions. [2019-12-27 05:11:59,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:11:59,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:11:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:59,982 INFO L225 Difference]: With dead ends: 14946 [2019-12-27 05:11:59,983 INFO L226 Difference]: Without dead ends: 14946 [2019-12-27 05:11:59,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:12:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14946 states. [2019-12-27 05:12:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14946 to 14702. [2019-12-27 05:12:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14702 states. [2019-12-27 05:12:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14702 states to 14702 states and 44841 transitions. [2019-12-27 05:12:00,221 INFO L78 Accepts]: Start accepts. Automaton has 14702 states and 44841 transitions. Word has length 25 [2019-12-27 05:12:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:00,222 INFO L462 AbstractCegarLoop]: Abstraction has 14702 states and 44841 transitions. [2019-12-27 05:12:00,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:12:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 14702 states and 44841 transitions. [2019-12-27 05:12:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:12:00,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:00,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:00,235 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:00,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:00,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1170080207, now seen corresponding path program 1 times [2019-12-27 05:12:00,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:00,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533081423] [2019-12-27 05:12:00,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:00,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533081423] [2019-12-27 05:12:00,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:00,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:12:00,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577710067] [2019-12-27 05:12:00,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:00,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:00,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:00,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:00,283 INFO L87 Difference]: Start difference. First operand 14702 states and 44841 transitions. Second operand 3 states. [2019-12-27 05:12:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:00,389 INFO L93 Difference]: Finished difference Result 21048 states and 63094 transitions. [2019-12-27 05:12:00,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:00,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 05:12:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:00,417 INFO L225 Difference]: With dead ends: 21048 [2019-12-27 05:12:00,417 INFO L226 Difference]: Without dead ends: 21048 [2019-12-27 05:12:00,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:00,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21048 states. [2019-12-27 05:12:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21048 to 15496. [2019-12-27 05:12:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15496 states. [2019-12-27 05:12:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15496 states to 15496 states and 47121 transitions. [2019-12-27 05:12:00,680 INFO L78 Accepts]: Start accepts. Automaton has 15496 states and 47121 transitions. Word has length 27 [2019-12-27 05:12:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:00,681 INFO L462 AbstractCegarLoop]: Abstraction has 15496 states and 47121 transitions. [2019-12-27 05:12:00,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 15496 states and 47121 transitions. [2019-12-27 05:12:00,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:12:00,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:00,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:00,694 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:00,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:00,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1291585692, now seen corresponding path program 1 times [2019-12-27 05:12:00,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:00,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413267742] [2019-12-27 05:12:00,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:00,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413267742] [2019-12-27 05:12:00,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:00,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:12:00,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037609087] [2019-12-27 05:12:00,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:12:00,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:00,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:12:00,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:12:00,994 INFO L87 Difference]: Start difference. First operand 15496 states and 47121 transitions. Second operand 6 states. [2019-12-27 05:12:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:01,807 INFO L93 Difference]: Finished difference Result 39367 states and 118228 transitions. [2019-12-27 05:12:01,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:12:01,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 05:12:01,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:01,865 INFO L225 Difference]: With dead ends: 39367 [2019-12-27 05:12:01,865 INFO L226 Difference]: Without dead ends: 39367 [2019-12-27 05:12:01,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:12:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39367 states. [2019-12-27 05:12:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39367 to 22126. [2019-12-27 05:12:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22126 states. [2019-12-27 05:12:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22126 states to 22126 states and 68213 transitions. [2019-12-27 05:12:02,303 INFO L78 Accepts]: Start accepts. Automaton has 22126 states and 68213 transitions. Word has length 27 [2019-12-27 05:12:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:02,303 INFO L462 AbstractCegarLoop]: Abstraction has 22126 states and 68213 transitions. [2019-12-27 05:12:02,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:12:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 22126 states and 68213 transitions. [2019-12-27 05:12:02,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:12:02,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:02,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:02,318 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:02,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:02,319 INFO L82 PathProgramCache]: Analyzing trace with hash 859272137, now seen corresponding path program 1 times [2019-12-27 05:12:02,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:02,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998177501] [2019-12-27 05:12:02,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:02,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998177501] [2019-12-27 05:12:02,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:02,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:12:02,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306378161] [2019-12-27 05:12:02,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:12:02,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:12:02,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:12:02,406 INFO L87 Difference]: Start difference. First operand 22126 states and 68213 transitions. Second operand 6 states. [2019-12-27 05:12:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:03,153 INFO L93 Difference]: Finished difference Result 36723 states and 110142 transitions. [2019-12-27 05:12:03,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:12:03,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 05:12:03,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:03,222 INFO L225 Difference]: With dead ends: 36723 [2019-12-27 05:12:03,223 INFO L226 Difference]: Without dead ends: 36723 [2019-12-27 05:12:03,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:12:03,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36723 states. [2019-12-27 05:12:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36723 to 21684. [2019-12-27 05:12:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21684 states. [2019-12-27 05:12:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21684 states to 21684 states and 67048 transitions. [2019-12-27 05:12:03,660 INFO L78 Accepts]: Start accepts. Automaton has 21684 states and 67048 transitions. Word has length 28 [2019-12-27 05:12:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:03,661 INFO L462 AbstractCegarLoop]: Abstraction has 21684 states and 67048 transitions. [2019-12-27 05:12:03,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:12:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21684 states and 67048 transitions. [2019-12-27 05:12:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:12:03,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:03,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:03,685 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:03,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:03,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1529980999, now seen corresponding path program 1 times [2019-12-27 05:12:03,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:03,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741345549] [2019-12-27 05:12:03,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:03,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741345549] [2019-12-27 05:12:03,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:03,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:12:03,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264635898] [2019-12-27 05:12:03,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:12:03,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:03,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:12:03,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:12:03,786 INFO L87 Difference]: Start difference. First operand 21684 states and 67048 transitions. Second operand 7 states. [2019-12-27 05:12:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:05,430 INFO L93 Difference]: Finished difference Result 48727 states and 145636 transitions. [2019-12-27 05:12:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:12:05,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 05:12:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:05,504 INFO L225 Difference]: With dead ends: 48727 [2019-12-27 05:12:05,504 INFO L226 Difference]: Without dead ends: 48727 [2019-12-27 05:12:05,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:12:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48727 states. [2019-12-27 05:12:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48727 to 23131. [2019-12-27 05:12:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23131 states. [2019-12-27 05:12:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23131 states to 23131 states and 71461 transitions. [2019-12-27 05:12:06,041 INFO L78 Accepts]: Start accepts. Automaton has 23131 states and 71461 transitions. Word has length 33 [2019-12-27 05:12:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:06,042 INFO L462 AbstractCegarLoop]: Abstraction has 23131 states and 71461 transitions. [2019-12-27 05:12:06,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:12:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 23131 states and 71461 transitions. [2019-12-27 05:12:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:12:06,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:06,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:06,067 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:06,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1030046023, now seen corresponding path program 2 times [2019-12-27 05:12:06,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:06,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092887578] [2019-12-27 05:12:06,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:06,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092887578] [2019-12-27 05:12:06,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:06,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:12:06,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313617506] [2019-12-27 05:12:06,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:12:06,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:06,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:12:06,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:12:06,169 INFO L87 Difference]: Start difference. First operand 23131 states and 71461 transitions. Second operand 8 states. [2019-12-27 05:12:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:08,090 INFO L93 Difference]: Finished difference Result 67362 states and 198335 transitions. [2019-12-27 05:12:08,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 05:12:08,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 05:12:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:08,201 INFO L225 Difference]: With dead ends: 67362 [2019-12-27 05:12:08,201 INFO L226 Difference]: Without dead ends: 67362 [2019-12-27 05:12:08,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-12-27 05:12:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67362 states. [2019-12-27 05:12:09,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67362 to 22138. [2019-12-27 05:12:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22138 states. [2019-12-27 05:12:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22138 states to 22138 states and 68414 transitions. [2019-12-27 05:12:09,113 INFO L78 Accepts]: Start accepts. Automaton has 22138 states and 68414 transitions. Word has length 33 [2019-12-27 05:12:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:09,113 INFO L462 AbstractCegarLoop]: Abstraction has 22138 states and 68414 transitions. [2019-12-27 05:12:09,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:12:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 22138 states and 68414 transitions. [2019-12-27 05:12:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:12:09,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:09,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:09,134 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:09,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:09,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2058952212, now seen corresponding path program 1 times [2019-12-27 05:12:09,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:09,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333983775] [2019-12-27 05:12:09,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:09,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333983775] [2019-12-27 05:12:09,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:09,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:12:09,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822747418] [2019-12-27 05:12:09,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:12:09,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:09,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:12:09,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:12:09,233 INFO L87 Difference]: Start difference. First operand 22138 states and 68414 transitions. Second operand 7 states. [2019-12-27 05:12:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:10,540 INFO L93 Difference]: Finished difference Result 40064 states and 119955 transitions. [2019-12-27 05:12:10,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:12:10,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 05:12:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:10,596 INFO L225 Difference]: With dead ends: 40064 [2019-12-27 05:12:10,596 INFO L226 Difference]: Without dead ends: 40064 [2019-12-27 05:12:10,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:12:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40064 states. [2019-12-27 05:12:11,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40064 to 20938. [2019-12-27 05:12:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20938 states. [2019-12-27 05:12:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20938 states to 20938 states and 64898 transitions. [2019-12-27 05:12:11,055 INFO L78 Accepts]: Start accepts. Automaton has 20938 states and 64898 transitions. Word has length 34 [2019-12-27 05:12:11,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:11,055 INFO L462 AbstractCegarLoop]: Abstraction has 20938 states and 64898 transitions. [2019-12-27 05:12:11,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:12:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 20938 states and 64898 transitions. [2019-12-27 05:12:11,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:12:11,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:11,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:11,073 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:11,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1960715392, now seen corresponding path program 2 times [2019-12-27 05:12:11,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:11,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393638748] [2019-12-27 05:12:11,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:11,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393638748] [2019-12-27 05:12:11,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:11,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:12:11,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884762056] [2019-12-27 05:12:11,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:12:11,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:11,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:12:11,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:12:11,195 INFO L87 Difference]: Start difference. First operand 20938 states and 64898 transitions. Second operand 8 states. [2019-12-27 05:12:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:13,140 INFO L93 Difference]: Finished difference Result 44758 states and 132164 transitions. [2019-12-27 05:12:13,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 05:12:13,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 05:12:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:13,240 INFO L225 Difference]: With dead ends: 44758 [2019-12-27 05:12:13,241 INFO L226 Difference]: Without dead ends: 44758 [2019-12-27 05:12:13,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2019-12-27 05:12:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44758 states. [2019-12-27 05:12:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44758 to 18926. [2019-12-27 05:12:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18926 states. [2019-12-27 05:12:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18926 states to 18926 states and 58684 transitions. [2019-12-27 05:12:13,841 INFO L78 Accepts]: Start accepts. Automaton has 18926 states and 58684 transitions. Word has length 34 [2019-12-27 05:12:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:13,841 INFO L462 AbstractCegarLoop]: Abstraction has 18926 states and 58684 transitions. [2019-12-27 05:12:13,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:12:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 18926 states and 58684 transitions. [2019-12-27 05:12:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:12:13,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:13,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:13,861 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:13,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:13,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1601798089, now seen corresponding path program 1 times [2019-12-27 05:12:13,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:13,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109601650] [2019-12-27 05:12:13,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:13,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109601650] [2019-12-27 05:12:13,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:13,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:12:13,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116578237] [2019-12-27 05:12:13,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:13,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:13,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:13,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:13,914 INFO L87 Difference]: Start difference. First operand 18926 states and 58684 transitions. Second operand 3 states. [2019-12-27 05:12:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:14,016 INFO L93 Difference]: Finished difference Result 32927 states and 102451 transitions. [2019-12-27 05:12:14,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:14,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:12:14,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:14,041 INFO L225 Difference]: With dead ends: 32927 [2019-12-27 05:12:14,041 INFO L226 Difference]: Without dead ends: 16957 [2019-12-27 05:12:14,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16957 states. [2019-12-27 05:12:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16957 to 16891. [2019-12-27 05:12:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16891 states. [2019-12-27 05:12:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16891 states to 16891 states and 51543 transitions. [2019-12-27 05:12:14,284 INFO L78 Accepts]: Start accepts. Automaton has 16891 states and 51543 transitions. Word has length 39 [2019-12-27 05:12:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:14,284 INFO L462 AbstractCegarLoop]: Abstraction has 16891 states and 51543 transitions. [2019-12-27 05:12:14,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 16891 states and 51543 transitions. [2019-12-27 05:12:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:12:14,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:14,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:14,304 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:14,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:14,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1603062761, now seen corresponding path program 2 times [2019-12-27 05:12:14,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:14,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506989439] [2019-12-27 05:12:14,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:14,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506989439] [2019-12-27 05:12:14,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:14,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:12:14,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136729279] [2019-12-27 05:12:14,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:14,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:14,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:14,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:14,353 INFO L87 Difference]: Start difference. First operand 16891 states and 51543 transitions. Second operand 3 states. [2019-12-27 05:12:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:14,421 INFO L93 Difference]: Finished difference Result 16890 states and 51541 transitions. [2019-12-27 05:12:14,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:14,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:12:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:14,458 INFO L225 Difference]: With dead ends: 16890 [2019-12-27 05:12:14,458 INFO L226 Difference]: Without dead ends: 16890 [2019-12-27 05:12:14,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16890 states. [2019-12-27 05:12:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16890 to 16890. [2019-12-27 05:12:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16890 states. [2019-12-27 05:12:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16890 states to 16890 states and 51541 transitions. [2019-12-27 05:12:14,720 INFO L78 Accepts]: Start accepts. Automaton has 16890 states and 51541 transitions. Word has length 39 [2019-12-27 05:12:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:14,721 INFO L462 AbstractCegarLoop]: Abstraction has 16890 states and 51541 transitions. [2019-12-27 05:12:14,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 16890 states and 51541 transitions. [2019-12-27 05:12:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:12:14,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:14,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:14,737 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:14,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:14,737 INFO L82 PathProgramCache]: Analyzing trace with hash 417642434, now seen corresponding path program 1 times [2019-12-27 05:12:14,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:14,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596512706] [2019-12-27 05:12:14,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:14,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596512706] [2019-12-27 05:12:14,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:14,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:12:14,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623548312] [2019-12-27 05:12:14,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:12:14,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:12:14,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:12:14,820 INFO L87 Difference]: Start difference. First operand 16890 states and 51541 transitions. Second operand 5 states. [2019-12-27 05:12:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:15,436 INFO L93 Difference]: Finished difference Result 28008 states and 83346 transitions. [2019-12-27 05:12:15,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:12:15,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:12:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:15,481 INFO L225 Difference]: With dead ends: 28008 [2019-12-27 05:12:15,481 INFO L226 Difference]: Without dead ends: 28008 [2019-12-27 05:12:15,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:12:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28008 states. [2019-12-27 05:12:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28008 to 23150. [2019-12-27 05:12:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-12-27 05:12:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 70163 transitions. [2019-12-27 05:12:16,005 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 70163 transitions. Word has length 40 [2019-12-27 05:12:16,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:16,005 INFO L462 AbstractCegarLoop]: Abstraction has 23150 states and 70163 transitions. [2019-12-27 05:12:16,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:12:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 70163 transitions. [2019-12-27 05:12:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:12:16,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:16,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:16,027 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:16,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:16,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1415326004, now seen corresponding path program 2 times [2019-12-27 05:12:16,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:16,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781938054] [2019-12-27 05:12:16,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:16,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781938054] [2019-12-27 05:12:16,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:16,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:12:16,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051552066] [2019-12-27 05:12:16,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:12:16,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:16,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:12:16,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:12:16,107 INFO L87 Difference]: Start difference. First operand 23150 states and 70163 transitions. Second operand 6 states. [2019-12-27 05:12:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:16,958 INFO L93 Difference]: Finished difference Result 38676 states and 116246 transitions. [2019-12-27 05:12:16,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 05:12:16,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 05:12:16,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:17,011 INFO L225 Difference]: With dead ends: 38676 [2019-12-27 05:12:17,011 INFO L226 Difference]: Without dead ends: 38676 [2019-12-27 05:12:17,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:12:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38676 states. [2019-12-27 05:12:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38676 to 27096. [2019-12-27 05:12:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27096 states. [2019-12-27 05:12:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27096 states to 27096 states and 81946 transitions. [2019-12-27 05:12:17,483 INFO L78 Accepts]: Start accepts. Automaton has 27096 states and 81946 transitions. Word has length 40 [2019-12-27 05:12:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:17,483 INFO L462 AbstractCegarLoop]: Abstraction has 27096 states and 81946 transitions. [2019-12-27 05:12:17,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:12:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 27096 states and 81946 transitions. [2019-12-27 05:12:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:12:17,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:17,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:17,513 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:17,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:17,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1542628910, now seen corresponding path program 3 times [2019-12-27 05:12:17,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:17,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799615155] [2019-12-27 05:12:17,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:17,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799615155] [2019-12-27 05:12:17,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:17,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:12:17,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115335290] [2019-12-27 05:12:17,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:12:17,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:17,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:12:17,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:12:17,571 INFO L87 Difference]: Start difference. First operand 27096 states and 81946 transitions. Second operand 5 states. [2019-12-27 05:12:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:17,694 INFO L93 Difference]: Finished difference Result 25702 states and 78663 transitions. [2019-12-27 05:12:17,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:12:17,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:12:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:17,750 INFO L225 Difference]: With dead ends: 25702 [2019-12-27 05:12:17,751 INFO L226 Difference]: Without dead ends: 23616 [2019-12-27 05:12:17,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:12:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23616 states. [2019-12-27 05:12:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23616 to 22531. [2019-12-27 05:12:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22531 states. [2019-12-27 05:12:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22531 states to 22531 states and 70666 transitions. [2019-12-27 05:12:18,155 INFO L78 Accepts]: Start accepts. Automaton has 22531 states and 70666 transitions. Word has length 40 [2019-12-27 05:12:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:18,156 INFO L462 AbstractCegarLoop]: Abstraction has 22531 states and 70666 transitions. [2019-12-27 05:12:18,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:12:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 22531 states and 70666 transitions. [2019-12-27 05:12:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:18,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:18,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:18,183 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:18,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1027702, now seen corresponding path program 1 times [2019-12-27 05:12:18,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:18,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718917144] [2019-12-27 05:12:18,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:18,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718917144] [2019-12-27 05:12:18,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:18,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:12:18,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898723236] [2019-12-27 05:12:18,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:12:18,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:18,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:12:18,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:12:18,265 INFO L87 Difference]: Start difference. First operand 22531 states and 70666 transitions. Second operand 7 states. [2019-12-27 05:12:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:19,008 INFO L93 Difference]: Finished difference Result 71705 states and 221520 transitions. [2019-12-27 05:12:19,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:12:19,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:12:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:19,089 INFO L225 Difference]: With dead ends: 71705 [2019-12-27 05:12:19,089 INFO L226 Difference]: Without dead ends: 50052 [2019-12-27 05:12:19,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:12:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50052 states. [2019-12-27 05:12:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50052 to 26005. [2019-12-27 05:12:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26005 states. [2019-12-27 05:12:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26005 states to 26005 states and 81431 transitions. [2019-12-27 05:12:19,698 INFO L78 Accepts]: Start accepts. Automaton has 26005 states and 81431 transitions. Word has length 64 [2019-12-27 05:12:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:19,698 INFO L462 AbstractCegarLoop]: Abstraction has 26005 states and 81431 transitions. [2019-12-27 05:12:19,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:12:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 26005 states and 81431 transitions. [2019-12-27 05:12:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:19,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:19,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:19,729 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:19,729 INFO L82 PathProgramCache]: Analyzing trace with hash -807176034, now seen corresponding path program 2 times [2019-12-27 05:12:19,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:19,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659549833] [2019-12-27 05:12:19,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:19,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659549833] [2019-12-27 05:12:19,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:19,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:12:19,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368260968] [2019-12-27 05:12:19,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:12:19,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:19,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:12:19,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:12:19,836 INFO L87 Difference]: Start difference. First operand 26005 states and 81431 transitions. Second operand 8 states. [2019-12-27 05:12:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:21,191 INFO L93 Difference]: Finished difference Result 113185 states and 347411 transitions. [2019-12-27 05:12:21,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:12:21,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 05:12:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:21,322 INFO L225 Difference]: With dead ends: 113185 [2019-12-27 05:12:21,322 INFO L226 Difference]: Without dead ends: 77700 [2019-12-27 05:12:21,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:12:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77700 states. [2019-12-27 05:12:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77700 to 30272. [2019-12-27 05:12:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30272 states. [2019-12-27 05:12:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30272 states to 30272 states and 94495 transitions. [2019-12-27 05:12:22,579 INFO L78 Accepts]: Start accepts. Automaton has 30272 states and 94495 transitions. Word has length 64 [2019-12-27 05:12:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:22,579 INFO L462 AbstractCegarLoop]: Abstraction has 30272 states and 94495 transitions. [2019-12-27 05:12:22,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:12:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 30272 states and 94495 transitions. [2019-12-27 05:12:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:22,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:22,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:22,613 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:22,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:22,614 INFO L82 PathProgramCache]: Analyzing trace with hash -584020796, now seen corresponding path program 3 times [2019-12-27 05:12:22,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:22,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812899831] [2019-12-27 05:12:22,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:22,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812899831] [2019-12-27 05:12:22,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:22,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:12:22,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678524305] [2019-12-27 05:12:22,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:12:22,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:22,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:12:22,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:12:22,721 INFO L87 Difference]: Start difference. First operand 30272 states and 94495 transitions. Second operand 9 states. [2019-12-27 05:12:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:24,638 INFO L93 Difference]: Finished difference Result 168743 states and 512930 transitions. [2019-12-27 05:12:24,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 05:12:24,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 05:12:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:24,854 INFO L225 Difference]: With dead ends: 168743 [2019-12-27 05:12:24,855 INFO L226 Difference]: Without dead ends: 133640 [2019-12-27 05:12:24,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 05:12:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133640 states. [2019-12-27 05:12:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133640 to 36293. [2019-12-27 05:12:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36293 states. [2019-12-27 05:12:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36293 states to 36293 states and 113283 transitions. [2019-12-27 05:12:26,648 INFO L78 Accepts]: Start accepts. Automaton has 36293 states and 113283 transitions. Word has length 64 [2019-12-27 05:12:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:26,649 INFO L462 AbstractCegarLoop]: Abstraction has 36293 states and 113283 transitions. [2019-12-27 05:12:26,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:12:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 36293 states and 113283 transitions. [2019-12-27 05:12:26,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:26,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:26,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:26,700 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:26,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2052967778, now seen corresponding path program 4 times [2019-12-27 05:12:26,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:26,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754136163] [2019-12-27 05:12:26,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:26,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754136163] [2019-12-27 05:12:26,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:26,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:12:26,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269128814] [2019-12-27 05:12:26,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:12:26,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:26,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:12:26,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:12:26,835 INFO L87 Difference]: Start difference. First operand 36293 states and 113283 transitions. Second operand 9 states. [2019-12-27 05:12:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:29,008 INFO L93 Difference]: Finished difference Result 130467 states and 395891 transitions. [2019-12-27 05:12:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 05:12:29,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 05:12:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:29,199 INFO L225 Difference]: With dead ends: 130467 [2019-12-27 05:12:29,199 INFO L226 Difference]: Without dead ends: 120912 [2019-12-27 05:12:29,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-27 05:12:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120912 states. [2019-12-27 05:12:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120912 to 35767. [2019-12-27 05:12:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35767 states. [2019-12-27 05:12:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35767 states to 35767 states and 111764 transitions. [2019-12-27 05:12:30,957 INFO L78 Accepts]: Start accepts. Automaton has 35767 states and 111764 transitions. Word has length 64 [2019-12-27 05:12:30,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:30,958 INFO L462 AbstractCegarLoop]: Abstraction has 35767 states and 111764 transitions. [2019-12-27 05:12:30,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:12:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 35767 states and 111764 transitions. [2019-12-27 05:12:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:31,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:31,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:31,003 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:31,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:31,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1570564162, now seen corresponding path program 5 times [2019-12-27 05:12:31,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:31,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692742700] [2019-12-27 05:12:31,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:31,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692742700] [2019-12-27 05:12:31,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:31,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:12:31,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866167230] [2019-12-27 05:12:31,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:12:31,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:31,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:12:31,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:12:31,075 INFO L87 Difference]: Start difference. First operand 35767 states and 111764 transitions. Second operand 7 states. [2019-12-27 05:12:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:31,728 INFO L93 Difference]: Finished difference Result 73111 states and 223213 transitions. [2019-12-27 05:12:31,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:12:31,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:12:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:31,869 INFO L225 Difference]: With dead ends: 73111 [2019-12-27 05:12:31,869 INFO L226 Difference]: Without dead ends: 64213 [2019-12-27 05:12:31,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:12:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64213 states. [2019-12-27 05:12:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64213 to 35831. [2019-12-27 05:12:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35831 states. [2019-12-27 05:12:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35831 states to 35831 states and 111893 transitions. [2019-12-27 05:12:32,707 INFO L78 Accepts]: Start accepts. Automaton has 35831 states and 111893 transitions. Word has length 64 [2019-12-27 05:12:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:32,707 INFO L462 AbstractCegarLoop]: Abstraction has 35831 states and 111893 transitions. [2019-12-27 05:12:32,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:12:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 35831 states and 111893 transitions. [2019-12-27 05:12:32,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:32,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:32,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:32,749 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:32,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:32,750 INFO L82 PathProgramCache]: Analyzing trace with hash -606436500, now seen corresponding path program 6 times [2019-12-27 05:12:32,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:32,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490379493] [2019-12-27 05:12:32,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:32,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490379493] [2019-12-27 05:12:32,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:32,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:12:32,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727185246] [2019-12-27 05:12:32,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:32,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:32,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:32,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:32,809 INFO L87 Difference]: Start difference. First operand 35831 states and 111893 transitions. Second operand 3 states. [2019-12-27 05:12:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:32,998 INFO L93 Difference]: Finished difference Result 41492 states and 128658 transitions. [2019-12-27 05:12:32,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:32,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 05:12:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:33,065 INFO L225 Difference]: With dead ends: 41492 [2019-12-27 05:12:33,065 INFO L226 Difference]: Without dead ends: 41492 [2019-12-27 05:12:33,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:33,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41492 states. [2019-12-27 05:12:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41492 to 36534. [2019-12-27 05:12:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36534 states. [2019-12-27 05:12:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36534 states to 36534 states and 114238 transitions. [2019-12-27 05:12:33,949 INFO L78 Accepts]: Start accepts. Automaton has 36534 states and 114238 transitions. Word has length 64 [2019-12-27 05:12:33,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:33,949 INFO L462 AbstractCegarLoop]: Abstraction has 36534 states and 114238 transitions. [2019-12-27 05:12:33,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 36534 states and 114238 transitions. [2019-12-27 05:12:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:12:33,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:33,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:33,992 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:33,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:33,993 INFO L82 PathProgramCache]: Analyzing trace with hash -748291407, now seen corresponding path program 1 times [2019-12-27 05:12:33,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:33,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907571191] [2019-12-27 05:12:33,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:34,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907571191] [2019-12-27 05:12:34,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:34,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:12:34,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894644937] [2019-12-27 05:12:34,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:12:34,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:34,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:12:34,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:12:34,050 INFO L87 Difference]: Start difference. First operand 36534 states and 114238 transitions. Second operand 4 states. [2019-12-27 05:12:34,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:34,323 INFO L93 Difference]: Finished difference Result 45284 states and 140098 transitions. [2019-12-27 05:12:34,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:12:34,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 05:12:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:34,390 INFO L225 Difference]: With dead ends: 45284 [2019-12-27 05:12:34,390 INFO L226 Difference]: Without dead ends: 45284 [2019-12-27 05:12:34,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:12:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45284 states. [2019-12-27 05:12:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45284 to 37392. [2019-12-27 05:12:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37392 states. [2019-12-27 05:12:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37392 states to 37392 states and 116839 transitions. [2019-12-27 05:12:35,054 INFO L78 Accepts]: Start accepts. Automaton has 37392 states and 116839 transitions. Word has length 65 [2019-12-27 05:12:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:35,055 INFO L462 AbstractCegarLoop]: Abstraction has 37392 states and 116839 transitions. [2019-12-27 05:12:35,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:12:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 37392 states and 116839 transitions. [2019-12-27 05:12:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:12:35,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:35,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:35,097 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:35,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:35,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1146257839, now seen corresponding path program 2 times [2019-12-27 05:12:35,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:35,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349621589] [2019-12-27 05:12:35,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:35,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349621589] [2019-12-27 05:12:35,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:35,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:12:35,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399450397] [2019-12-27 05:12:35,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:12:35,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:35,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:12:35,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:12:35,148 INFO L87 Difference]: Start difference. First operand 37392 states and 116839 transitions. Second operand 4 states. [2019-12-27 05:12:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:35,679 INFO L93 Difference]: Finished difference Result 52375 states and 163071 transitions. [2019-12-27 05:12:35,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:12:35,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 05:12:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:35,788 INFO L225 Difference]: With dead ends: 52375 [2019-12-27 05:12:35,789 INFO L226 Difference]: Without dead ends: 52375 [2019-12-27 05:12:35,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:12:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52375 states. [2019-12-27 05:12:36,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52375 to 39294. [2019-12-27 05:12:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39294 states. [2019-12-27 05:12:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39294 states to 39294 states and 124071 transitions. [2019-12-27 05:12:36,868 INFO L78 Accepts]: Start accepts. Automaton has 39294 states and 124071 transitions. Word has length 65 [2019-12-27 05:12:36,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:36,868 INFO L462 AbstractCegarLoop]: Abstraction has 39294 states and 124071 transitions. [2019-12-27 05:12:36,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:12:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 39294 states and 124071 transitions. [2019-12-27 05:12:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:12:36,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:36,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:36,919 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:36,920 INFO L82 PathProgramCache]: Analyzing trace with hash -232484785, now seen corresponding path program 3 times [2019-12-27 05:12:36,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:36,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560075593] [2019-12-27 05:12:36,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:37,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560075593] [2019-12-27 05:12:37,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:37,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:12:37,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634973926] [2019-12-27 05:12:37,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:12:37,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:37,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:12:37,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:12:37,021 INFO L87 Difference]: Start difference. First operand 39294 states and 124071 transitions. Second operand 8 states. [2019-12-27 05:12:38,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:38,144 INFO L93 Difference]: Finished difference Result 111154 states and 345137 transitions. [2019-12-27 05:12:38,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:12:38,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 05:12:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:38,311 INFO L225 Difference]: With dead ends: 111154 [2019-12-27 05:12:38,312 INFO L226 Difference]: Without dead ends: 103541 [2019-12-27 05:12:38,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 05:12:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103541 states. [2019-12-27 05:12:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103541 to 39904. [2019-12-27 05:12:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39904 states. [2019-12-27 05:12:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39904 states to 39904 states and 126332 transitions. [2019-12-27 05:12:40,148 INFO L78 Accepts]: Start accepts. Automaton has 39904 states and 126332 transitions. Word has length 65 [2019-12-27 05:12:40,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:40,148 INFO L462 AbstractCegarLoop]: Abstraction has 39904 states and 126332 transitions. [2019-12-27 05:12:40,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:12:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 39904 states and 126332 transitions. [2019-12-27 05:12:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:12:40,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:40,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:40,194 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:40,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:40,194 INFO L82 PathProgramCache]: Analyzing trace with hash 208975201, now seen corresponding path program 4 times [2019-12-27 05:12:40,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:40,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521572596] [2019-12-27 05:12:40,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:40,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521572596] [2019-12-27 05:12:40,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:40,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:12:40,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132267001] [2019-12-27 05:12:40,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:12:40,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:40,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:12:40,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:12:40,330 INFO L87 Difference]: Start difference. First operand 39904 states and 126332 transitions. Second operand 9 states. [2019-12-27 05:12:41,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:41,933 INFO L93 Difference]: Finished difference Result 139705 states and 428487 transitions. [2019-12-27 05:12:41,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 05:12:41,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:12:41,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:42,144 INFO L225 Difference]: With dead ends: 139705 [2019-12-27 05:12:42,144 INFO L226 Difference]: Without dead ends: 129264 [2019-12-27 05:12:42,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2019-12-27 05:12:42,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129264 states. [2019-12-27 05:12:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129264 to 40930. [2019-12-27 05:12:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40930 states. [2019-12-27 05:12:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40930 states to 40930 states and 128544 transitions. [2019-12-27 05:12:43,540 INFO L78 Accepts]: Start accepts. Automaton has 40930 states and 128544 transitions. Word has length 65 [2019-12-27 05:12:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:43,540 INFO L462 AbstractCegarLoop]: Abstraction has 40930 states and 128544 transitions. [2019-12-27 05:12:43,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:12:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 40930 states and 128544 transitions. [2019-12-27 05:12:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:12:43,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:43,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:43,591 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:43,591 INFO L82 PathProgramCache]: Analyzing trace with hash 652655719, now seen corresponding path program 5 times [2019-12-27 05:12:43,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:43,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476745443] [2019-12-27 05:12:43,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:44,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476745443] [2019-12-27 05:12:44,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:44,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:12:44,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816491401] [2019-12-27 05:12:44,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:12:44,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:44,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:12:44,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:12:44,153 INFO L87 Difference]: Start difference. First operand 40930 states and 128544 transitions. Second operand 9 states. [2019-12-27 05:12:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:45,769 INFO L93 Difference]: Finished difference Result 118599 states and 362563 transitions. [2019-12-27 05:12:45,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:12:45,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:12:45,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:45,949 INFO L225 Difference]: With dead ends: 118599 [2019-12-27 05:12:45,949 INFO L226 Difference]: Without dead ends: 113587 [2019-12-27 05:12:45,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 05:12:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113587 states. [2019-12-27 05:12:47,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113587 to 39327. [2019-12-27 05:12:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39327 states. [2019-12-27 05:12:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39327 states to 39327 states and 124096 transitions. [2019-12-27 05:12:47,253 INFO L78 Accepts]: Start accepts. Automaton has 39327 states and 124096 transitions. Word has length 65 [2019-12-27 05:12:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:47,253 INFO L462 AbstractCegarLoop]: Abstraction has 39327 states and 124096 transitions. [2019-12-27 05:12:47,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:12:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 39327 states and 124096 transitions. [2019-12-27 05:12:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:12:47,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:47,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:47,305 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:47,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:47,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1727661840, now seen corresponding path program 1 times [2019-12-27 05:12:47,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:47,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013078429] [2019-12-27 05:12:47,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:47,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013078429] [2019-12-27 05:12:47,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:47,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:12:47,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508847584] [2019-12-27 05:12:47,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:12:47,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:47,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:12:47,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:12:47,443 INFO L87 Difference]: Start difference. First operand 39327 states and 124096 transitions. Second operand 7 states. [2019-12-27 05:12:49,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:49,100 INFO L93 Difference]: Finished difference Result 68485 states and 209927 transitions. [2019-12-27 05:12:49,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:12:49,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:12:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:49,576 INFO L225 Difference]: With dead ends: 68485 [2019-12-27 05:12:49,576 INFO L226 Difference]: Without dead ends: 68485 [2019-12-27 05:12:49,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:12:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68485 states. [2019-12-27 05:12:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68485 to 39927. [2019-12-27 05:12:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39927 states. [2019-12-27 05:12:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39927 states to 39927 states and 125888 transitions. [2019-12-27 05:12:50,466 INFO L78 Accepts]: Start accepts. Automaton has 39927 states and 125888 transitions. Word has length 65 [2019-12-27 05:12:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:50,466 INFO L462 AbstractCegarLoop]: Abstraction has 39927 states and 125888 transitions. [2019-12-27 05:12:50,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:12:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 39927 states and 125888 transitions. [2019-12-27 05:12:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:12:50,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:50,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:50,517 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:50,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:50,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1601587072, now seen corresponding path program 2 times [2019-12-27 05:12:50,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:50,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684829728] [2019-12-27 05:12:50,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:50,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684829728] [2019-12-27 05:12:50,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:50,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:12:50,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958104139] [2019-12-27 05:12:50,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:12:50,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:50,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:12:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:12:50,685 INFO L87 Difference]: Start difference. First operand 39927 states and 125888 transitions. Second operand 8 states. [2019-12-27 05:12:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:52,679 INFO L93 Difference]: Finished difference Result 77088 states and 236106 transitions. [2019-12-27 05:12:52,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:12:52,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 05:12:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:52,798 INFO L225 Difference]: With dead ends: 77088 [2019-12-27 05:12:52,798 INFO L226 Difference]: Without dead ends: 77088 [2019-12-27 05:12:52,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:12:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77088 states. [2019-12-27 05:12:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77088 to 41392. [2019-12-27 05:12:54,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41392 states. [2019-12-27 05:12:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41392 states to 41392 states and 130708 transitions. [2019-12-27 05:12:54,285 INFO L78 Accepts]: Start accepts. Automaton has 41392 states and 130708 transitions. Word has length 65 [2019-12-27 05:12:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:54,285 INFO L462 AbstractCegarLoop]: Abstraction has 41392 states and 130708 transitions. [2019-12-27 05:12:54,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:12:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 41392 states and 130708 transitions. [2019-12-27 05:12:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:12:54,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:54,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:54,332 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:54,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2080466144, now seen corresponding path program 3 times [2019-12-27 05:12:54,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:54,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633329694] [2019-12-27 05:12:54,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:54,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633329694] [2019-12-27 05:12:54,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:54,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:12:54,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764941030] [2019-12-27 05:12:54,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:54,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:54,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:54,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:54,420 INFO L87 Difference]: Start difference. First operand 41392 states and 130708 transitions. Second operand 3 states. [2019-12-27 05:12:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:54,528 INFO L93 Difference]: Finished difference Result 30086 states and 94131 transitions. [2019-12-27 05:12:54,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:54,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:12:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:54,571 INFO L225 Difference]: With dead ends: 30086 [2019-12-27 05:12:54,571 INFO L226 Difference]: Without dead ends: 30086 [2019-12-27 05:12:54,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30086 states. [2019-12-27 05:12:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30086 to 27999. [2019-12-27 05:12:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27999 states. [2019-12-27 05:12:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27999 states to 27999 states and 87356 transitions. [2019-12-27 05:12:55,012 INFO L78 Accepts]: Start accepts. Automaton has 27999 states and 87356 transitions. Word has length 65 [2019-12-27 05:12:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:55,013 INFO L462 AbstractCegarLoop]: Abstraction has 27999 states and 87356 transitions. [2019-12-27 05:12:55,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 27999 states and 87356 transitions. [2019-12-27 05:12:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:12:55,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:55,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:55,044 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:55,044 INFO L82 PathProgramCache]: Analyzing trace with hash -666708629, now seen corresponding path program 1 times [2019-12-27 05:12:55,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:55,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031906080] [2019-12-27 05:12:55,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:55,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031906080] [2019-12-27 05:12:55,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:55,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:12:55,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384069340] [2019-12-27 05:12:55,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:55,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:55,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:55,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:55,113 INFO L87 Difference]: Start difference. First operand 27999 states and 87356 transitions. Second operand 3 states. [2019-12-27 05:12:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:55,258 INFO L93 Difference]: Finished difference Result 27999 states and 87355 transitions. [2019-12-27 05:12:55,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:55,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:12:55,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:55,312 INFO L225 Difference]: With dead ends: 27999 [2019-12-27 05:12:55,312 INFO L226 Difference]: Without dead ends: 27999 [2019-12-27 05:12:55,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27999 states. [2019-12-27 05:12:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27999 to 20919. [2019-12-27 05:12:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20919 states. [2019-12-27 05:12:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20919 states to 20919 states and 65920 transitions. [2019-12-27 05:12:55,700 INFO L78 Accepts]: Start accepts. Automaton has 20919 states and 65920 transitions. Word has length 66 [2019-12-27 05:12:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:55,700 INFO L462 AbstractCegarLoop]: Abstraction has 20919 states and 65920 transitions. [2019-12-27 05:12:55,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 20919 states and 65920 transitions. [2019-12-27 05:12:55,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:12:55,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:55,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:55,722 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:55,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash -190644257, now seen corresponding path program 1 times [2019-12-27 05:12:55,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:55,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729751388] [2019-12-27 05:12:55,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:12:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:12:55,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:12:55,849 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:12:55,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~z$r_buff1_thd0~0_25) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~z$r_buff0_thd3~0_76 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= v_~z~0_28 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t159~0.base_19| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t159~0.base_19|) |v_ULTIMATE.start_main_~#t159~0.offset_15| 0)) |v_#memory_int_19|) (= v_~z$r_buff0_thd2~0_20 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$read_delayed~0_6 0) (= 0 v_~weak$$choice2~0_32) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t159~0.base_19|) (= 0 v_~z$r_buff1_thd2~0_16) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t159~0.base_19| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd1~0_27 0) (= v_~x~0_18 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~z$w_buff1_used~0_74) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t159~0.base_19| 1)) (= v_~z$w_buff0_used~0_111 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t159~0.base_19|)) (= 0 v_~z$r_buff1_thd1~0_19) (= |v_ULTIMATE.start_main_~#t159~0.offset_15| 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_25) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_24) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t161~0.offset=|v_ULTIMATE.start_main_~#t161~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ULTIMATE.start_main_~#t159~0.base=|v_ULTIMATE.start_main_~#t159~0.base_19|, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ULTIMATE.start_main_~#t160~0.base=|v_ULTIMATE.start_main_~#t160~0.base_18|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_76, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_18, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_24, ULTIMATE.start_main_~#t161~0.base=|v_ULTIMATE.start_main_~#t161~0.base_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t160~0.offset=|v_ULTIMATE.start_main_~#t160~0.offset_14|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t159~0.offset=|v_ULTIMATE.start_main_~#t159~0.offset_15|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t161~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t159~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_~#t160~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ULTIMATE.start_main_~#t161~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t160~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t159~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:12:55,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L830-1-->L832: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t160~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t160~0.base_11|) |v_ULTIMATE.start_main_~#t160~0.offset_9| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t160~0.base_11| 0)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t160~0.base_11| 1) |v_#valid_35|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t160~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t160~0.offset_9|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t160~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t160~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t160~0.base=|v_ULTIMATE.start_main_~#t160~0.base_11|, ULTIMATE.start_main_~#t160~0.offset=|v_ULTIMATE.start_main_~#t160~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t160~0.base, ULTIMATE.start_main_~#t160~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 05:12:55,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= 1 v_~x~0_6) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd3~0_45 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd1~0_17 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd1~0_18 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 05:12:55,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In467223488 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In467223488 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In467223488 |P1Thread1of1ForFork2_#t~ite9_Out467223488|)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In467223488 |P1Thread1of1ForFork2_#t~ite9_Out467223488|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In467223488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In467223488, ~z$w_buff1~0=~z$w_buff1~0_In467223488, ~z~0=~z~0_In467223488} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out467223488|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In467223488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In467223488, ~z$w_buff1~0=~z$w_buff1~0_In467223488, ~z~0=~z~0_In467223488} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 05:12:55,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= v_~z~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 05:12:55,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1416064928 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1416064928 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1416064928| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1416064928| ~z$w_buff0_used~0_In-1416064928) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1416064928, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1416064928} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1416064928, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1416064928|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1416064928} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:12:55,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1818428114 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1818428114 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-1818428114 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1818428114 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1818428114| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-1818428114| ~z$w_buff1_used~0_In-1818428114)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1818428114, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1818428114, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1818428114, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1818428114} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1818428114, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1818428114, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1818428114, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1818428114|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1818428114} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:12:55,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t161~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t161~0.base_9|) |v_ULTIMATE.start_main_~#t161~0.offset_8| 2))) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t161~0.base_9|) 0) (not (= |v_ULTIMATE.start_main_~#t161~0.base_9| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t161~0.base_9|) (= |v_ULTIMATE.start_main_~#t161~0.offset_8| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t161~0.base_9| 1) |v_#valid_27|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t161~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t161~0.offset=|v_ULTIMATE.start_main_~#t161~0.offset_8|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t161~0.base=|v_ULTIMATE.start_main_~#t161~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t161~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t161~0.base, #length] because there is no mapped edge [2019-12-27 05:12:55,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2017112183 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-2017112183| ~z$w_buff0~0_In-2017112183) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-2017112183 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-2017112183 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-2017112183 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-2017112183 256)))) (= |P2Thread1of1ForFork0_#t~ite21_Out-2017112183| |P2Thread1of1ForFork0_#t~ite20_Out-2017112183|)) (and (= |P2Thread1of1ForFork0_#t~ite20_In-2017112183| |P2Thread1of1ForFork0_#t~ite20_Out-2017112183|) (= |P2Thread1of1ForFork0_#t~ite21_Out-2017112183| ~z$w_buff0~0_In-2017112183) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-2017112183, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2017112183, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2017112183, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2017112183, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2017112183, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-2017112183|, ~weak$$choice2~0=~weak$$choice2~0_In-2017112183} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-2017112183|, ~z$w_buff0~0=~z$w_buff0~0_In-2017112183, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2017112183, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2017112183, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2017112183, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2017112183, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-2017112183|, ~weak$$choice2~0=~weak$$choice2~0_In-2017112183} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 05:12:55,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L797-->L797-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1521258172 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1521258172 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1521258172 256)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1521258172 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In1521258172 256)) .cse0))) .cse1 (= ~z$w_buff1~0_In1521258172 |P2Thread1of1ForFork0_#t~ite23_Out1521258172|) (= |P2Thread1of1ForFork0_#t~ite23_Out1521258172| |P2Thread1of1ForFork0_#t~ite24_Out1521258172|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite23_In1521258172| |P2Thread1of1ForFork0_#t~ite23_Out1521258172|) (= ~z$w_buff1~0_In1521258172 |P2Thread1of1ForFork0_#t~ite24_Out1521258172|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1521258172, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1521258172, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1521258172|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1521258172, ~z$w_buff1~0=~z$w_buff1~0_In1521258172, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1521258172, ~weak$$choice2~0=~weak$$choice2~0_In1521258172} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1521258172, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1521258172|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1521258172, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1521258172|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1521258172, ~z$w_buff1~0=~z$w_buff1~0_In1521258172, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1521258172, ~weak$$choice2~0=~weak$$choice2~0_In1521258172} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 05:12:55,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1170985415 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In1170985415| |P2Thread1of1ForFork0_#t~ite26_Out1170985415|) (= |P2Thread1of1ForFork0_#t~ite27_Out1170985415| ~z$w_buff0_used~0_In1170985415)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1170985415 256)))) (or (and (= (mod ~z$w_buff1_used~0_In1170985415 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1170985415 256)) (and (= (mod ~z$r_buff1_thd3~0_In1170985415 256) 0) .cse1))) .cse0 (= ~z$w_buff0_used~0_In1170985415 |P2Thread1of1ForFork0_#t~ite26_Out1170985415|) (= |P2Thread1of1ForFork0_#t~ite27_Out1170985415| |P2Thread1of1ForFork0_#t~ite26_Out1170985415|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1170985415|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1170985415, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1170985415, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1170985415, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1170985415, ~weak$$choice2~0=~weak$$choice2~0_In1170985415} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1170985415|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1170985415|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1170985415, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1170985415, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1170985415, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1170985415, ~weak$$choice2~0=~weak$$choice2~0_In1170985415} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 05:12:55,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff0_thd3~0_48)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:12:55,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 05:12:55,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In2030511499 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In2030511499 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out2030511499| ~z$w_buff1~0_In2030511499) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out2030511499| ~z~0_In2030511499) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2030511499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2030511499, ~z$w_buff1~0=~z$w_buff1~0_In2030511499, ~z~0=~z~0_In2030511499} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2030511499|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2030511499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2030511499, ~z$w_buff1~0=~z$w_buff1~0_In2030511499, ~z~0=~z~0_In2030511499} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:12:55,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_17 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 05:12:55,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1488449443 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1488449443 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1488449443 |P2Thread1of1ForFork0_#t~ite40_Out-1488449443|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1488449443|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1488449443, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1488449443} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1488449443, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1488449443|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1488449443} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:12:55,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2024846859 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-2024846859 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-2024846859 |P1Thread1of1ForFork2_#t~ite13_Out-2024846859|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-2024846859|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2024846859, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2024846859} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2024846859, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-2024846859|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2024846859} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:12:55,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In319038911 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In319038911 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In319038911 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In319038911 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out319038911|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In319038911 |P1Thread1of1ForFork2_#t~ite14_Out319038911|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In319038911, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In319038911, ~z$w_buff1_used~0=~z$w_buff1_used~0_In319038911, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In319038911} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In319038911, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In319038911, ~z$w_buff1_used~0=~z$w_buff1_used~0_In319038911, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out319038911|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In319038911} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:12:55,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L775-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:12:55,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1365166295 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1365166295 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1365166295 |P0Thread1of1ForFork1_#t~ite5_Out1365166295|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1365166295|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1365166295, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1365166295} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1365166295|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1365166295, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1365166295} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:12:55,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In1149405393 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1149405393 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1149405393 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In1149405393 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out1149405393| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out1149405393| ~z$w_buff1_used~0_In1149405393)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1149405393, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1149405393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1149405393, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1149405393} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1149405393, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1149405393|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1149405393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1149405393, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1149405393} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:12:55,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In338560648 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In338560648 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out338560648)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In338560648 ~z$r_buff0_thd1~0_Out338560648)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In338560648, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In338560648} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In338560648, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out338560648|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out338560648} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:12:55,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In602132045 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In602132045 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In602132045 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In602132045 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out602132045| ~z$r_buff1_thd1~0_In602132045)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out602132045|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In602132045, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In602132045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602132045, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In602132045} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out602132045|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In602132045, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In602132045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602132045, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In602132045} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:12:55,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_16 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:12:55,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In728872103 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In728872103 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In728872103 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In728872103 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out728872103| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out728872103| ~z$w_buff1_used~0_In728872103) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In728872103, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In728872103, ~z$w_buff1_used~0=~z$w_buff1_used~0_In728872103, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In728872103} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In728872103, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In728872103, ~z$w_buff1_used~0=~z$w_buff1_used~0_In728872103, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In728872103, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out728872103|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:12:55,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In73141477 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In73141477 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out73141477|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In73141477 |P2Thread1of1ForFork0_#t~ite42_Out73141477|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In73141477, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In73141477} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In73141477, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In73141477, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out73141477|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:12:55,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1262601395 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1262601395 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1262601395 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1262601395 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1262601395| 0)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1262601395| ~z$r_buff1_thd3~0_In-1262601395) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1262601395, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1262601395, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1262601395, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1262601395} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1262601395|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1262601395, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1262601395, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1262601395, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1262601395} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:12:55,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:12:55,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:12:55,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In545008567 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In545008567 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out545008567| |ULTIMATE.start_main_#t~ite47_Out545008567|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite47_Out545008567| ~z$w_buff1~0_In545008567)) (and (= |ULTIMATE.start_main_#t~ite47_Out545008567| ~z~0_In545008567) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In545008567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In545008567, ~z$w_buff1~0=~z$w_buff1~0_In545008567, ~z~0=~z~0_In545008567} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In545008567, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out545008567|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In545008567, ~z$w_buff1~0=~z$w_buff1~0_In545008567, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out545008567|, ~z~0=~z~0_In545008567} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 05:12:55,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1867879563 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1867879563 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out1867879563|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1867879563 |ULTIMATE.start_main_#t~ite49_Out1867879563|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1867879563, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1867879563} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1867879563, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1867879563, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1867879563|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:12:55,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In55458481 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In55458481 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In55458481 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In55458481 256) 0))) (or (and (= ~z$w_buff1_used~0_In55458481 |ULTIMATE.start_main_#t~ite50_Out55458481|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out55458481| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In55458481, ~z$w_buff0_used~0=~z$w_buff0_used~0_In55458481, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In55458481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In55458481} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out55458481|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In55458481, ~z$w_buff0_used~0=~z$w_buff0_used~0_In55458481, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In55458481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In55458481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:12:55,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1947390120 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1947390120 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-1947390120|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1947390120 |ULTIMATE.start_main_#t~ite51_Out-1947390120|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1947390120, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1947390120} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1947390120, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1947390120|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1947390120} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:12:55,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1032094316 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1032094316 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1032094316 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1032094316 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1032094316| ~z$r_buff1_thd0~0_In-1032094316) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1032094316| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1032094316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1032094316, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1032094316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1032094316} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1032094316|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1032094316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1032094316, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1032094316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1032094316} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:12:55,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_13| v_~z$r_buff1_thd0~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256)) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:12:56,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:12:56 BasicIcfg [2019-12-27 05:12:56,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:12:56,020 INFO L168 Benchmark]: Toolchain (without parser) took 124652.47 ms. Allocated memory was 140.0 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 103.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 05:12:56,021 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 05:12:56,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.87 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 102.9 MB in the beginning and 157.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:12:56,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.42 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:12:56,022 INFO L168 Benchmark]: Boogie Preprocessor took 39.39 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:12:56,023 INFO L168 Benchmark]: RCFGBuilder took 872.33 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 102.7 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:12:56,027 INFO L168 Benchmark]: TraceAbstraction took 122876.97 ms. Allocated memory was 204.5 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 102.0 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 05:12:56,030 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.87 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 102.9 MB in the beginning and 157.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.42 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.39 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 872.33 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 102.7 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 122876.97 ms. Allocated memory was 204.5 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 102.0 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 95 ProgramPointsAfterwards, 214 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7246 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82443 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t159, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t160, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t161, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L797] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 122.5s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 41.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8330 SDtfs, 13280 SDslu, 23561 SDs, 0 SdLazy, 14196 SolverSat, 812 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 78 SyntacticMatches, 14 SemanticMatches, 364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158867occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 49.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 809362 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1541 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1441 ConstructedInterpolants, 0 QuantifiedInterpolants, 240534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...