/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:46:38,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:46:38,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:46:38,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:46:38,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:46:38,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:46:38,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:46:38,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:46:38,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:46:38,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:46:38,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:46:38,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:46:38,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:46:38,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:46:38,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:46:38,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:46:38,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:46:38,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:46:38,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:46:38,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:46:38,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:46:38,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:46:38,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:46:38,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:46:38,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:46:38,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:46:38,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:46:38,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:46:38,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:46:38,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:46:38,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:46:38,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:46:38,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:46:38,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:46:38,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:46:38,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:46:38,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:46:38,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:46:38,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:46:38,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:46:38,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:46:38,213 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:46:38,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:46:38,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:46:38,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:46:38,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:46:38,229 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:46:38,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:46:38,229 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:46:38,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:46:38,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:46:38,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:46:38,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:46:38,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:46:38,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:46:38,231 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:46:38,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:46:38,231 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:46:38,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:46:38,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:46:38,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:46:38,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:46:38,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:46:38,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:46:38,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:46:38,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:46:38,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:46:38,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:46:38,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:46:38,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:46:38,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:46:38,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:46:38,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:46:38,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:46:38,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:46:38,513 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:46:38,513 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:46:38,514 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i [2019-12-26 21:46:38,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/050d24d7d/73f44823b5f64830842c156c4020b735/FLAGa5fe452b2 [2019-12-26 21:46:39,137 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:46:39,138 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i [2019-12-26 21:46:39,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/050d24d7d/73f44823b5f64830842c156c4020b735/FLAGa5fe452b2 [2019-12-26 21:46:39,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/050d24d7d/73f44823b5f64830842c156c4020b735 [2019-12-26 21:46:39,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:46:39,481 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:46:39,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:46:39,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:46:39,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:46:39,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:46:39" (1/1) ... [2019-12-26 21:46:39,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23588bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:39, skipping insertion in model container [2019-12-26 21:46:39,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:46:39" (1/1) ... [2019-12-26 21:46:39,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:46:39,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:46:40,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:46:40,123 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:46:40,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:46:40,340 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:46:40,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:40 WrapperNode [2019-12-26 21:46:40,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:46:40,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:46:40,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:46:40,342 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:46:40,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:40" (1/1) ... [2019-12-26 21:46:40,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:40" (1/1) ... [2019-12-26 21:46:40,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:46:40,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:46:40,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:46:40,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:46:40,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:40" (1/1) ... [2019-12-26 21:46:40,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:40" (1/1) ... [2019-12-26 21:46:40,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:40" (1/1) ... [2019-12-26 21:46:40,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:40" (1/1) ... [2019-12-26 21:46:40,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:40" (1/1) ... [2019-12-26 21:46:40,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:40" (1/1) ... [2019-12-26 21:46:40,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:40" (1/1) ... [2019-12-26 21:46:40,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:46:40,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:46:40,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:46:40,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:46:40,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:40" (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-26 21:46:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:46:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:46:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:46:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:46:40,600 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:46:40,600 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:46:40,600 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:46:40,600 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:46:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:46:40,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:46:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:46:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:46:40,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:46:40,604 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:46:41,455 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:46:41,455 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:46:41,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:46:41 BoogieIcfgContainer [2019-12-26 21:46:41,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:46:41,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:46:41,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:46:41,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:46:41,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:46:39" (1/3) ... [2019-12-26 21:46:41,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3527bbaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:46:41, skipping insertion in model container [2019-12-26 21:46:41,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:46:40" (2/3) ... [2019-12-26 21:46:41,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3527bbaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:46:41, skipping insertion in model container [2019-12-26 21:46:41,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:46:41" (3/3) ... [2019-12-26 21:46:41,470 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_pso.oepc.i [2019-12-26 21:46:41,482 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:46:41,483 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:46:41,495 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:46:41,496 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:46:41,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,551 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,551 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,551 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,552 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,552 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,561 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,561 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,591 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,591 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,619 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,621 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,629 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,629 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,629 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,631 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,632 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:46:41,648 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:46:41,672 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:46:41,673 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:46:41,673 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:46:41,673 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:46:41,673 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:46:41,673 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:46:41,673 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:46:41,673 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:46:41,696 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-26 21:46:41,698 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 21:46:41,816 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 21:46:41,817 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:46:41,835 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:46:41,858 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 21:46:41,948 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 21:46:41,949 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:46:41,961 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:46:41,986 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:46:41,987 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:46:46,677 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-26 21:46:47,397 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 21:46:47,526 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 21:46:47,784 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-26 21:46:47,784 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-26 21:46:47,788 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-26 21:47:09,278 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-26 21:47:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-26 21:47:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:47:09,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:09,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:47:09,287 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-26 21:47:09,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-26 21:47:09,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:09,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64451228] [2019-12-26 21:47:09,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:09,546 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-26 21:47:09,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64451228] [2019-12-26 21:47:09,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:09,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:47:09,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107962742] [2019-12-26 21:47:09,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:47:09,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:09,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:47:09,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:47:09,572 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-26 21:47:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:13,845 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-26 21:47:13,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:47:13,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:47:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:14,686 INFO L225 Difference]: With dead ends: 121140 [2019-12-26 21:47:14,686 INFO L226 Difference]: Without dead ends: 107958 [2019-12-26 21:47:14,688 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-26 21:47:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-26 21:47:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-26 21:47:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-26 21:47:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-26 21:47:23,607 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-26 21:47:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:23,608 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-26 21:47:23,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:47:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-26 21:47:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:47:23,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:23,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:47:23,613 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-26 21:47:23,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:23,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-26 21:47:23,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:23,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658622993] [2019-12-26 21:47:23,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:23,727 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-26 21:47:23,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658622993] [2019-12-26 21:47:23,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:23,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:47:23,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259157775] [2019-12-26 21:47:23,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:47:23,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:23,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:47:23,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:47:23,731 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-26 21:47:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:28,528 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-26 21:47:28,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:47:28,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:47:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:29,121 INFO L225 Difference]: With dead ends: 172022 [2019-12-26 21:47:29,121 INFO L226 Difference]: Without dead ends: 171924 [2019-12-26 21:47:29,122 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-26 21:47:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-26 21:47:40,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-26 21:47:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-26 21:47:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-26 21:47:41,477 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-26 21:47:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:41,477 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-26 21:47:41,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:47:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-26 21:47:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:47:41,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:41,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:47:41,485 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-26 21:47:41,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:41,486 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-26 21:47:41,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:41,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681197953] [2019-12-26 21:47:41,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:41,546 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-26 21:47:41,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681197953] [2019-12-26 21:47:41,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:41,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:47:41,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99894303] [2019-12-26 21:47:41,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:47:41,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:41,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:47:41,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:47:41,549 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-26 21:47:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:41,683 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-26 21:47:41,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:47:41,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:47:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:46,587 INFO L225 Difference]: With dead ends: 33388 [2019-12-26 21:47:46,588 INFO L226 Difference]: Without dead ends: 33388 [2019-12-26 21:47:46,588 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-26 21:47:46,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-26 21:47:47,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-26 21:47:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-26 21:47:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-26 21:47:47,229 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-26 21:47:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:47,230 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-26 21:47:47,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:47:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-26 21:47:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:47:47,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:47,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:47:47,233 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-26 21:47:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-26 21:47:47,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:47,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207156858] [2019-12-26 21:47:47,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:47,320 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-26 21:47:47,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207156858] [2019-12-26 21:47:47,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:47,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:47:47,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662153334] [2019-12-26 21:47:47,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:47:47,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:47,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:47:47,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:47:47,322 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-26 21:47:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:47,520 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-26 21:47:47,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:47:47,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 21:47:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:47,625 INFO L225 Difference]: With dead ends: 52822 [2019-12-26 21:47:47,626 INFO L226 Difference]: Without dead ends: 52822 [2019-12-26 21:47:47,626 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-26 21:47:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-26 21:47:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-26 21:47:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-26 21:47:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-26 21:47:48,893 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-26 21:47:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:48,894 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-26 21:47:48,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:47:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-26 21:47:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:47:48,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:48,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:47:48,898 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-26 21:47:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-26 21:47:48,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:48,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149073017] [2019-12-26 21:47:48,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:48,971 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-26 21:47:48,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149073017] [2019-12-26 21:47:48,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:48,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:47:48,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782107605] [2019-12-26 21:47:48,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:47:48,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:48,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:47:48,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:47:48,973 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-26 21:47:49,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:49,316 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-26 21:47:49,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:47:49,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:47:49,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:49,398 INFO L225 Difference]: With dead ends: 46903 [2019-12-26 21:47:49,399 INFO L226 Difference]: Without dead ends: 46903 [2019-12-26 21:47:49,399 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-26 21:47:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-26 21:47:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-26 21:47:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-26 21:47:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-26 21:47:50,152 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-26 21:47:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:50,153 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-26 21:47:50,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:47:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-26 21:47:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:47:50,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:50,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:47:50,157 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-26 21:47:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:50,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-26 21:47:50,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:50,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066829337] [2019-12-26 21:47:50,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:50,222 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-26 21:47:50,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066829337] [2019-12-26 21:47:50,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:50,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:47:50,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30264050] [2019-12-26 21:47:50,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:47:50,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:50,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:47:50,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:47:50,224 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-26 21:47:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:50,581 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-26 21:47:50,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:47:50,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:47:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:50,668 INFO L225 Difference]: With dead ends: 51478 [2019-12-26 21:47:50,669 INFO L226 Difference]: Without dead ends: 51478 [2019-12-26 21:47:50,669 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-26 21:47:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-26 21:47:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-26 21:47:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-26 21:47:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-26 21:47:51,747 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-26 21:47:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:51,747 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-26 21:47:51,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:47:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-26 21:47:51,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:47:51,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:51,757 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-26 21:47:51,757 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-26 21:47:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:51,758 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-26 21:47:51,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:51,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635967740] [2019-12-26 21:47:51,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:51,827 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-26 21:47:51,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635967740] [2019-12-26 21:47:51,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:51,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:47:51,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824417552] [2019-12-26 21:47:51,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:47:51,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:51,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:47:51,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:47:51,829 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-26 21:47:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:52,520 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-26 21:47:52,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:47:52,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:47:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:52,626 INFO L225 Difference]: With dead ends: 61264 [2019-12-26 21:47:52,626 INFO L226 Difference]: Without dead ends: 61250 [2019-12-26 21:47:52,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:47:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-26 21:47:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-26 21:47:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-26 21:47:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-26 21:47:53,519 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-26 21:47:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:53,520 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-26 21:47:53,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:47:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-26 21:47:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:47:53,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:53,528 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-26 21:47:53,528 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-26 21:47:53,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:53,529 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-26 21:47:53,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:53,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021129484] [2019-12-26 21:47:53,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:53,598 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-26 21:47:53,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021129484] [2019-12-26 21:47:53,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:53,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:47:53,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661199078] [2019-12-26 21:47:53,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:47:53,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:53,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:47:53,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:47:53,600 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-26 21:47:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:54,448 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-26 21:47:54,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:47:54,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:47:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:54,570 INFO L225 Difference]: With dead ends: 63752 [2019-12-26 21:47:54,570 INFO L226 Difference]: Without dead ends: 63738 [2019-12-26 21:47:54,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:47:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-26 21:47:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-26 21:47:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-26 21:47:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-26 21:47:55,436 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-26 21:47:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:55,436 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-26 21:47:55,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:47:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-26 21:47:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:47:55,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:55,448 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-26 21:47:55,448 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-26 21:47:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:55,449 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-26 21:47:55,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:55,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157307539] [2019-12-26 21:47:55,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:55,502 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-26 21:47:55,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157307539] [2019-12-26 21:47:55,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:55,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:47:55,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731031216] [2019-12-26 21:47:55,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:47:55,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:55,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:47:55,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:47:55,504 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-26 21:47:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:55,578 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-26 21:47:55,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:47:55,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:47:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:55,603 INFO L225 Difference]: With dead ends: 17193 [2019-12-26 21:47:55,603 INFO L226 Difference]: Without dead ends: 17193 [2019-12-26 21:47:55,605 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-26 21:47:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-26 21:47:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-26 21:47:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-26 21:47:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-26 21:47:55,857 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-26 21:47:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:55,857 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-26 21:47:55,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:47:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-26 21:47:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 21:47:55,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:55,870 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] [2019-12-26 21:47:55,870 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-26 21:47:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-26 21:47:55,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:55,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893042281] [2019-12-26 21:47:55,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:55,928 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-26 21:47:55,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893042281] [2019-12-26 21:47:55,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:55,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:47:55,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556131624] [2019-12-26 21:47:55,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:47:55,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:55,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:47:55,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:47:55,930 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-26 21:47:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:56,240 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-26 21:47:56,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:47:56,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 21:47:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:56,272 INFO L225 Difference]: With dead ends: 21613 [2019-12-26 21:47:56,273 INFO L226 Difference]: Without dead ends: 21613 [2019-12-26 21:47:56,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:47:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-26 21:47:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-26 21:47:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-26 21:47:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-26 21:47:56,683 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-26 21:47:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:56,684 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-26 21:47:56,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:47:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-26 21:47:56,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:47:56,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:56,699 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-26 21:47:56,699 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-26 21:47:56,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:56,700 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-26 21:47:56,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:56,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848865301] [2019-12-26 21:47:56,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:56,771 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-26 21:47:56,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848865301] [2019-12-26 21:47:56,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:56,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:47:56,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867646089] [2019-12-26 21:47:56,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:47:56,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:56,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:47:56,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:47:56,773 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-26 21:47:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:57,175 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-26 21:47:57,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:47:57,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 21:47:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:57,219 INFO L225 Difference]: With dead ends: 23624 [2019-12-26 21:47:57,219 INFO L226 Difference]: Without dead ends: 23624 [2019-12-26 21:47:57,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:47:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-26 21:47:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-26 21:47:57,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-26 21:47:57,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-26 21:47:57,522 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-26 21:47:57,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:57,523 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-26 21:47:57,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:47:57,523 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-26 21:47:57,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 21:47:57,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:57,542 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] [2019-12-26 21:47:57,542 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-26 21:47:57,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:57,543 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-26 21:47:57,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:57,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747007555] [2019-12-26 21:47:57,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:57,622 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-26 21:47:57,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747007555] [2019-12-26 21:47:57,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:57,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:47:57,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791893956] [2019-12-26 21:47:57,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:47:57,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:57,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:47:57,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:47:57,624 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-26 21:47:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:58,348 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-26 21:47:58,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:47:58,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-26 21:47:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:58,405 INFO L225 Difference]: With dead ends: 27031 [2019-12-26 21:47:58,405 INFO L226 Difference]: Without dead ends: 27031 [2019-12-26 21:47:58,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:47:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-26 21:47:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-26 21:47:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-26 21:47:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-26 21:47:58,988 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-26 21:47:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:58,989 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-26 21:47:58,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:47:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-26 21:47:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:47:59,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:59,026 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-26 21:47:59,026 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-26 21:47:59,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-26 21:47:59,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:59,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335020296] [2019-12-26 21:47:59,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:59,149 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-26 21:47:59,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335020296] [2019-12-26 21:47:59,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:59,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:47:59,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964512281] [2019-12-26 21:47:59,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:47:59,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:59,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:47:59,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:47:59,152 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-26 21:47:59,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:59,826 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-26 21:47:59,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:47:59,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-26 21:47:59,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:59,872 INFO L225 Difference]: With dead ends: 26334 [2019-12-26 21:47:59,872 INFO L226 Difference]: Without dead ends: 26334 [2019-12-26 21:47:59,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:47:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-26 21:48:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-26 21:48:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-26 21:48:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-26 21:48:00,223 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-26 21:48:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:00,223 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-26 21:48:00,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:48:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-26 21:48:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:48:00,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:00,414 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-26 21:48:00,414 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-26 21:48:00,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:00,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-26 21:48:00,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:00,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006196239] [2019-12-26 21:48:00,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:00,484 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-26 21:48:00,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006196239] [2019-12-26 21:48:00,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:00,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:48:00,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862294509] [2019-12-26 21:48:00,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:48:00,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:00,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:48:00,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:48:00,486 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-26 21:48:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:00,563 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-26 21:48:00,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:48:00,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:48:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:00,601 INFO L225 Difference]: With dead ends: 17641 [2019-12-26 21:48:00,601 INFO L226 Difference]: Without dead ends: 17641 [2019-12-26 21:48:00,602 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-26 21:48:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-26 21:48:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-26 21:48:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-26 21:48:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-26 21:48:00,863 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-26 21:48:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:00,864 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-26 21:48:00,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:48:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-26 21:48:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:48:00,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:00,882 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-26 21:48:00,882 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-26 21:48:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:00,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-26 21:48:00,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:00,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796809689] [2019-12-26 21:48:00,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:00,961 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-26 21:48:00,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796809689] [2019-12-26 21:48:00,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:00,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:48:00,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604356155] [2019-12-26 21:48:00,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:48:00,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:00,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:48:00,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:48:00,963 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-26 21:48:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:01,537 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-26 21:48:01,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:48:01,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:48:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:01,574 INFO L225 Difference]: With dead ends: 25346 [2019-12-26 21:48:01,574 INFO L226 Difference]: Without dead ends: 25346 [2019-12-26 21:48:01,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:48:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-26 21:48:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-26 21:48:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-26 21:48:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-26 21:48:01,926 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-26 21:48:01,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:01,926 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-26 21:48:01,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:48:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-26 21:48:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:48:01,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:01,954 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-26 21:48:01,954 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-26 21:48:01,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:01,954 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-26 21:48:01,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:01,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614227814] [2019-12-26 21:48:01,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:02,006 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-26 21:48:02,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614227814] [2019-12-26 21:48:02,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:02,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:48:02,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171139810] [2019-12-26 21:48:02,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:48:02,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:02,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:48:02,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:48:02,008 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-26 21:48:02,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:02,106 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-26 21:48:02,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:48:02,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:48:02,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:02,137 INFO L225 Difference]: With dead ends: 22175 [2019-12-26 21:48:02,137 INFO L226 Difference]: Without dead ends: 22175 [2019-12-26 21:48:02,137 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-26 21:48:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-26 21:48:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-26 21:48:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-26 21:48:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-26 21:48:02,461 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-26 21:48:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:02,461 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-26 21:48:02,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:48:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-26 21:48:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:48:02,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:02,490 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] [2019-12-26 21:48:02,490 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-26 21:48:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:02,491 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-26 21:48:02,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:02,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150426592] [2019-12-26 21:48:02,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:02,583 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-26 21:48:02,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150426592] [2019-12-26 21:48:02,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:02,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:48:02,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678890821] [2019-12-26 21:48:02,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:48:02,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:02,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:48:02,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:48:02,585 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-26 21:48:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:03,173 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-26 21:48:03,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 21:48:03,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 21:48:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:03,244 INFO L225 Difference]: With dead ends: 62478 [2019-12-26 21:48:03,244 INFO L226 Difference]: Without dead ends: 47634 [2019-12-26 21:48:03,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:48:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-26 21:48:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-26 21:48:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-26 21:48:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-26 21:48:04,020 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-26 21:48:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:04,020 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-26 21:48:04,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:48:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-26 21:48:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:48:04,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:04,053 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] [2019-12-26 21:48:04,053 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-26 21:48:04,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:04,054 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-26 21:48:04,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:04,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241377954] [2019-12-26 21:48:04,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:04,147 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-26 21:48:04,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241377954] [2019-12-26 21:48:04,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:04,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:48:04,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95428736] [2019-12-26 21:48:04,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:48:04,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:04,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:48:04,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:48:04,149 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-26 21:48:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:04,725 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-26 21:48:04,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:48:04,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 21:48:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:04,800 INFO L225 Difference]: With dead ends: 68433 [2019-12-26 21:48:04,800 INFO L226 Difference]: Without dead ends: 48478 [2019-12-26 21:48:04,801 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-26 21:48:04,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-26 21:48:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-26 21:48:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-26 21:48:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-26 21:48:05,426 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-26 21:48:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:05,426 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-26 21:48:05,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:48:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-26 21:48:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:48:05,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:05,460 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] [2019-12-26 21:48:05,460 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-26 21:48:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-26 21:48:05,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:05,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801338568] [2019-12-26 21:48:05,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:05,540 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-26 21:48:05,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801338568] [2019-12-26 21:48:05,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:05,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:48:05,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407407577] [2019-12-26 21:48:05,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:48:05,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:05,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:48:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:48:05,543 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-26 21:48:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:06,081 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-26 21:48:06,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:48:06,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 21:48:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:06,160 INFO L225 Difference]: With dead ends: 59843 [2019-12-26 21:48:06,160 INFO L226 Difference]: Without dead ends: 52762 [2019-12-26 21:48:06,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-26 21:48:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-26 21:48:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-26 21:48:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-26 21:48:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-26 21:48:07,044 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-26 21:48:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:07,044 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-26 21:48:07,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:48:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-26 21:48:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:48:07,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:07,076 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] [2019-12-26 21:48:07,076 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-26 21:48:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:07,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-26 21:48:07,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:07,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241922122] [2019-12-26 21:48:07,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:07,156 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-26 21:48:07,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241922122] [2019-12-26 21:48:07,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:07,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:48:07,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227963288] [2019-12-26 21:48:07,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:48:07,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:48:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:48:07,159 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 3 states. [2019-12-26 21:48:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:07,342 INFO L93 Difference]: Finished difference Result 35624 states and 109784 transitions. [2019-12-26 21:48:07,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:48:07,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-26 21:48:07,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:07,409 INFO L225 Difference]: With dead ends: 35624 [2019-12-26 21:48:07,410 INFO L226 Difference]: Without dead ends: 35624 [2019-12-26 21:48:07,410 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-26 21:48:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35624 states. [2019-12-26 21:48:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35624 to 31022. [2019-12-26 21:48:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2019-12-26 21:48:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 96384 transitions. [2019-12-26 21:48:07,907 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 96384 transitions. Word has length 63 [2019-12-26 21:48:07,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:07,907 INFO L462 AbstractCegarLoop]: Abstraction has 31022 states and 96384 transitions. [2019-12-26 21:48:07,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:48:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 96384 transitions. [2019-12-26 21:48:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:48:07,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:07,941 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-26 21:48:07,941 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-26 21:48:07,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:07,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1820548391, now seen corresponding path program 1 times [2019-12-26 21:48:07,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:07,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797870593] [2019-12-26 21:48:07,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:08,210 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-26 21:48:08,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797870593] [2019-12-26 21:48:08,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:08,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 21:48:08,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38417758] [2019-12-26 21:48:08,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:48:08,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:08,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:48:08,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:48:08,214 INFO L87 Difference]: Start difference. First operand 31022 states and 96384 transitions. Second operand 11 states. [2019-12-26 21:48:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:11,773 INFO L93 Difference]: Finished difference Result 61396 states and 184421 transitions. [2019-12-26 21:48:11,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-26 21:48:11,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-26 21:48:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:11,859 INFO L225 Difference]: With dead ends: 61396 [2019-12-26 21:48:11,859 INFO L226 Difference]: Without dead ends: 61016 [2019-12-26 21:48:11,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=308, Invalid=1332, Unknown=0, NotChecked=0, Total=1640 [2019-12-26 21:48:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61016 states. [2019-12-26 21:48:12,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61016 to 35887. [2019-12-26 21:48:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35887 states. [2019-12-26 21:48:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35887 states to 35887 states and 110395 transitions. [2019-12-26 21:48:12,785 INFO L78 Accepts]: Start accepts. Automaton has 35887 states and 110395 transitions. Word has length 64 [2019-12-26 21:48:12,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:12,785 INFO L462 AbstractCegarLoop]: Abstraction has 35887 states and 110395 transitions. [2019-12-26 21:48:12,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:48:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 35887 states and 110395 transitions. [2019-12-26 21:48:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:48:12,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:12,824 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-26 21:48:12,824 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-26 21:48:12,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:12,825 INFO L82 PathProgramCache]: Analyzing trace with hash -772692697, now seen corresponding path program 2 times [2019-12-26 21:48:12,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:12,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026391025] [2019-12-26 21:48:12,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:13,025 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-26 21:48:13,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026391025] [2019-12-26 21:48:13,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:13,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 21:48:13,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574232864] [2019-12-26 21:48:13,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:48:13,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:13,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:48:13,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:48:13,027 INFO L87 Difference]: Start difference. First operand 35887 states and 110395 transitions. Second operand 11 states. [2019-12-26 21:48:14,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:14,828 INFO L93 Difference]: Finished difference Result 56154 states and 170825 transitions. [2019-12-26 21:48:14,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 21:48:14,828 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-26 21:48:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:14,916 INFO L225 Difference]: With dead ends: 56154 [2019-12-26 21:48:14,916 INFO L226 Difference]: Without dead ends: 55934 [2019-12-26 21:48:14,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:48:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55934 states. [2019-12-26 21:48:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55934 to 42256. [2019-12-26 21:48:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42256 states. [2019-12-26 21:48:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42256 states to 42256 states and 129718 transitions. [2019-12-26 21:48:15,692 INFO L78 Accepts]: Start accepts. Automaton has 42256 states and 129718 transitions. Word has length 64 [2019-12-26 21:48:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:15,692 INFO L462 AbstractCegarLoop]: Abstraction has 42256 states and 129718 transitions. [2019-12-26 21:48:15,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:48:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 42256 states and 129718 transitions. [2019-12-26 21:48:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:48:15,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:15,742 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-26 21:48:15,742 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-26 21:48:15,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:15,742 INFO L82 PathProgramCache]: Analyzing trace with hash 98843029, now seen corresponding path program 3 times [2019-12-26 21:48:15,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:15,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966798755] [2019-12-26 21:48:15,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:16,171 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-26 21:48:16,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966798755] [2019-12-26 21:48:16,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:16,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:48:16,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345494112] [2019-12-26 21:48:16,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:48:16,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:48:16,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:48:16,174 INFO L87 Difference]: Start difference. First operand 42256 states and 129718 transitions. Second operand 3 states. [2019-12-26 21:48:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:16,354 INFO L93 Difference]: Finished difference Result 42255 states and 129716 transitions. [2019-12-26 21:48:16,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:48:16,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:48:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:16,446 INFO L225 Difference]: With dead ends: 42255 [2019-12-26 21:48:16,446 INFO L226 Difference]: Without dead ends: 42255 [2019-12-26 21:48:16,446 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-26 21:48:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42255 states. [2019-12-26 21:48:17,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42255 to 31985. [2019-12-26 21:48:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31985 states. [2019-12-26 21:48:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31985 states to 31985 states and 99745 transitions. [2019-12-26 21:48:17,446 INFO L78 Accepts]: Start accepts. Automaton has 31985 states and 99745 transitions. Word has length 64 [2019-12-26 21:48:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:17,446 INFO L462 AbstractCegarLoop]: Abstraction has 31985 states and 99745 transitions. [2019-12-26 21:48:17,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:48:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 31985 states and 99745 transitions. [2019-12-26 21:48:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:48:17,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:17,491 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-26 21:48:17,491 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-26 21:48:17,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:17,491 INFO L82 PathProgramCache]: Analyzing trace with hash 78921339, now seen corresponding path program 1 times [2019-12-26 21:48:17,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:17,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912954440] [2019-12-26 21:48:17,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:17,557 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-26 21:48:17,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912954440] [2019-12-26 21:48:17,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:17,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:48:17,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850423500] [2019-12-26 21:48:17,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:48:17,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:17,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:48:17,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:48:17,560 INFO L87 Difference]: Start difference. First operand 31985 states and 99745 transitions. Second operand 3 states. [2019-12-26 21:48:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:17,671 INFO L93 Difference]: Finished difference Result 24949 states and 77146 transitions. [2019-12-26 21:48:17,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:48:17,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:48:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:17,710 INFO L225 Difference]: With dead ends: 24949 [2019-12-26 21:48:17,710 INFO L226 Difference]: Without dead ends: 24949 [2019-12-26 21:48:17,710 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-26 21:48:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24949 states. [2019-12-26 21:48:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24949 to 23025. [2019-12-26 21:48:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23025 states. [2019-12-26 21:48:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23025 states to 23025 states and 71140 transitions. [2019-12-26 21:48:18,083 INFO L78 Accepts]: Start accepts. Automaton has 23025 states and 71140 transitions. Word has length 65 [2019-12-26 21:48:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:18,083 INFO L462 AbstractCegarLoop]: Abstraction has 23025 states and 71140 transitions. [2019-12-26 21:48:18,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:48:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 23025 states and 71140 transitions. [2019-12-26 21:48:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:18,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:18,110 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-26 21:48:18,110 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-26 21:48:18,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:18,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-26 21:48:18,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:18,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492108712] [2019-12-26 21:48:18,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:18,283 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-26 21:48:18,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492108712] [2019-12-26 21:48:18,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:18,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:48:18,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392260394] [2019-12-26 21:48:18,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:48:18,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:48:18,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:48:18,285 INFO L87 Difference]: Start difference. First operand 23025 states and 71140 transitions. Second operand 11 states. [2019-12-26 21:48:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:19,492 INFO L93 Difference]: Finished difference Result 49255 states and 152641 transitions. [2019-12-26 21:48:19,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:48:19,492 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:48:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:19,558 INFO L225 Difference]: With dead ends: 49255 [2019-12-26 21:48:19,558 INFO L226 Difference]: Without dead ends: 46671 [2019-12-26 21:48:19,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:48:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46671 states. [2019-12-26 21:48:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46671 to 27980. [2019-12-26 21:48:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27980 states. [2019-12-26 21:48:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27980 states to 27980 states and 86397 transitions. [2019-12-26 21:48:20,330 INFO L78 Accepts]: Start accepts. Automaton has 27980 states and 86397 transitions. Word has length 66 [2019-12-26 21:48:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:20,330 INFO L462 AbstractCegarLoop]: Abstraction has 27980 states and 86397 transitions. [2019-12-26 21:48:20,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:48:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 27980 states and 86397 transitions. [2019-12-26 21:48:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:20,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:20,360 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-26 21:48:20,360 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-26 21:48:20,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 2 times [2019-12-26 21:48:20,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:20,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248464025] [2019-12-26 21:48:20,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:20,909 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-26 21:48:20,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248464025] [2019-12-26 21:48:20,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:20,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 21:48:20,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129783600] [2019-12-26 21:48:20,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 21:48:20,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:20,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 21:48:20,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-26 21:48:20,911 INFO L87 Difference]: Start difference. First operand 27980 states and 86397 transitions. Second operand 16 states. [2019-12-26 21:48:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:25,279 INFO L93 Difference]: Finished difference Result 44167 states and 133845 transitions. [2019-12-26 21:48:25,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-26 21:48:25,280 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-26 21:48:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:25,340 INFO L225 Difference]: With dead ends: 44167 [2019-12-26 21:48:25,340 INFO L226 Difference]: Without dead ends: 40102 [2019-12-26 21:48:25,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=374, Invalid=1348, Unknown=0, NotChecked=0, Total=1722 [2019-12-26 21:48:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40102 states. [2019-12-26 21:48:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40102 to 28905. [2019-12-26 21:48:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28905 states. [2019-12-26 21:48:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28905 states to 28905 states and 88926 transitions. [2019-12-26 21:48:25,892 INFO L78 Accepts]: Start accepts. Automaton has 28905 states and 88926 transitions. Word has length 66 [2019-12-26 21:48:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:25,892 INFO L462 AbstractCegarLoop]: Abstraction has 28905 states and 88926 transitions. [2019-12-26 21:48:25,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 21:48:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 28905 states and 88926 transitions. [2019-12-26 21:48:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:25,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:25,928 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-26 21:48:25,928 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-26 21:48:25,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1334990131, now seen corresponding path program 3 times [2019-12-26 21:48:25,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:25,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867868030] [2019-12-26 21:48:25,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:26,494 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-26 21:48:26,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867868030] [2019-12-26 21:48:26,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:26,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 21:48:26,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551374036] [2019-12-26 21:48:26,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 21:48:26,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 21:48:26,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:48:26,495 INFO L87 Difference]: Start difference. First operand 28905 states and 88926 transitions. Second operand 17 states. [2019-12-26 21:48:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:31,620 INFO L93 Difference]: Finished difference Result 44865 states and 135958 transitions. [2019-12-26 21:48:31,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-26 21:48:31,620 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-26 21:48:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:31,680 INFO L225 Difference]: With dead ends: 44865 [2019-12-26 21:48:31,681 INFO L226 Difference]: Without dead ends: 38790 [2019-12-26 21:48:31,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=521, Invalid=2235, Unknown=0, NotChecked=0, Total=2756 [2019-12-26 21:48:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38790 states. [2019-12-26 21:48:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38790 to 28857. [2019-12-26 21:48:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28857 states. [2019-12-26 21:48:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28857 states to 28857 states and 88637 transitions. [2019-12-26 21:48:32,180 INFO L78 Accepts]: Start accepts. Automaton has 28857 states and 88637 transitions. Word has length 66 [2019-12-26 21:48:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:32,180 INFO L462 AbstractCegarLoop]: Abstraction has 28857 states and 88637 transitions. [2019-12-26 21:48:32,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 21:48:32,180 INFO L276 IsEmpty]: Start isEmpty. Operand 28857 states and 88637 transitions. [2019-12-26 21:48:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:32,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:32,215 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-26 21:48:32,215 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-26 21:48:32,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:32,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1345972671, now seen corresponding path program 4 times [2019-12-26 21:48:32,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:32,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162765324] [2019-12-26 21:48:32,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:33,001 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-26 21:48:33,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162765324] [2019-12-26 21:48:33,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:33,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 21:48:33,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69313477] [2019-12-26 21:48:33,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 21:48:33,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:33,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 21:48:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:48:33,003 INFO L87 Difference]: Start difference. First operand 28857 states and 88637 transitions. Second operand 17 states. [2019-12-26 21:48:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:37,626 INFO L93 Difference]: Finished difference Result 37077 states and 111666 transitions. [2019-12-26 21:48:37,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-26 21:48:37,626 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-26 21:48:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:37,677 INFO L225 Difference]: With dead ends: 37077 [2019-12-26 21:48:37,677 INFO L226 Difference]: Without dead ends: 34110 [2019-12-26 21:48:37,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=420, Invalid=1932, Unknown=0, NotChecked=0, Total=2352 [2019-12-26 21:48:37,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34110 states. [2019-12-26 21:48:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34110 to 28830. [2019-12-26 21:48:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28830 states. [2019-12-26 21:48:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28830 states to 28830 states and 88374 transitions. [2019-12-26 21:48:38,180 INFO L78 Accepts]: Start accepts. Automaton has 28830 states and 88374 transitions. Word has length 66 [2019-12-26 21:48:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:38,181 INFO L462 AbstractCegarLoop]: Abstraction has 28830 states and 88374 transitions. [2019-12-26 21:48:38,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 21:48:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 28830 states and 88374 transitions. [2019-12-26 21:48:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:38,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:38,218 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-26 21:48:38,218 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-26 21:48:38,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash -322208217, now seen corresponding path program 5 times [2019-12-26 21:48:38,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:38,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441450749] [2019-12-26 21:48:38,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:38,579 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-26 21:48:38,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441450749] [2019-12-26 21:48:38,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:38,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 21:48:38,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858464606] [2019-12-26 21:48:38,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 21:48:38,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:38,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 21:48:38,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:48:38,580 INFO L87 Difference]: Start difference. First operand 28830 states and 88374 transitions. Second operand 15 states. [2019-12-26 21:48:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:44,152 INFO L93 Difference]: Finished difference Result 57832 states and 174267 transitions. [2019-12-26 21:48:44,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-26 21:48:44,153 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-26 21:48:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:44,223 INFO L225 Difference]: With dead ends: 57832 [2019-12-26 21:48:44,223 INFO L226 Difference]: Without dead ends: 49046 [2019-12-26 21:48:44,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=540, Invalid=2540, Unknown=0, NotChecked=0, Total=3080 [2019-12-26 21:48:44,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49046 states. [2019-12-26 21:48:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49046 to 27334. [2019-12-26 21:48:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27334 states. [2019-12-26 21:48:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27334 states to 27334 states and 83949 transitions. [2019-12-26 21:48:45,092 INFO L78 Accepts]: Start accepts. Automaton has 27334 states and 83949 transitions. Word has length 66 [2019-12-26 21:48:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:45,092 INFO L462 AbstractCegarLoop]: Abstraction has 27334 states and 83949 transitions. [2019-12-26 21:48:45,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 21:48:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 27334 states and 83949 transitions. [2019-12-26 21:48:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:45,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:45,129 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-26 21:48:45,129 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-26 21:48:45,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:45,129 INFO L82 PathProgramCache]: Analyzing trace with hash 38318619, now seen corresponding path program 6 times [2019-12-26 21:48:45,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:45,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969530068] [2019-12-26 21:48:45,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:45,360 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-26 21:48:45,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969530068] [2019-12-26 21:48:45,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:45,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:48:45,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101593895] [2019-12-26 21:48:45,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:48:45,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:45,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:48:45,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:48:45,362 INFO L87 Difference]: Start difference. First operand 27334 states and 83949 transitions. Second operand 12 states. [2019-12-26 21:48:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:46,529 INFO L93 Difference]: Finished difference Result 33003 states and 100065 transitions. [2019-12-26 21:48:46,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:48:46,530 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 21:48:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:46,569 INFO L225 Difference]: With dead ends: 33003 [2019-12-26 21:48:46,570 INFO L226 Difference]: Without dead ends: 28070 [2019-12-26 21:48:46,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-26 21:48:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28070 states. [2019-12-26 21:48:46,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28070 to 25030. [2019-12-26 21:48:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25030 states. [2019-12-26 21:48:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25030 states to 25030 states and 76597 transitions. [2019-12-26 21:48:46,970 INFO L78 Accepts]: Start accepts. Automaton has 25030 states and 76597 transitions. Word has length 66 [2019-12-26 21:48:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:46,970 INFO L462 AbstractCegarLoop]: Abstraction has 25030 states and 76597 transitions. [2019-12-26 21:48:46,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:48:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 25030 states and 76597 transitions. [2019-12-26 21:48:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:46,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:46,998 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-26 21:48:46,998 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-26 21:48:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:46,998 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 7 times [2019-12-26 21:48:46,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:46,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657383050] [2019-12-26 21:48:46,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:47,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-26 21:48:47,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657383050] [2019-12-26 21:48:47,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:47,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:48:47,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192459129] [2019-12-26 21:48:47,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:48:47,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:47,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:48:47,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:48:47,167 INFO L87 Difference]: Start difference. First operand 25030 states and 76597 transitions. Second operand 12 states. [2019-12-26 21:48:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:48,236 INFO L93 Difference]: Finished difference Result 42761 states and 130430 transitions. [2019-12-26 21:48:48,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:48:48,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 21:48:48,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:48,296 INFO L225 Difference]: With dead ends: 42761 [2019-12-26 21:48:48,296 INFO L226 Difference]: Without dead ends: 37450 [2019-12-26 21:48:48,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:48:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37450 states. [2019-12-26 21:48:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37450 to 21932. [2019-12-26 21:48:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21932 states. [2019-12-26 21:48:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21932 states to 21932 states and 67409 transitions. [2019-12-26 21:48:48,715 INFO L78 Accepts]: Start accepts. Automaton has 21932 states and 67409 transitions. Word has length 66 [2019-12-26 21:48:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:48,715 INFO L462 AbstractCegarLoop]: Abstraction has 21932 states and 67409 transitions. [2019-12-26 21:48:48,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:48:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 21932 states and 67409 transitions. [2019-12-26 21:48:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:48,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:48,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, 1, 1, 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-26 21:48:48,737 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-26 21:48:48,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:48,737 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 8 times [2019-12-26 21:48:48,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:48,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334895016] [2019-12-26 21:48:48,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:48:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:48:48,840 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:48:48,840 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:48:48,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t503~0.base_22|)) (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff0_thd3~0_377) (= v_~__unbuffered_cnt~0_128 0) (= v_~z$r_buff0_thd1~0_378 0) (= v_~z$mem_tmp~0_24 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t503~0.base_22| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t503~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t503~0.base_22|) |v_ULTIMATE.start_main_~#t503~0.offset_16| 0)) |v_#memory_int_19|) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd0~0_195 0) (= v_~y~0_28 0) (= v_~z$w_buff1_used~0_500 0) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$read_delayed~0_7 0) (= |v_ULTIMATE.start_main_~#t503~0.offset_16| 0) (= v_~z$r_buff0_thd2~0_182 0) (= 0 v_~z$r_buff1_thd3~0_396) (= 0 v_~x~0_245) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_35) (= v_~z$r_buff1_thd0~0_294 0) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t503~0.base_22|) (= v_~z$r_buff1_thd2~0_280 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t503~0.base_22| 1)) (= v_~z$w_buff1~0_199 0) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_72|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_195, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start_main_~#t503~0.base=|v_ULTIMATE.start_main_~#t503~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t505~0.base=|v_ULTIMATE.start_main_~#t505~0.base_17|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t504~0.base=|v_ULTIMATE.start_main_~#t504~0.base_19|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~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_377, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_245, ULTIMATE.start_main_~#t505~0.offset=|v_ULTIMATE.start_main_~#t505~0.offset_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_294, ~y~0=v_~y~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_182, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ULTIMATE.start_main_~#t503~0.offset=|v_ULTIMATE.start_main_~#t503~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, ULTIMATE.start_main_~#t504~0.offset=|v_ULTIMATE.start_main_~#t504~0.offset_14|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_378} AuxVars[] AssignedVars[~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, ULTIMATE.start_main_~#t503~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t505~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t504~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t505~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~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, ULTIMATE.start_main_~#t503~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t504~0.offset, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:48:48,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~x~0_11 1) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} 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-26 21:48:48,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= |v_ULTIMATE.start_main_~#t504~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t504~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t504~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t504~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t504~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t504~0.base_11|) |v_ULTIMATE.start_main_~#t504~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t504~0.base_11| 1) |v_#valid_31|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t504~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t504~0.base=|v_ULTIMATE.start_main_~#t504~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t504~0.offset=|v_ULTIMATE.start_main_~#t504~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t504~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t504~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 21:48:48,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t505~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t505~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t505~0.base_12|) |v_ULTIMATE.start_main_~#t505~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t505~0.base_12| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t505~0.base_12|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t505~0.base_12| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t505~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t505~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t505~0.offset=|v_ULTIMATE.start_main_~#t505~0.offset_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t505~0.base=|v_ULTIMATE.start_main_~#t505~0.base_12|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t505~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t505~0.base, #length] because there is no mapped edge [2019-12-26 21:48:48,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In380734643 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out380734643| |P1Thread1of1ForFork2_#t~ite9_Out380734643|)) (.cse1 (= (mod ~z$w_buff1_used~0_In380734643 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In380734643 |P1Thread1of1ForFork2_#t~ite9_Out380734643|)) (and (not .cse0) .cse2 (not .cse1) (= ~z$w_buff1~0_In380734643 |P1Thread1of1ForFork2_#t~ite9_Out380734643|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In380734643, ~z$w_buff1_used~0=~z$w_buff1_used~0_In380734643, ~z$w_buff1~0=~z$w_buff1~0_In380734643, ~z~0=~z~0_In380734643} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out380734643|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In380734643, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out380734643|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In380734643, ~z$w_buff1~0=~z$w_buff1~0_In380734643, ~z~0=~z~0_In380734643} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 21:48:48,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-314163901 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In-314163901| |P2Thread1of1ForFork0_#t~ite23_Out-314163901|) (not .cse0) (= ~z$w_buff1~0_In-314163901 |P2Thread1of1ForFork0_#t~ite24_Out-314163901|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-314163901 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-314163901 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-314163901 256)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-314163901 256) 0)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out-314163901| |P2Thread1of1ForFork0_#t~ite24_Out-314163901|) (= ~z$w_buff1~0_In-314163901 |P2Thread1of1ForFork0_#t~ite23_Out-314163901|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-314163901, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-314163901, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-314163901|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-314163901, ~z$w_buff1~0=~z$w_buff1~0_In-314163901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-314163901, ~weak$$choice2~0=~weak$$choice2~0_In-314163901} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-314163901, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-314163901|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-314163901, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-314163901|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-314163901, ~z$w_buff1~0=~z$w_buff1~0_In-314163901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-314163901, ~weak$$choice2~0=~weak$$choice2~0_In-314163901} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-26 21:48:48,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite30_Out-984346768| |P2Thread1of1ForFork0_#t~ite29_Out-984346768|)) (.cse0 (= (mod ~z$w_buff0_used~0_In-984346768 256) 0)) (.cse4 (= (mod ~z$r_buff1_thd3~0_In-984346768 256) 0)) (.cse5 (= 0 (mod ~z$w_buff1_used~0_In-984346768 256))) (.cse6 (= (mod ~z$r_buff0_thd3~0_In-984346768 256) 0)) (.cse2 (= (mod ~weak$$choice2~0_In-984346768 256) 0))) (or (let ((.cse3 (not .cse6))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-984346768| |P2Thread1of1ForFork0_#t~ite29_Out-984346768|) .cse1 .cse2 (or .cse3 (not .cse4)) (or (not .cse5) .cse3) (= |P2Thread1of1ForFork0_#t~ite28_Out-984346768| 0))) (and (= |P2Thread1of1ForFork0_#t~ite28_In-984346768| |P2Thread1of1ForFork0_#t~ite28_Out-984346768|) (or (and .cse1 .cse2 (or .cse0 (and .cse4 .cse6) (and .cse5 .cse6)) (= ~z$w_buff1_used~0_In-984346768 |P2Thread1of1ForFork0_#t~ite29_Out-984346768|)) (and (= |P2Thread1of1ForFork0_#t~ite29_In-984346768| |P2Thread1of1ForFork0_#t~ite29_Out-984346768|) (not .cse2) (= ~z$w_buff1_used~0_In-984346768 |P2Thread1of1ForFork0_#t~ite30_Out-984346768|)))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-984346768|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-984346768, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-984346768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-984346768, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-984346768, ~weak$$choice2~0=~weak$$choice2~0_In-984346768, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-984346768|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-984346768|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-984346768, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-984346768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-984346768, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-984346768, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-984346768|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-984346768|, ~weak$$choice2~0=~weak$$choice2~0_In-984346768} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:48:48,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_371 v_~z$r_buff0_thd3~0_370) (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_370, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:48:48,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 21:48:48,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out1430260443| |P2Thread1of1ForFork0_#t~ite39_Out1430260443|)) (.cse2 (= (mod ~z$w_buff1_used~0_In1430260443 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1430260443 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out1430260443| ~z$w_buff1~0_In1430260443) .cse1 (not .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1430260443| ~z~0_In1430260443) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1430260443, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1430260443, ~z$w_buff1~0=~z$w_buff1~0_In1430260443, ~z~0=~z~0_In1430260443} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1430260443|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1430260443|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1430260443, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1430260443, ~z$w_buff1~0=~z$w_buff1~0_In1430260443, ~z~0=~z~0_In1430260443} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:48:48,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-463056757 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-463056757 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-463056757|)) (and (= ~z$w_buff0_used~0_In-463056757 |P2Thread1of1ForFork0_#t~ite40_Out-463056757|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-463056757, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-463056757} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-463056757, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-463056757|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-463056757} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:48:48,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In807266973 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In807266973 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In807266973 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In807266973 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out807266973| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out807266973| ~z$w_buff1_used~0_In807266973)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In807266973, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In807266973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In807266973, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In807266973} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In807266973, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In807266973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In807266973, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In807266973, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out807266973|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:48:48,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-78018996 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-78018996 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-78018996|) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-78018996| ~z$r_buff0_thd3~0_In-78018996) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-78018996, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-78018996} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-78018996, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-78018996, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-78018996|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:48:48,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-791098050 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-791098050 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-791098050 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-791098050 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-791098050| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-791098050 |P2Thread1of1ForFork0_#t~ite43_Out-791098050|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-791098050, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-791098050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-791098050, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-791098050} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-791098050|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-791098050, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-791098050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-791098050, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-791098050} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:48:48,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_308 |v_P2Thread1of1ForFork0_#t~ite43_56|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, 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-26 21:48:48,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1111217491 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1111217491 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1111217491 |P0Thread1of1ForFork1_#t~ite5_Out-1111217491|)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1111217491| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1111217491, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1111217491} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1111217491|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1111217491, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1111217491} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:48:48,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In498110591 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In498110591 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In498110591 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In498110591 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In498110591 |P0Thread1of1ForFork1_#t~ite6_Out498110591|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out498110591|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In498110591, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In498110591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In498110591, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In498110591} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In498110591, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out498110591|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In498110591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In498110591, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In498110591} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:48:48,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1110890520 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1110890520 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In1110890520 ~z$r_buff0_thd1~0_Out1110890520)) (and (= 0 ~z$r_buff0_thd1~0_Out1110890520) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1110890520, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1110890520} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1110890520, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1110890520|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1110890520} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:48:48,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1525713975 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In-1525713975 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1525713975 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1525713975 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-1525713975| ~z$r_buff1_thd1~0_In-1525713975)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1525713975|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1525713975, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1525713975, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1525713975, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1525713975} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1525713975|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1525713975, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1525713975, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1525713975, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1525713975} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:48:48,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} 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-26 21:48:48,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In636574423 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In636574423 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out636574423|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In636574423 |P1Thread1of1ForFork2_#t~ite11_Out636574423|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In636574423, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In636574423} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In636574423, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out636574423|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In636574423} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:48:48,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-211227256 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-211227256 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-211227256 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-211227256 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-211227256|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-211227256 |P1Thread1of1ForFork2_#t~ite12_Out-211227256|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-211227256, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-211227256, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211227256, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-211227256} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-211227256, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-211227256, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211227256, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-211227256|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-211227256} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:48:48,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1753794620 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1753794620 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1753794620| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out1753794620| ~z$r_buff0_thd2~0_In1753794620)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1753794620, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1753794620} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1753794620, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1753794620|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1753794620} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:48:48,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In1760365535 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1760365535 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1760365535 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1760365535 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1760365535| ~z$r_buff1_thd2~0_In1760365535)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite14_Out1760365535| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1760365535, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1760365535, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1760365535, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1760365535} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1760365535, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1760365535, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1760365535, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1760365535|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1760365535} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:48:48,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= v_~z$r_buff1_thd2~0_188 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, 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-26 21:48:48,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:48:48,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-312545587 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-312545587 256)))) (or (and (= ~z~0_In-312545587 |ULTIMATE.start_main_#t~ite47_Out-312545587|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-312545587| ~z$w_buff1~0_In-312545587) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-312545587, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-312545587, ~z$w_buff1~0=~z$w_buff1~0_In-312545587, ~z~0=~z~0_In-312545587} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-312545587, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-312545587|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-312545587, ~z$w_buff1~0=~z$w_buff1~0_In-312545587, ~z~0=~z~0_In-312545587} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:48:48,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-26 21:48:48,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1010447451 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1010447451 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1010447451 |ULTIMATE.start_main_#t~ite49_Out1010447451|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1010447451|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1010447451, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1010447451} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1010447451, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1010447451, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1010447451|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:48:48,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1020686863 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1020686863 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1020686863 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1020686863 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1020686863| 0)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1020686863 |ULTIMATE.start_main_#t~ite50_Out-1020686863|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1020686863, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1020686863, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1020686863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1020686863} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1020686863|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1020686863, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1020686863, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1020686863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1020686863} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:48:48,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2076140240 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2076140240 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out2076140240| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In2076140240 |ULTIMATE.start_main_#t~ite51_Out2076140240|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2076140240, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2076140240} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2076140240, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2076140240|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2076140240} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:48:48,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-217286909 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-217286909 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-217286909 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-217286909 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-217286909|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-217286909 |ULTIMATE.start_main_#t~ite52_Out-217286909|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-217286909, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-217286909, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-217286909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-217286909} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-217286909|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-217286909, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-217286909, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-217286909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-217286909} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:48:48,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p1_EAX~0_22) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 2 v_~x~0_186)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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-26 21:48:48,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:48:48 BasicIcfg [2019-12-26 21:48:48,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:48:48,951 INFO L168 Benchmark]: Toolchain (without parser) took 129470.79 ms. Allocated memory was 137.4 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 100.6 MB in the beginning and 1.0 GB in the end (delta: -948.2 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-26 21:48:48,951 INFO L168 Benchmark]: CDTParser took 1.54 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 21:48:48,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.07 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 153.1 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:48:48,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.42 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:48:48,953 INFO L168 Benchmark]: Boogie Preprocessor took 77.26 ms. Allocated memory is still 201.9 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:48:48,954 INFO L168 Benchmark]: RCFGBuilder took 935.64 ms. Allocated memory is still 201.9 MB. Free memory was 148.3 MB in the beginning and 98.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:48:48,955 INFO L168 Benchmark]: TraceAbstraction took 127488.53 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 97.6 MB in the beginning and 1.0 GB in the end (delta: -951.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-26 21:48:48,958 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.54 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 859.07 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 153.1 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 100.42 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 77.26 ms. Allocated memory is still 201.9 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 935.64 ms. Allocated memory is still 201.9 MB. Free memory was 148.3 MB in the beginning and 98.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 127488.53 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 97.6 MB in the beginning and 1.0 GB in the end (delta: -951.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7044 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t503, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L827] FCALL, FORK 0 pthread_create(&t504, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, 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] [L760] 2 x = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L766] EXPR 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=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] [L829] FCALL, FORK 0 pthread_create(&t505, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=7, 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_buff1=0, z$w_buff1_used=0] [L790] 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=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=7, 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_buff1=0, z$w_buff1_used=0] [L790] 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) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=7, weak$$choice2=1, 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))=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_buff1=0, z$w_buff1_used=0] [L791] 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)) [L792] 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)) [L793] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=7, weak$$choice2=1, 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))=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_buff1=0, z$w_buff1_used=0] [L793] 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)) [L796] 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=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=7, 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_buff1=0, z$w_buff1_used=0] [L796] 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)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=7, 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_buff1=0, z$w_buff1_used=0] [L802] EXPR 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=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=7, 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_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 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 [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 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) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 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 [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 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 [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 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=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=7, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 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 [L838] 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, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 127.1s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 53.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8115 SDtfs, 10431 SDslu, 32106 SDs, 0 SdLazy, 28431 SolverSat, 506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 507 GetRequests, 43 SyntacticMatches, 29 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3596 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 39.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 306346 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1420 NumberOfCodeBlocks, 1420 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 362776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...