/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:13:53,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:13:53,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:13:53,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:13:53,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:13:53,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:13:53,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:13:53,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:13:53,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:13:53,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:13:53,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:13:53,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:13:53,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:13:53,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:13:53,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:13:53,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:13:53,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:13:53,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:13:53,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:13:53,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:13:53,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:13:53,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:13:53,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:13:53,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:13:53,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:13:53,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:13:53,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:13:53,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:13:53,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:13:53,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:13:53,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:13:53,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:13:53,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:13:53,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:13:53,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:13:53,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:13:53,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:13:53,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:13:53,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:13:53,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:13:53,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:13:53,444 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:13:53,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:13:53,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:13:53,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:13:53,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:13:53,478 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:13:53,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:13:53,478 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:13:53,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:13:53,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:13:53,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:13:53,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:13:53,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:13:53,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:13:53,480 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:13:53,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:13:53,480 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:13:53,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:13:53,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:13:53,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:13:53,481 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:13:53,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:13:53,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:13:53,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:13:53,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:13:53,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:13:53,484 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:13:53,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:13:53,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:13:53,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:13:53,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:13:53,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:13:53,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:13:53,770 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:13:53,770 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:13:53,771 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i [2019-12-18 17:13:53,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930b22b59/2d913b66d4f34f10a70209b615674da4/FLAG7f0cf2706 [2019-12-18 17:13:54,365 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:13:54,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i [2019-12-18 17:13:54,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930b22b59/2d913b66d4f34f10a70209b615674da4/FLAG7f0cf2706 [2019-12-18 17:13:54,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930b22b59/2d913b66d4f34f10a70209b615674da4 [2019-12-18 17:13:54,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:13:54,667 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:13:54,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:13:54,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:13:54,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:13:54,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:13:54" (1/1) ... [2019-12-18 17:13:54,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ad2082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:54, skipping insertion in model container [2019-12-18 17:13:54,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:13:54" (1/1) ... [2019-12-18 17:13:54,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:13:54,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:13:55,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:13:55,193 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:13:55,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:13:55,350 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:13:55,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:55 WrapperNode [2019-12-18 17:13:55,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:13:55,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:13:55,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:13:55,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:13:55,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:55" (1/1) ... [2019-12-18 17:13:55,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:55" (1/1) ... [2019-12-18 17:13:55,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:13:55,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:13:55,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:13:55,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:13:55,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:55" (1/1) ... [2019-12-18 17:13:55,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:55" (1/1) ... [2019-12-18 17:13:55,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:55" (1/1) ... [2019-12-18 17:13:55,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:55" (1/1) ... [2019-12-18 17:13:55,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:55" (1/1) ... [2019-12-18 17:13:55,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:55" (1/1) ... [2019-12-18 17:13:55,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:55" (1/1) ... [2019-12-18 17:13:55,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:13:55,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:13:55,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:13:55,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:13:55,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:55" (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-18 17:13:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:13:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:13:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:13:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:13:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:13:55,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:13:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:13:55,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:13:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:13:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:13:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:13:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:13:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:13:55,535 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:13:56,220 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:13:56,220 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:13:56,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:13:56 BoogieIcfgContainer [2019-12-18 17:13:56,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:13:56,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:13:56,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:13:56,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:13:56,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:13:54" (1/3) ... [2019-12-18 17:13:56,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b03d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:13:56, skipping insertion in model container [2019-12-18 17:13:56,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:55" (2/3) ... [2019-12-18 17:13:56,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b03d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:13:56, skipping insertion in model container [2019-12-18 17:13:56,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:13:56" (3/3) ... [2019-12-18 17:13:56,233 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_rmo.opt.i [2019-12-18 17:13:56,243 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:13:56,243 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:13:56,253 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:13:56,254 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:13:56,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,301 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,358 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,358 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,376 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,376 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,389 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,396 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,405 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,405 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:56,419 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:13:56,436 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:13:56,436 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:13:56,436 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:13:56,436 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:13:56,436 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:13:56,436 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:13:56,436 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:13:56,436 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:13:56,452 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-18 17:13:56,454 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 17:13:56,555 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 17:13:56,555 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:13:56,575 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:13:56,602 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 17:13:56,655 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 17:13:56,655 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:13:56,673 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:13:56,693 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 17:13:56,695 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:14:02,073 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 17:14:02,251 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 17:14:02,392 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66821 [2019-12-18 17:14:02,392 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 17:14:02,396 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-18 17:14:14,286 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-18 17:14:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-18 17:14:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 17:14:14,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:14,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 17:14:14,295 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash 802094366, now seen corresponding path program 1 times [2019-12-18 17:14:14,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:14,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617540820] [2019-12-18 17:14:14,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:14,624 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-18 17:14:14,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617540820] [2019-12-18 17:14:14,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:14,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:14:14,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508497513] [2019-12-18 17:14:14,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:14,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:14,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:14,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:14,650 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-18 17:14:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:15,764 INFO L93 Difference]: Finished difference Result 87938 states and 378592 transitions. [2019-12-18 17:14:15,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:15,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 17:14:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:18,928 INFO L225 Difference]: With dead ends: 87938 [2019-12-18 17:14:18,929 INFO L226 Difference]: Without dead ends: 82842 [2019-12-18 17:14:18,930 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-18 17:14:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82842 states. [2019-12-18 17:14:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82842 to 82842. [2019-12-18 17:14:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82842 states. [2019-12-18 17:14:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82842 states to 82842 states and 356178 transitions. [2019-12-18 17:14:26,624 INFO L78 Accepts]: Start accepts. Automaton has 82842 states and 356178 transitions. Word has length 5 [2019-12-18 17:14:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:26,625 INFO L462 AbstractCegarLoop]: Abstraction has 82842 states and 356178 transitions. [2019-12-18 17:14:26,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 82842 states and 356178 transitions. [2019-12-18 17:14:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:14:26,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:26,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:26,634 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:26,634 INFO L82 PathProgramCache]: Analyzing trace with hash -136321435, now seen corresponding path program 1 times [2019-12-18 17:14:26,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:26,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694668383] [2019-12-18 17:14:26,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:26,692 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-18 17:14:26,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694668383] [2019-12-18 17:14:26,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:26,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:26,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384100111] [2019-12-18 17:14:26,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:26,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:26,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:26,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:26,696 INFO L87 Difference]: Start difference. First operand 82842 states and 356178 transitions. Second operand 3 states. [2019-12-18 17:14:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:29,620 INFO L93 Difference]: Finished difference Result 21610 states and 74688 transitions. [2019-12-18 17:14:29,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:29,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:14:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:29,706 INFO L225 Difference]: With dead ends: 21610 [2019-12-18 17:14:29,706 INFO L226 Difference]: Without dead ends: 21610 [2019-12-18 17:14:29,707 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-18 17:14:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21610 states. [2019-12-18 17:14:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21610 to 21610. [2019-12-18 17:14:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21610 states. [2019-12-18 17:14:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21610 states to 21610 states and 74688 transitions. [2019-12-18 17:14:30,189 INFO L78 Accepts]: Start accepts. Automaton has 21610 states and 74688 transitions. Word has length 13 [2019-12-18 17:14:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:30,189 INFO L462 AbstractCegarLoop]: Abstraction has 21610 states and 74688 transitions. [2019-12-18 17:14:30,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 21610 states and 74688 transitions. [2019-12-18 17:14:30,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:14:30,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:30,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:30,191 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:30,192 INFO L82 PathProgramCache]: Analyzing trace with hash -120546049, now seen corresponding path program 1 times [2019-12-18 17:14:30,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:30,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191016310] [2019-12-18 17:14:30,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:30,315 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-18 17:14:30,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191016310] [2019-12-18 17:14:30,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:30,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:30,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970625483] [2019-12-18 17:14:30,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:14:30,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:30,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:14:30,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:14:30,319 INFO L87 Difference]: Start difference. First operand 21610 states and 74688 transitions. Second operand 4 states. [2019-12-18 17:14:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:30,671 INFO L93 Difference]: Finished difference Result 31986 states and 107232 transitions. [2019-12-18 17:14:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:14:30,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:14:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:30,796 INFO L225 Difference]: With dead ends: 31986 [2019-12-18 17:14:30,796 INFO L226 Difference]: Without dead ends: 31972 [2019-12-18 17:14:30,797 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-18 17:14:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31972 states. [2019-12-18 17:14:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31972 to 28300. [2019-12-18 17:14:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28300 states. [2019-12-18 17:14:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28300 states to 28300 states and 95848 transitions. [2019-12-18 17:14:31,931 INFO L78 Accepts]: Start accepts. Automaton has 28300 states and 95848 transitions. Word has length 13 [2019-12-18 17:14:31,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:31,932 INFO L462 AbstractCegarLoop]: Abstraction has 28300 states and 95848 transitions. [2019-12-18 17:14:31,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:14:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 28300 states and 95848 transitions. [2019-12-18 17:14:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:14:31,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:31,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:31,935 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:31,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:31,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2051868705, now seen corresponding path program 1 times [2019-12-18 17:14:31,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:31,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946927053] [2019-12-18 17:14:31,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:32,033 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-18 17:14:32,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946927053] [2019-12-18 17:14:32,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:32,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:32,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213915408] [2019-12-18 17:14:32,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:14:32,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:32,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:14:32,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:32,035 INFO L87 Difference]: Start difference. First operand 28300 states and 95848 transitions. Second operand 5 states. [2019-12-18 17:14:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:32,516 INFO L93 Difference]: Finished difference Result 42745 states and 142288 transitions. [2019-12-18 17:14:32,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:14:32,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 17:14:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:32,616 INFO L225 Difference]: With dead ends: 42745 [2019-12-18 17:14:32,616 INFO L226 Difference]: Without dead ends: 42727 [2019-12-18 17:14:32,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:14:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42727 states. [2019-12-18 17:14:33,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42727 to 34163. [2019-12-18 17:14:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34163 states. [2019-12-18 17:14:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34163 states to 34163 states and 114786 transitions. [2019-12-18 17:14:33,809 INFO L78 Accepts]: Start accepts. Automaton has 34163 states and 114786 transitions. Word has length 14 [2019-12-18 17:14:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:33,810 INFO L462 AbstractCegarLoop]: Abstraction has 34163 states and 114786 transitions. [2019-12-18 17:14:33,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:14:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 34163 states and 114786 transitions. [2019-12-18 17:14:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:14:33,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:33,821 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-18 17:14:33,821 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:33,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:33,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1808091808, now seen corresponding path program 1 times [2019-12-18 17:14:33,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:33,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445203738] [2019-12-18 17:14:33,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:33,905 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-18 17:14:33,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445203738] [2019-12-18 17:14:33,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:33,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:14:33,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419968829] [2019-12-18 17:14:33,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:14:33,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:33,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:14:33,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:14:33,908 INFO L87 Difference]: Start difference. First operand 34163 states and 114786 transitions. Second operand 6 states. [2019-12-18 17:14:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:34,873 INFO L93 Difference]: Finished difference Result 52347 states and 172257 transitions. [2019-12-18 17:14:34,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:14:34,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 17:14:34,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:35,006 INFO L225 Difference]: With dead ends: 52347 [2019-12-18 17:14:35,006 INFO L226 Difference]: Without dead ends: 52317 [2019-12-18 17:14:35,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:14:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52317 states. [2019-12-18 17:14:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52317 to 34394. [2019-12-18 17:14:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34394 states. [2019-12-18 17:14:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34394 states to 34394 states and 114647 transitions. [2019-12-18 17:14:36,105 INFO L78 Accepts]: Start accepts. Automaton has 34394 states and 114647 transitions. Word has length 22 [2019-12-18 17:14:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:36,106 INFO L462 AbstractCegarLoop]: Abstraction has 34394 states and 114647 transitions. [2019-12-18 17:14:36,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:14:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 34394 states and 114647 transitions. [2019-12-18 17:14:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:14:36,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:36,121 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-18 17:14:36,121 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1844565345, now seen corresponding path program 1 times [2019-12-18 17:14:36,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:36,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185592098] [2019-12-18 17:14:36,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:36,181 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-18 17:14:36,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185592098] [2019-12-18 17:14:36,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:36,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:36,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095297333] [2019-12-18 17:14:36,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:14:36,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:36,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:14:36,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:14:36,183 INFO L87 Difference]: Start difference. First operand 34394 states and 114647 transitions. Second operand 4 states. [2019-12-18 17:14:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:36,259 INFO L93 Difference]: Finished difference Result 13523 states and 41801 transitions. [2019-12-18 17:14:36,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:14:36,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:14:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:36,286 INFO L225 Difference]: With dead ends: 13523 [2019-12-18 17:14:36,286 INFO L226 Difference]: Without dead ends: 13523 [2019-12-18 17:14:36,287 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-18 17:14:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13523 states. [2019-12-18 17:14:36,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13523 to 13303. [2019-12-18 17:14:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13303 states. [2019-12-18 17:14:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13303 states to 13303 states and 41151 transitions. [2019-12-18 17:14:36,726 INFO L78 Accepts]: Start accepts. Automaton has 13303 states and 41151 transitions. Word has length 25 [2019-12-18 17:14:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:36,727 INFO L462 AbstractCegarLoop]: Abstraction has 13303 states and 41151 transitions. [2019-12-18 17:14:36,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:14:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 13303 states and 41151 transitions. [2019-12-18 17:14:36,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:14:36,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:36,748 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-18 17:14:36,748 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:36,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:36,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1639479592, now seen corresponding path program 1 times [2019-12-18 17:14:36,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:36,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210979058] [2019-12-18 17:14:36,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:36,879 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-18 17:14:36,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210979058] [2019-12-18 17:14:36,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:36,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:36,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616330465] [2019-12-18 17:14:36,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:36,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:36,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:36,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:36,881 INFO L87 Difference]: Start difference. First operand 13303 states and 41151 transitions. Second operand 3 states. [2019-12-18 17:14:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:36,937 INFO L93 Difference]: Finished difference Result 12716 states and 38855 transitions. [2019-12-18 17:14:36,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:36,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 17:14:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:36,962 INFO L225 Difference]: With dead ends: 12716 [2019-12-18 17:14:36,962 INFO L226 Difference]: Without dead ends: 12716 [2019-12-18 17:14:36,962 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-18 17:14:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12716 states. [2019-12-18 17:14:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12716 to 12700. [2019-12-18 17:14:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12700 states. [2019-12-18 17:14:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12700 states to 12700 states and 38815 transitions. [2019-12-18 17:14:37,160 INFO L78 Accepts]: Start accepts. Automaton has 12700 states and 38815 transitions. Word has length 39 [2019-12-18 17:14:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:37,160 INFO L462 AbstractCegarLoop]: Abstraction has 12700 states and 38815 transitions. [2019-12-18 17:14:37,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 12700 states and 38815 transitions. [2019-12-18 17:14:37,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:14:37,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:37,177 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-18 17:14:37,178 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:37,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:37,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1144095462, now seen corresponding path program 1 times [2019-12-18 17:14:37,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:37,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51954078] [2019-12-18 17:14:37,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:14:37,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51954078] [2019-12-18 17:14:37,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:37,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:14:37,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668782629] [2019-12-18 17:14:37,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:14:37,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:37,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:14:37,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:37,265 INFO L87 Difference]: Start difference. First operand 12700 states and 38815 transitions. Second operand 5 states. [2019-12-18 17:14:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:37,809 INFO L93 Difference]: Finished difference Result 17919 states and 54342 transitions. [2019-12-18 17:14:37,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:14:37,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:14:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:37,836 INFO L225 Difference]: With dead ends: 17919 [2019-12-18 17:14:37,836 INFO L226 Difference]: Without dead ends: 17919 [2019-12-18 17:14:37,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-18 17:14:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17919 states. [2019-12-18 17:14:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17919 to 16320. [2019-12-18 17:14:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16320 states. [2019-12-18 17:14:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16320 states to 16320 states and 49873 transitions. [2019-12-18 17:14:38,079 INFO L78 Accepts]: Start accepts. Automaton has 16320 states and 49873 transitions. Word has length 40 [2019-12-18 17:14:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:38,079 INFO L462 AbstractCegarLoop]: Abstraction has 16320 states and 49873 transitions. [2019-12-18 17:14:38,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:14:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 16320 states and 49873 transitions. [2019-12-18 17:14:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:14:38,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:38,103 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-18 17:14:38,103 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:38,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2007286560, now seen corresponding path program 2 times [2019-12-18 17:14:38,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:38,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699776007] [2019-12-18 17:14:38,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:38,175 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-18 17:14:38,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699776007] [2019-12-18 17:14:38,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:38,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:14:38,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658453130] [2019-12-18 17:14:38,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:14:38,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:38,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:14:38,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:38,178 INFO L87 Difference]: Start difference. First operand 16320 states and 49873 transitions. Second operand 5 states. [2019-12-18 17:14:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:38,251 INFO L93 Difference]: Finished difference Result 14953 states and 46364 transitions. [2019-12-18 17:14:38,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:14:38,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:14:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:38,274 INFO L225 Difference]: With dead ends: 14953 [2019-12-18 17:14:38,274 INFO L226 Difference]: Without dead ends: 14953 [2019-12-18 17:14:38,274 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-18 17:14:38,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14953 states. [2019-12-18 17:14:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14953 to 13921. [2019-12-18 17:14:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13921 states. [2019-12-18 17:14:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13921 states to 13921 states and 43359 transitions. [2019-12-18 17:14:38,605 INFO L78 Accepts]: Start accepts. Automaton has 13921 states and 43359 transitions. Word has length 40 [2019-12-18 17:14:38,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:38,605 INFO L462 AbstractCegarLoop]: Abstraction has 13921 states and 43359 transitions. [2019-12-18 17:14:38,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:14:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand 13921 states and 43359 transitions. [2019-12-18 17:14:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:14:38,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:38,625 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] [2019-12-18 17:14:38,626 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:38,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash 425228576, now seen corresponding path program 1 times [2019-12-18 17:14:38,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:38,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229835521] [2019-12-18 17:14:38,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:38,754 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-18 17:14:38,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229835521] [2019-12-18 17:14:38,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:38,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:14:38,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203306098] [2019-12-18 17:14:38,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:14:38,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:38,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:14:38,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:14:38,756 INFO L87 Difference]: Start difference. First operand 13921 states and 43359 transitions. Second operand 9 states. [2019-12-18 17:14:40,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:40,167 INFO L93 Difference]: Finished difference Result 31249 states and 96830 transitions. [2019-12-18 17:14:40,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 17:14:40,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 17:14:40,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:40,202 INFO L225 Difference]: With dead ends: 31249 [2019-12-18 17:14:40,202 INFO L226 Difference]: Without dead ends: 22250 [2019-12-18 17:14:40,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-18 17:14:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22250 states. [2019-12-18 17:14:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22250 to 17210. [2019-12-18 17:14:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17210 states. [2019-12-18 17:14:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17210 states to 17210 states and 53206 transitions. [2019-12-18 17:14:40,502 INFO L78 Accepts]: Start accepts. Automaton has 17210 states and 53206 transitions. Word has length 55 [2019-12-18 17:14:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:40,502 INFO L462 AbstractCegarLoop]: Abstraction has 17210 states and 53206 transitions. [2019-12-18 17:14:40,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:14:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 17210 states and 53206 transitions. [2019-12-18 17:14:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:14:40,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:40,524 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] [2019-12-18 17:14:40,524 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:40,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:40,524 INFO L82 PathProgramCache]: Analyzing trace with hash 235395682, now seen corresponding path program 2 times [2019-12-18 17:14:40,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:40,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173079509] [2019-12-18 17:14:40,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:40,586 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-18 17:14:40,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173079509] [2019-12-18 17:14:40,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:40,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:40,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023169486] [2019-12-18 17:14:40,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:40,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:40,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:40,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:40,589 INFO L87 Difference]: Start difference. First operand 17210 states and 53206 transitions. Second operand 3 states. [2019-12-18 17:14:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:40,715 INFO L93 Difference]: Finished difference Result 23156 states and 70253 transitions. [2019-12-18 17:14:40,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:40,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:14:40,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:40,759 INFO L225 Difference]: With dead ends: 23156 [2019-12-18 17:14:40,759 INFO L226 Difference]: Without dead ends: 23156 [2019-12-18 17:14:40,759 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-18 17:14:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23156 states. [2019-12-18 17:14:41,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23156 to 19339. [2019-12-18 17:14:41,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19339 states. [2019-12-18 17:14:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19339 states to 19339 states and 59397 transitions. [2019-12-18 17:14:41,249 INFO L78 Accepts]: Start accepts. Automaton has 19339 states and 59397 transitions. Word has length 55 [2019-12-18 17:14:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:41,249 INFO L462 AbstractCegarLoop]: Abstraction has 19339 states and 59397 transitions. [2019-12-18 17:14:41,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 19339 states and 59397 transitions. [2019-12-18 17:14:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:14:41,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:41,272 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] [2019-12-18 17:14:41,273 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash 579382589, now seen corresponding path program 1 times [2019-12-18 17:14:41,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:41,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158030523] [2019-12-18 17:14:41,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:41,447 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-18 17:14:41,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158030523] [2019-12-18 17:14:41,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:41,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:14:41,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30158821] [2019-12-18 17:14:41,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:14:41,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:41,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:14:41,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:14:41,449 INFO L87 Difference]: Start difference. First operand 19339 states and 59397 transitions. Second operand 10 states. [2019-12-18 17:14:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:44,514 INFO L93 Difference]: Finished difference Result 35706 states and 106178 transitions. [2019-12-18 17:14:44,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 17:14:44,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 17:14:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:44,572 INFO L225 Difference]: With dead ends: 35706 [2019-12-18 17:14:44,572 INFO L226 Difference]: Without dead ends: 35502 [2019-12-18 17:14:44,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 17:14:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35502 states. [2019-12-18 17:14:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35502 to 20462. [2019-12-18 17:14:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20462 states. [2019-12-18 17:14:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20462 states to 20462 states and 62626 transitions. [2019-12-18 17:14:45,212 INFO L78 Accepts]: Start accepts. Automaton has 20462 states and 62626 transitions. Word has length 55 [2019-12-18 17:14:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:45,213 INFO L462 AbstractCegarLoop]: Abstraction has 20462 states and 62626 transitions. [2019-12-18 17:14:45,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:14:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 20462 states and 62626 transitions. [2019-12-18 17:14:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:14:45,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:45,244 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] [2019-12-18 17:14:45,244 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:45,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1244789413, now seen corresponding path program 2 times [2019-12-18 17:14:45,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:45,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657993492] [2019-12-18 17:14:45,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:45,319 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-18 17:14:45,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657993492] [2019-12-18 17:14:45,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:45,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:45,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277637523] [2019-12-18 17:14:45,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:45,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:45,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:45,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:45,321 INFO L87 Difference]: Start difference. First operand 20462 states and 62626 transitions. Second operand 3 states. [2019-12-18 17:14:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:45,404 INFO L93 Difference]: Finished difference Result 20460 states and 62621 transitions. [2019-12-18 17:14:45,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:45,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:14:45,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:45,435 INFO L225 Difference]: With dead ends: 20460 [2019-12-18 17:14:45,435 INFO L226 Difference]: Without dead ends: 20460 [2019-12-18 17:14:45,435 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-18 17:14:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20460 states. [2019-12-18 17:14:45,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20460 to 16031. [2019-12-18 17:14:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16031 states. [2019-12-18 17:14:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16031 states to 16031 states and 49976 transitions. [2019-12-18 17:14:45,716 INFO L78 Accepts]: Start accepts. Automaton has 16031 states and 49976 transitions. Word has length 55 [2019-12-18 17:14:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:45,716 INFO L462 AbstractCegarLoop]: Abstraction has 16031 states and 49976 transitions. [2019-12-18 17:14:45,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 16031 states and 49976 transitions. [2019-12-18 17:14:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:14:45,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:45,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] [2019-12-18 17:14:45,742 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:45,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:45,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1211542094, now seen corresponding path program 1 times [2019-12-18 17:14:45,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:45,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205021948] [2019-12-18 17:14:45,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:46,301 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-18 17:14:46,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205021948] [2019-12-18 17:14:46,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:46,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 17:14:46,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661752131] [2019-12-18 17:14:46,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 17:14:46,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:46,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 17:14:46,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:14:46,303 INFO L87 Difference]: Start difference. First operand 16031 states and 49976 transitions. Second operand 16 states. [2019-12-18 17:14:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:51,095 INFO L93 Difference]: Finished difference Result 28373 states and 86187 transitions. [2019-12-18 17:14:51,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 17:14:51,095 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 17:14:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:51,133 INFO L225 Difference]: With dead ends: 28373 [2019-12-18 17:14:51,133 INFO L226 Difference]: Without dead ends: 25931 [2019-12-18 17:14:51,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=426, Invalid=1926, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 17:14:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25931 states. [2019-12-18 17:14:51,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25931 to 17153. [2019-12-18 17:14:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17153 states. [2019-12-18 17:14:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17153 states to 17153 states and 53121 transitions. [2019-12-18 17:14:51,434 INFO L78 Accepts]: Start accepts. Automaton has 17153 states and 53121 transitions. Word has length 56 [2019-12-18 17:14:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:51,434 INFO L462 AbstractCegarLoop]: Abstraction has 17153 states and 53121 transitions. [2019-12-18 17:14:51,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 17:14:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 17153 states and 53121 transitions. [2019-12-18 17:14:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:14:51,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:51,454 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] [2019-12-18 17:14:51,454 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:51,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:51,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1521838778, now seen corresponding path program 2 times [2019-12-18 17:14:51,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:51,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020620202] [2019-12-18 17:14:51,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:51,617 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-18 17:14:51,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020620202] [2019-12-18 17:14:51,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:51,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:14:51,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628547357] [2019-12-18 17:14:51,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:14:51,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:51,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:14:51,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:14:51,619 INFO L87 Difference]: Start difference. First operand 17153 states and 53121 transitions. Second operand 10 states. [2019-12-18 17:14:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:53,096 INFO L93 Difference]: Finished difference Result 23812 states and 72952 transitions. [2019-12-18 17:14:53,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:14:53,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 17:14:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:53,128 INFO L225 Difference]: With dead ends: 23812 [2019-12-18 17:14:53,128 INFO L226 Difference]: Without dead ends: 22618 [2019-12-18 17:14:53,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:14:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22618 states. [2019-12-18 17:14:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22618 to 17531. [2019-12-18 17:14:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17531 states. [2019-12-18 17:14:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17531 states to 17531 states and 54169 transitions. [2019-12-18 17:14:53,549 INFO L78 Accepts]: Start accepts. Automaton has 17531 states and 54169 transitions. Word has length 56 [2019-12-18 17:14:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:53,549 INFO L462 AbstractCegarLoop]: Abstraction has 17531 states and 54169 transitions. [2019-12-18 17:14:53,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:14:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 17531 states and 54169 transitions. [2019-12-18 17:14:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:14:53,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:53,568 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] [2019-12-18 17:14:53,568 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:53,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1112243484, now seen corresponding path program 3 times [2019-12-18 17:14:53,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:53,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248396631] [2019-12-18 17:14:53,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:53,721 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-18 17:14:53,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248396631] [2019-12-18 17:14:53,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:53,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:14:53,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428123786] [2019-12-18 17:14:53,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:14:53,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:53,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:14:53,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:14:53,723 INFO L87 Difference]: Start difference. First operand 17531 states and 54169 transitions. Second operand 10 states. [2019-12-18 17:14:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:55,167 INFO L93 Difference]: Finished difference Result 23191 states and 70996 transitions. [2019-12-18 17:14:55,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:14:55,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 17:14:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:55,201 INFO L225 Difference]: With dead ends: 23191 [2019-12-18 17:14:55,201 INFO L226 Difference]: Without dead ends: 22377 [2019-12-18 17:14:55,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:14:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22377 states. [2019-12-18 17:14:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22377 to 17355. [2019-12-18 17:14:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17355 states. [2019-12-18 17:14:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17355 states to 17355 states and 53721 transitions. [2019-12-18 17:14:55,485 INFO L78 Accepts]: Start accepts. Automaton has 17355 states and 53721 transitions. Word has length 56 [2019-12-18 17:14:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:55,485 INFO L462 AbstractCegarLoop]: Abstraction has 17355 states and 53721 transitions. [2019-12-18 17:14:55,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:14:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 17355 states and 53721 transitions. [2019-12-18 17:14:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:14:55,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:55,504 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] [2019-12-18 17:14:55,505 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:55,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:55,505 INFO L82 PathProgramCache]: Analyzing trace with hash -445147212, now seen corresponding path program 4 times [2019-12-18 17:14:55,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:55,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392107274] [2019-12-18 17:14:55,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:56,097 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-18 17:14:56,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392107274] [2019-12-18 17:14:56,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:56,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 17:14:56,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320880907] [2019-12-18 17:14:56,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 17:14:56,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:56,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 17:14:56,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:14:56,100 INFO L87 Difference]: Start difference. First operand 17355 states and 53721 transitions. Second operand 17 states. [2019-12-18 17:15:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:00,025 INFO L93 Difference]: Finished difference Result 27520 states and 83346 transitions. [2019-12-18 17:15:00,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 17:15:00,026 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 17:15:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:00,066 INFO L225 Difference]: With dead ends: 27520 [2019-12-18 17:15:00,066 INFO L226 Difference]: Without dead ends: 26958 [2019-12-18 17:15:00,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=334, Invalid=1388, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 17:15:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26958 states. [2019-12-18 17:15:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26958 to 17745. [2019-12-18 17:15:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17745 states. [2019-12-18 17:15:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17745 states to 17745 states and 54778 transitions. [2019-12-18 17:15:00,386 INFO L78 Accepts]: Start accepts. Automaton has 17745 states and 54778 transitions. Word has length 56 [2019-12-18 17:15:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:00,387 INFO L462 AbstractCegarLoop]: Abstraction has 17745 states and 54778 transitions. [2019-12-18 17:15:00,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 17:15:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 17745 states and 54778 transitions. [2019-12-18 17:15:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:15:00,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:00,407 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] [2019-12-18 17:15:00,407 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:00,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2106032246, now seen corresponding path program 5 times [2019-12-18 17:15:00,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:00,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699939213] [2019-12-18 17:15:00,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:00,643 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-18 17:15:00,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699939213] [2019-12-18 17:15:00,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:00,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:15:00,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339829023] [2019-12-18 17:15:00,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:15:00,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:00,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:15:00,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:15:00,645 INFO L87 Difference]: Start difference. First operand 17745 states and 54778 transitions. Second operand 12 states. [2019-12-18 17:15:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:02,425 INFO L93 Difference]: Finished difference Result 24531 states and 74759 transitions. [2019-12-18 17:15:02,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:15:02,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 17:15:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:02,459 INFO L225 Difference]: With dead ends: 24531 [2019-12-18 17:15:02,459 INFO L226 Difference]: Without dead ends: 22549 [2019-12-18 17:15:02,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:15:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22549 states. [2019-12-18 17:15:02,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22549 to 16301. [2019-12-18 17:15:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16301 states. [2019-12-18 17:15:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16301 states to 16301 states and 50682 transitions. [2019-12-18 17:15:02,890 INFO L78 Accepts]: Start accepts. Automaton has 16301 states and 50682 transitions. Word has length 56 [2019-12-18 17:15:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:02,890 INFO L462 AbstractCegarLoop]: Abstraction has 16301 states and 50682 transitions. [2019-12-18 17:15:02,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:15:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 16301 states and 50682 transitions. [2019-12-18 17:15:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:15:02,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:02,909 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] [2019-12-18 17:15:02,909 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:02,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:02,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1886942222, now seen corresponding path program 6 times [2019-12-18 17:15:02,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:02,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607215140] [2019-12-18 17:15:02,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:03,139 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-18 17:15:03,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607215140] [2019-12-18 17:15:03,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:03,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:15:03,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589397223] [2019-12-18 17:15:03,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:15:03,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:03,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:15:03,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:15:03,142 INFO L87 Difference]: Start difference. First operand 16301 states and 50682 transitions. Second operand 13 states. [2019-12-18 17:15:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:05,503 INFO L93 Difference]: Finished difference Result 22240 states and 67910 transitions. [2019-12-18 17:15:05,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 17:15:05,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-18 17:15:05,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:05,533 INFO L225 Difference]: With dead ends: 22240 [2019-12-18 17:15:05,533 INFO L226 Difference]: Without dead ends: 20527 [2019-12-18 17:15:05,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=975, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 17:15:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20527 states. [2019-12-18 17:15:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20527 to 16061. [2019-12-18 17:15:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16061 states. [2019-12-18 17:15:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16061 states to 16061 states and 49838 transitions. [2019-12-18 17:15:05,794 INFO L78 Accepts]: Start accepts. Automaton has 16061 states and 49838 transitions. Word has length 56 [2019-12-18 17:15:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:05,794 INFO L462 AbstractCegarLoop]: Abstraction has 16061 states and 49838 transitions. [2019-12-18 17:15:05,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:15:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 16061 states and 49838 transitions. [2019-12-18 17:15:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:15:05,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:05,811 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] [2019-12-18 17:15:05,811 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:05,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1655686983, now seen corresponding path program 1 times [2019-12-18 17:15:05,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:05,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256639389] [2019-12-18 17:15:05,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:05,859 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-18 17:15:05,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256639389] [2019-12-18 17:15:05,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:05,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:15:05,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516445964] [2019-12-18 17:15:05,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:15:05,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:05,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:15:05,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:05,861 INFO L87 Difference]: Start difference. First operand 16061 states and 49838 transitions. Second operand 3 states. [2019-12-18 17:15:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:05,965 INFO L93 Difference]: Finished difference Result 17069 states and 50876 transitions. [2019-12-18 17:15:05,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:05,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 17:15:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:05,995 INFO L225 Difference]: With dead ends: 17069 [2019-12-18 17:15:05,995 INFO L226 Difference]: Without dead ends: 17069 [2019-12-18 17:15:05,996 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-18 17:15:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17069 states. [2019-12-18 17:15:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17069 to 16061. [2019-12-18 17:15:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16061 states. [2019-12-18 17:15:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16061 states to 16061 states and 47956 transitions. [2019-12-18 17:15:06,443 INFO L78 Accepts]: Start accepts. Automaton has 16061 states and 47956 transitions. Word has length 56 [2019-12-18 17:15:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:06,444 INFO L462 AbstractCegarLoop]: Abstraction has 16061 states and 47956 transitions. [2019-12-18 17:15:06,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:15:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 16061 states and 47956 transitions. [2019-12-18 17:15:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:15:06,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:06,474 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] [2019-12-18 17:15:06,475 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:06,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:06,475 INFO L82 PathProgramCache]: Analyzing trace with hash -196673722, now seen corresponding path program 7 times [2019-12-18 17:15:06,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:06,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101481760] [2019-12-18 17:15:06,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:15:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:15:06,838 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:15:06,839 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:15:06,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t928~0.base_21| 4)) (= 0 v_~x$r_buff1_thd2~0_202) (= v_~weak$$choice2~0_155 0) (= |v_ULTIMATE.start_main_~#t928~0.offset_16| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t928~0.base_21|) (= v_~z~0_13 0) (= v_~__unbuffered_cnt~0_148 0) (= 0 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff0_thd1~0_322 0) (= 0 v_~x$r_buff0_thd2~0_247) (= v_~x$flush_delayed~0_68 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$w_buff1_used~0_539) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~weak$$choice0~0_35) (= v_~x$r_buff1_thd1~0_293 0) (= v_~x$r_buff0_thd0~0_140 0) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~x$w_buff0~0_441) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~x~0_192) (= v_~main$tmp_guard0~0_20 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21| 1)) (= v_~y~0_44 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~x$w_buff1~0_298) (= |v_#NULL.offset_4| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21|)) (= 0 v_~x$r_buff1_thd3~0_209) (= v_~__unbuffered_p1_EAX~0_150 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0_used~0_964) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21|) |v_ULTIMATE.start_main_~#t928~0.offset_16| 0)) |v_#memory_int_23|) (= v_~x$r_buff1_thd0~0_215 0) (= v_~x$mem_tmp~0_38 0) (= v_~a~0_41 0) (= 0 v_~x$r_buff0_thd3~0_132))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_441, ~x$flush_delayed~0=v_~x$flush_delayed~0_68, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_293, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_270|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~a~0=v_~a~0_41, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_150, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_15|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_298, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_539, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_202, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_35, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t928~0.offset=|v_ULTIMATE.start_main_~#t928~0.offset_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~x~0=v_~x~0_192, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_322, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_72|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_209, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_38, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y~0=v_~y~0_44, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_215, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_247, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_964, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t928~0.base=|v_ULTIMATE.start_main_~#t928~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_13, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t929~0.offset, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t929~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t930~0.offset, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t928~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t930~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t928~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 17:15:06,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L828-1-->L830: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13| 1) |v_#valid_36|) (= |v_ULTIMATE.start_main_~#t929~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t929~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13|) |v_ULTIMATE.start_main_~#t929~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t929~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t929~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t929~0.offset, #length, ULTIMATE.start_main_~#t929~0.base] because there is no mapped edge [2019-12-18 17:15:06,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-1-->L832: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t930~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t930~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13|) |v_ULTIMATE.start_main_~#t930~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t930~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_11|, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t930~0.offset, ULTIMATE.start_main_~#t930~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 17:15:06,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= 1 v_~x$w_buff0~0_19) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= v_~x$w_buff1_used~0_44 v_~x$w_buff0_used~0_74) (= 1 v_~x$w_buff0_used~0_73) (= 0 (mod v_~x$w_buff1_used~0_44 256))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_74} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 17:15:06,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1755673099 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1755673099 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1755673099 |P2Thread1of1ForFork2_#t~ite32_Out-1755673099|) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In-1755673099 |P2Thread1of1ForFork2_#t~ite32_Out-1755673099|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1755673099, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1755673099, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1755673099, ~x~0=~x~0_In-1755673099} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out-1755673099|, ~x$w_buff1~0=~x$w_buff1~0_In-1755673099, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1755673099, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1755673099, ~x~0=~x~0_In-1755673099} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 17:15:06,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1129687376 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1129687376 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1129687376|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1129687376 |P1Thread1of1ForFork1_#t~ite28_Out-1129687376|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1129687376, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1129687376} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1129687376, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1129687376|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1129687376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 17:15:06,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L805-4-->L806: Formula: (= v_~x~0_35 |v_P2Thread1of1ForFork2_#t~ite32_12|) InVars {P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_12|} OutVars{P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_17|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~x~0] because there is no mapped edge [2019-12-18 17:15:06,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-517572280 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-517572280 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite34_Out-517572280| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-517572280 |P2Thread1of1ForFork2_#t~ite34_Out-517572280|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-517572280, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517572280} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-517572280|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-517572280, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517572280} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-18 17:15:06,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In2122576174 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In2122576174 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2122576174 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In2122576174 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite35_Out2122576174|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In2122576174 |P2Thread1of1ForFork2_#t~ite35_Out2122576174|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2122576174, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2122576174, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2122576174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2122576174} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out2122576174|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2122576174, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2122576174, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2122576174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2122576174} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-18 17:15:06,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-510746863 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-510746863 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-510746863 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-510746863 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-510746863|)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-510746863 |P1Thread1of1ForFork1_#t~ite29_Out-510746863|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-510746863, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-510746863, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-510746863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-510746863} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-510746863|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-510746863, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-510746863, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-510746863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-510746863} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 17:15:06,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1133374057 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1133374057 256)))) (or (and (= ~x$r_buff0_thd2~0_In-1133374057 ~x$r_buff0_thd2~0_Out-1133374057) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-1133374057)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1133374057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1133374057} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1133374057|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1133374057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1133374057} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 17:15:06,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1026791009 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1026791009 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1026791009 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1026791009 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1026791009 |P1Thread1of1ForFork1_#t~ite31_Out-1026791009|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out-1026791009|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1026791009, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1026791009, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1026791009, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1026791009} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1026791009|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1026791009, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1026791009, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1026791009, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1026791009} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 17:15:06,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_113 |v_P1Thread1of1ForFork1_#t~ite31_42|)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_41|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:15:06,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1924362028 256)))) (or (and (= ~x$w_buff1~0_In1924362028 |P0Thread1of1ForFork0_#t~ite12_Out1924362028|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_In1924362028| |P0Thread1of1ForFork0_#t~ite11_Out1924362028|)) (and (= ~x$w_buff1~0_In1924362028 |P0Thread1of1ForFork0_#t~ite11_Out1924362028|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1924362028 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1924362028 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In1924362028 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In1924362028 256)))) (= |P0Thread1of1ForFork0_#t~ite11_Out1924362028| |P0Thread1of1ForFork0_#t~ite12_Out1924362028|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In1924362028|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1924362028, ~x$w_buff1~0=~x$w_buff1~0_In1924362028, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1924362028, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1924362028, ~weak$$choice2~0=~weak$$choice2~0_In1924362028, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1924362028} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out1924362028|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1924362028, ~x$w_buff1~0=~x$w_buff1~0_In1924362028, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1924362028, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1924362028, ~weak$$choice2~0=~weak$$choice2~0_In1924362028, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out1924362028|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1924362028} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 17:15:06,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L746-->L746-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-79614518 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite15_Out-79614518| |P0Thread1of1ForFork0_#t~ite14_Out-79614518|) (= ~x$w_buff0_used~0_In-79614518 |P0Thread1of1ForFork0_#t~ite14_Out-79614518|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-79614518 256)))) (or (= (mod ~x$w_buff0_used~0_In-79614518 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-79614518 256) 0) .cse1) (and .cse1 (= (mod ~x$w_buff1_used~0_In-79614518 256) 0))))) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite14_In-79614518| |P0Thread1of1ForFork0_#t~ite14_Out-79614518|) (= |P0Thread1of1ForFork0_#t~ite15_Out-79614518| ~x$w_buff0_used~0_In-79614518)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-79614518, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-79614518, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-79614518, ~weak$$choice2~0=~weak$$choice2~0_In-79614518, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In-79614518|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-79614518} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-79614518, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-79614518, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-79614518, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out-79614518|, ~weak$$choice2~0=~weak$$choice2~0_In-79614518, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-79614518|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-79614518} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 17:15:06,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L748-->L749: Formula: (and (= v_~x$r_buff0_thd1~0_65 v_~x$r_buff0_thd1~0_64) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_64, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_7|, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite20, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 17:15:06,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L751-->L759: Formula: (and (= v_~x$flush_delayed~0_20 0) (= v_~x~0_54 v_~x$mem_tmp~0_15) (not (= (mod v_~x$flush_delayed~0_21 256) 0)) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 17:15:06,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In402958244 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In402958244 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite36_Out402958244| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite36_Out402958244| ~x$r_buff0_thd3~0_In402958244)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In402958244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402958244} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out402958244|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In402958244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402958244} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 17:15:06,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1033307818 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1033307818 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1033307818 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1033307818 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite37_Out-1033307818| ~x$r_buff1_thd3~0_In-1033307818) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite37_Out-1033307818| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1033307818, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1033307818, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1033307818, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033307818} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-1033307818|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1033307818, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1033307818, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1033307818, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033307818} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-18 17:15:06,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_46| v_~x$r_buff1_thd3~0_117)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_45|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_117, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 17:15:06,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L838: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:15:06,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1600581437 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1600581437 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In1600581437 |ULTIMATE.start_main_#t~ite41_Out1600581437|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out1600581437| ~x~0_In1600581437) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1600581437, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1600581437, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1600581437, ~x~0=~x~0_In1600581437} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1600581437|, ~x$w_buff1~0=~x$w_buff1~0_In1600581437, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1600581437, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1600581437, ~x~0=~x~0_In1600581437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 17:15:06,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L838-4-->L839: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 17:15:06,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In491211812 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In491211812 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out491211812| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out491211812| ~x$w_buff0_used~0_In491211812) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In491211812, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491211812} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In491211812, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out491211812|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491211812} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 17:15:06,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In2012186484 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In2012186484 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In2012186484 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In2012186484 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out2012186484| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In2012186484 |ULTIMATE.start_main_#t~ite44_Out2012186484|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2012186484, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2012186484, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2012186484, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2012186484} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2012186484, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2012186484, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2012186484, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2012186484|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2012186484} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:15:06,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-861030824 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-861030824 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-861030824| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out-861030824| ~x$r_buff0_thd0~0_In-861030824) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-861030824, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-861030824} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-861030824, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-861030824|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-861030824} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:15:06,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-108319007 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-108319007 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-108319007 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-108319007 256)))) (or (and (= ~x$r_buff1_thd0~0_In-108319007 |ULTIMATE.start_main_#t~ite46_Out-108319007|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-108319007|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-108319007, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-108319007, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-108319007, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-108319007} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-108319007, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-108319007|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-108319007, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-108319007, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-108319007} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 17:15:06,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p1_EAX~0_139 0) (= v_~x$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite46_54|) (= v_~main$tmp_guard1~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p2_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p0_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_54|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_53|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_203, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:15:07,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:15:07 BasicIcfg [2019-12-18 17:15:07,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:15:07,058 INFO L168 Benchmark]: Toolchain (without parser) took 72391.68 ms. Allocated memory was 146.3 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 102.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 17:15:07,059 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 17:15:07,060 INFO L168 Benchmark]: CACSL2BoogieTranslator took 684.10 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.9 MB in the beginning and 157.8 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:07,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.60 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:07,065 INFO L168 Benchmark]: Boogie Preprocessor took 45.34 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:07,065 INFO L168 Benchmark]: RCFGBuilder took 761.86 ms. Allocated memory is still 204.5 MB. Free memory was 153.0 MB in the beginning and 105.9 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:07,066 INFO L168 Benchmark]: TraceAbstraction took 70832.62 ms. Allocated memory was 204.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 105.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 17:15:07,076 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 684.10 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.9 MB in the beginning and 157.8 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.60 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.34 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 761.86 ms. Allocated memory is still 204.5 MB. Free memory was 153.0 MB in the beginning and 105.9 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70832.62 ms. Allocated memory was 204.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 105.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6463 VarBasedMoverChecksPositive, 266 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 257 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66821 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t928, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t929, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t930, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L770] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L771] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L772] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L773] 2 x$r_buff0_thd2 = (_Bool)1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L793] 3 y = 1 [L796] 3 z = 1 [L799] 3 __unbuffered_p2_EAX = z [L802] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L806] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L736] 1 a = 1 [L739] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L740] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L741] 1 x$flush_delayed = weak$$choice2 [L742] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L744] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L745] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L746] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L838] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L840] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L841] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 70.4s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 31.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3877 SDtfs, 5109 SDslu, 15331 SDs, 0 SdLazy, 17309 SolverSat, 294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 47 SyntacticMatches, 17 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1914 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89098occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 101174 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 879 NumberOfCodeBlocks, 879 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 803 ConstructedInterpolants, 0 QuantifiedInterpolants, 167091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...