/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/rfi007_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:09:31,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:09:31,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:09:31,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:09:31,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:09:31,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:09:31,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:09:31,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:09:31,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:09:31,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:09:31,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:09:31,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:09:31,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:09:31,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:09:31,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:09:31,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:09:31,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:09:31,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:09:31,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:09:31,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:09:31,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:09:31,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:09:31,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:09:31,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:09:31,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:09:31,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:09:31,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:09:31,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:09:31,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:09:31,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:09:31,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:09:31,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:09:31,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:09:31,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:09:31,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:09:31,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:09:31,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:09:31,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:09:31,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:09:31,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:09:31,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:09:31,421 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 18:09:31,438 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:09:31,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:09:31,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:09:31,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:09:31,442 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:09:31,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:09:31,443 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:09:31,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:09:31,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:09:31,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:09:31,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:09:31,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:09:31,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:09:31,445 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:09:31,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:09:31,445 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:09:31,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:09:31,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:09:31,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:09:31,446 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:09:31,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:09:31,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:09:31,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:09:31,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:09:31,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:09:31,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:09:31,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:09:31,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:09:31,448 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:09:31,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:09:31,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:09:31,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:09:31,763 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:09:31,763 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:09:31,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.opt.i [2019-12-18 18:09:31,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deefc5bb4/c5948b7a4f8047bd8d5ae8d60e345c69/FLAG6a8e99a7f [2019-12-18 18:09:32,411 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:09:32,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.opt.i [2019-12-18 18:09:32,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deefc5bb4/c5948b7a4f8047bd8d5ae8d60e345c69/FLAG6a8e99a7f [2019-12-18 18:09:32,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deefc5bb4/c5948b7a4f8047bd8d5ae8d60e345c69 [2019-12-18 18:09:32,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:09:32,701 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:09:32,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:09:32,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:09:32,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:09:32,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:09:32" (1/1) ... [2019-12-18 18:09:32,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:32, skipping insertion in model container [2019-12-18 18:09:32,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:09:32" (1/1) ... [2019-12-18 18:09:32,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:09:32,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:09:33,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:09:33,358 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:09:33,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:09:33,494 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:09:33,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:33 WrapperNode [2019-12-18 18:09:33,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:09:33,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:09:33,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:09:33,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:09:33,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:33" (1/1) ... [2019-12-18 18:09:33,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:33" (1/1) ... [2019-12-18 18:09:33,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:09:33,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:09:33,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:09:33,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:09:33,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:33" (1/1) ... [2019-12-18 18:09:33,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:33" (1/1) ... [2019-12-18 18:09:33,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:33" (1/1) ... [2019-12-18 18:09:33,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:33" (1/1) ... [2019-12-18 18:09:33,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:33" (1/1) ... [2019-12-18 18:09:33,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:33" (1/1) ... [2019-12-18 18:09:33,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:33" (1/1) ... [2019-12-18 18:09:33,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:09:33,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:09:33,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:09:33,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:09:33,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:33" (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 18:09:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:09:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:09:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:09:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:09:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:09:33,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:09:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:09:33,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:09:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:09:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:09:33,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:09:33,693 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 18:09:34,415 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:09:34,416 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:09:34,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:09:34 BoogieIcfgContainer [2019-12-18 18:09:34,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:09:34,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:09:34,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:09:34,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:09:34,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:09:32" (1/3) ... [2019-12-18 18:09:34,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4723cd1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:09:34, skipping insertion in model container [2019-12-18 18:09:34,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:09:33" (2/3) ... [2019-12-18 18:09:34,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4723cd1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:09:34, skipping insertion in model container [2019-12-18 18:09:34,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:09:34" (3/3) ... [2019-12-18 18:09:34,427 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_power.opt.i [2019-12-18 18:09:34,438 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:09:34,438 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:09:34,446 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:09:34,448 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:09:34,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,488 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,488 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,488 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,499 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,499 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,550 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,556 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:09:34,576 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:09:34,597 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:09:34,597 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:09:34,597 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:09:34,597 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:09:34,597 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:09:34,597 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:09:34,598 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:09:34,598 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:09:34,615 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 18:09:34,618 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 18:09:34,692 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 18:09:34,693 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:09:34,709 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:09:34,734 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 18:09:34,787 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 18:09:34,787 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:09:34,796 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:09:34,815 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 18:09:34,816 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:09:39,621 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 18:09:39,728 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 18:09:40,125 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-18 18:09:40,125 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 18:09:40,129 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-18 18:09:40,703 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-18 18:09:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-18 18:09:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:09:40,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:40,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:09:40,717 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:40,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:40,726 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-18 18:09:40,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:40,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765932402] [2019-12-18 18:09:40,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:40,964 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 18:09:40,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765932402] [2019-12-18 18:09:40,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:40,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:09:40,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101129666] [2019-12-18 18:09:40,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:09:40,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:09:40,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:09:40,993 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-18 18:09:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:41,370 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-18 18:09:41,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:09:41,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:09:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:41,456 INFO L225 Difference]: With dead ends: 9266 [2019-12-18 18:09:41,457 INFO L226 Difference]: Without dead ends: 8258 [2019-12-18 18:09:41,458 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 18:09:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-18 18:09:41,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-18 18:09:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-18 18:09:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-18 18:09:41,939 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-18 18:09:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:41,940 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-18 18:09:41,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:09:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-18 18:09:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:09:41,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:41,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:09:41,944 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:41,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:41,944 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-18 18:09:41,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:41,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32875885] [2019-12-18 18:09:41,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:09:42,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32875885] [2019-12-18 18:09:42,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:42,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:09:42,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581304106] [2019-12-18 18:09:42,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:09:42,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:42,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:09:42,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:09:42,115 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-18 18:09:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:42,189 INFO L93 Difference]: Finished difference Result 1877 states and 4722 transitions. [2019-12-18 18:09:42,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:09:42,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:09:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:42,198 INFO L225 Difference]: With dead ends: 1877 [2019-12-18 18:09:42,198 INFO L226 Difference]: Without dead ends: 1373 [2019-12-18 18:09:42,199 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 18:09:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2019-12-18 18:09:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2019-12-18 18:09:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-12-18 18:09:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 3108 transitions. [2019-12-18 18:09:42,234 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 3108 transitions. Word has length 11 [2019-12-18 18:09:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:42,235 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 3108 transitions. [2019-12-18 18:09:42,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:09:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 3108 transitions. [2019-12-18 18:09:42,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:09:42,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:42,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:09:42,237 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:42,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:42,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-18 18:09:42,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:42,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3559836] [2019-12-18 18:09:42,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:42,408 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 18:09:42,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3559836] [2019-12-18 18:09:42,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:42,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:09:42,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857480685] [2019-12-18 18:09:42,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:09:42,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:42,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:09:42,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:09:42,413 INFO L87 Difference]: Start difference. First operand 1373 states and 3108 transitions. Second operand 4 states. [2019-12-18 18:09:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:42,793 INFO L93 Difference]: Finished difference Result 1700 states and 3783 transitions. [2019-12-18 18:09:42,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:09:42,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 18:09:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:42,803 INFO L225 Difference]: With dead ends: 1700 [2019-12-18 18:09:42,803 INFO L226 Difference]: Without dead ends: 1700 [2019-12-18 18:09:42,803 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 18:09:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-12-18 18:09:42,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1636. [2019-12-18 18:09:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-12-18 18:09:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3659 transitions. [2019-12-18 18:09:42,851 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3659 transitions. Word has length 14 [2019-12-18 18:09:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:42,853 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 3659 transitions. [2019-12-18 18:09:42,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:09:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3659 transitions. [2019-12-18 18:09:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:09:42,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:42,858 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 18:09:42,859 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:42,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:42,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-18 18:09:42,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:42,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140972800] [2019-12-18 18:09:42,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:43,112 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 18:09:43,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140972800] [2019-12-18 18:09:43,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:43,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:09:43,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107583755] [2019-12-18 18:09:43,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:09:43,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:43,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:09:43,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:09:43,117 INFO L87 Difference]: Start difference. First operand 1636 states and 3659 transitions. Second operand 7 states. [2019-12-18 18:09:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:43,894 INFO L93 Difference]: Finished difference Result 4467 states and 9828 transitions. [2019-12-18 18:09:43,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:09:43,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-18 18:09:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:43,918 INFO L225 Difference]: With dead ends: 4467 [2019-12-18 18:09:43,919 INFO L226 Difference]: Without dead ends: 4432 [2019-12-18 18:09:43,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:09:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4432 states. [2019-12-18 18:09:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4432 to 2099. [2019-12-18 18:09:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2099 states. [2019-12-18 18:09:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 4738 transitions. [2019-12-18 18:09:43,990 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 4738 transitions. Word has length 25 [2019-12-18 18:09:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:43,990 INFO L462 AbstractCegarLoop]: Abstraction has 2099 states and 4738 transitions. [2019-12-18 18:09:43,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:09:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 4738 transitions. [2019-12-18 18:09:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 18:09:43,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:43,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:09:43,993 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:43,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:43,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1415860500, now seen corresponding path program 1 times [2019-12-18 18:09:43,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:43,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251964677] [2019-12-18 18:09:43,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:44,040 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 18:09:44,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251964677] [2019-12-18 18:09:44,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:44,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:09:44,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103795236] [2019-12-18 18:09:44,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:09:44,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:44,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:09:44,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:09:44,043 INFO L87 Difference]: Start difference. First operand 2099 states and 4738 transitions. Second operand 3 states. [2019-12-18 18:09:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:44,060 INFO L93 Difference]: Finished difference Result 2098 states and 4736 transitions. [2019-12-18 18:09:44,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:09:44,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 18:09:44,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:44,073 INFO L225 Difference]: With dead ends: 2098 [2019-12-18 18:09:44,073 INFO L226 Difference]: Without dead ends: 2098 [2019-12-18 18:09:44,074 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 18:09:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2019-12-18 18:09:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2098. [2019-12-18 18:09:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2019-12-18 18:09:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 4736 transitions. [2019-12-18 18:09:44,122 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 4736 transitions. Word has length 26 [2019-12-18 18:09:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:44,122 INFO L462 AbstractCegarLoop]: Abstraction has 2098 states and 4736 transitions. [2019-12-18 18:09:44,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:09:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 4736 transitions. [2019-12-18 18:09:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 18:09:44,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:44,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:09:44,126 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:44,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-18 18:09:44,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:44,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155757255] [2019-12-18 18:09:44,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:44,235 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 18:09:44,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155757255] [2019-12-18 18:09:44,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:44,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:09:44,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906067134] [2019-12-18 18:09:44,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:09:44,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:44,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:09:44,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:09:44,238 INFO L87 Difference]: Start difference. First operand 2098 states and 4736 transitions. Second operand 6 states. [2019-12-18 18:09:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:44,990 INFO L93 Difference]: Finished difference Result 4315 states and 9400 transitions. [2019-12-18 18:09:44,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:09:44,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 18:09:44,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:45,001 INFO L225 Difference]: With dead ends: 4315 [2019-12-18 18:09:45,001 INFO L226 Difference]: Without dead ends: 4286 [2019-12-18 18:09:45,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:09:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2019-12-18 18:09:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 1973. [2019-12-18 18:09:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1973 states. [2019-12-18 18:09:45,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 4480 transitions. [2019-12-18 18:09:45,062 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 4480 transitions. Word has length 26 [2019-12-18 18:09:45,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:45,062 INFO L462 AbstractCegarLoop]: Abstraction has 1973 states and 4480 transitions. [2019-12-18 18:09:45,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:09:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 4480 transitions. [2019-12-18 18:09:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 18:09:45,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:45,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:09:45,065 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:45,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1827812304, now seen corresponding path program 1 times [2019-12-18 18:09:45,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:45,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052095757] [2019-12-18 18:09:45,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:45,130 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 18:09:45,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052095757] [2019-12-18 18:09:45,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:45,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:09:45,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296344214] [2019-12-18 18:09:45,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:09:45,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:45,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:09:45,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:09:45,132 INFO L87 Difference]: Start difference. First operand 1973 states and 4480 transitions. Second operand 5 states. [2019-12-18 18:09:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:45,620 INFO L93 Difference]: Finished difference Result 2972 states and 6579 transitions. [2019-12-18 18:09:45,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:09:45,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 18:09:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:45,628 INFO L225 Difference]: With dead ends: 2972 [2019-12-18 18:09:45,629 INFO L226 Difference]: Without dead ends: 2972 [2019-12-18 18:09:45,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:09:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2019-12-18 18:09:45,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2529. [2019-12-18 18:09:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2529 states. [2019-12-18 18:09:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 5676 transitions. [2019-12-18 18:09:45,688 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 5676 transitions. Word has length 27 [2019-12-18 18:09:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:45,688 INFO L462 AbstractCegarLoop]: Abstraction has 2529 states and 5676 transitions. [2019-12-18 18:09:45,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:09:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 5676 transitions. [2019-12-18 18:09:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 18:09:45,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:45,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:09:45,693 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:45,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:45,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-18 18:09:45,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:45,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506767407] [2019-12-18 18:09:45,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:45,758 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 18:09:45,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506767407] [2019-12-18 18:09:45,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:45,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:09:45,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539571875] [2019-12-18 18:09:45,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:09:45,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:45,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:09:45,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:09:45,760 INFO L87 Difference]: Start difference. First operand 2529 states and 5676 transitions. Second operand 5 states. [2019-12-18 18:09:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:45,813 INFO L93 Difference]: Finished difference Result 1582 states and 3395 transitions. [2019-12-18 18:09:45,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:09:45,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 18:09:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:45,818 INFO L225 Difference]: With dead ends: 1582 [2019-12-18 18:09:45,819 INFO L226 Difference]: Without dead ends: 1434 [2019-12-18 18:09:45,819 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 18:09:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-12-18 18:09:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1291. [2019-12-18 18:09:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-12-18 18:09:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 2801 transitions. [2019-12-18 18:09:45,847 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 2801 transitions. Word has length 28 [2019-12-18 18:09:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:45,848 INFO L462 AbstractCegarLoop]: Abstraction has 1291 states and 2801 transitions. [2019-12-18 18:09:45,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:09:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2801 transitions. [2019-12-18 18:09:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 18:09:45,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:45,855 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] [2019-12-18 18:09:45,855 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:45,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1528690992, now seen corresponding path program 1 times [2019-12-18 18:09:45,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:45,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68543688] [2019-12-18 18:09:45,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:46,012 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 18:09:46,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68543688] [2019-12-18 18:09:46,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:46,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:09:46,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692219759] [2019-12-18 18:09:46,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:09:46,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:46,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:09:46,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:09:46,015 INFO L87 Difference]: Start difference. First operand 1291 states and 2801 transitions. Second operand 7 states. [2019-12-18 18:09:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:46,301 INFO L93 Difference]: Finished difference Result 3872 states and 8149 transitions. [2019-12-18 18:09:46,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:09:46,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 18:09:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:46,308 INFO L225 Difference]: With dead ends: 3872 [2019-12-18 18:09:46,308 INFO L226 Difference]: Without dead ends: 2532 [2019-12-18 18:09:46,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:09:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2019-12-18 18:09:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 1349. [2019-12-18 18:09:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2019-12-18 18:09:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2916 transitions. [2019-12-18 18:09:46,403 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2916 transitions. Word has length 51 [2019-12-18 18:09:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:46,404 INFO L462 AbstractCegarLoop]: Abstraction has 1349 states and 2916 transitions. [2019-12-18 18:09:46,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:09:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2916 transitions. [2019-12-18 18:09:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 18:09:46,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:46,408 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] [2019-12-18 18:09:46,408 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash 517037056, now seen corresponding path program 2 times [2019-12-18 18:09:46,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:46,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677660407] [2019-12-18 18:09:46,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:46,477 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 18:09:46,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677660407] [2019-12-18 18:09:46,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:46,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:09:46,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651874081] [2019-12-18 18:09:46,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:09:46,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:46,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:09:46,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:09:46,481 INFO L87 Difference]: Start difference. First operand 1349 states and 2916 transitions. Second operand 3 states. [2019-12-18 18:09:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:46,535 INFO L93 Difference]: Finished difference Result 1775 states and 3794 transitions. [2019-12-18 18:09:46,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:09:46,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 18:09:46,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:46,540 INFO L225 Difference]: With dead ends: 1775 [2019-12-18 18:09:46,540 INFO L226 Difference]: Without dead ends: 1775 [2019-12-18 18:09:46,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 18:09:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-12-18 18:09:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1428. [2019-12-18 18:09:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-18 18:09:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3100 transitions. [2019-12-18 18:09:46,570 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3100 transitions. Word has length 51 [2019-12-18 18:09:46,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:46,572 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3100 transitions. [2019-12-18 18:09:46,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:09:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3100 transitions. [2019-12-18 18:09:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:09:46,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:46,576 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] [2019-12-18 18:09:46,577 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:46,577 INFO L82 PathProgramCache]: Analyzing trace with hash -975275625, now seen corresponding path program 1 times [2019-12-18 18:09:46,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:46,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145441290] [2019-12-18 18:09:46,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:46,760 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 18:09:46,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145441290] [2019-12-18 18:09:46,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:46,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:09:46,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665310934] [2019-12-18 18:09:46,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:09:46,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:46,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:09:46,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:09:46,762 INFO L87 Difference]: Start difference. First operand 1428 states and 3100 transitions. Second operand 8 states. [2019-12-18 18:09:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:48,450 INFO L93 Difference]: Finished difference Result 3319 states and 6997 transitions. [2019-12-18 18:09:48,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 18:09:48,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-18 18:09:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:48,460 INFO L225 Difference]: With dead ends: 3319 [2019-12-18 18:09:48,460 INFO L226 Difference]: Without dead ends: 3319 [2019-12-18 18:09:48,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:09:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2019-12-18 18:09:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 1557. [2019-12-18 18:09:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-12-18 18:09:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 3381 transitions. [2019-12-18 18:09:48,507 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 3381 transitions. Word has length 52 [2019-12-18 18:09:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:48,507 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 3381 transitions. [2019-12-18 18:09:48,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:09:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 3381 transitions. [2019-12-18 18:09:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:09:48,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:48,511 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] [2019-12-18 18:09:48,512 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash -709931818, now seen corresponding path program 1 times [2019-12-18 18:09:48,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:48,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953165826] [2019-12-18 18:09:48,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:48,614 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 18:09:48,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953165826] [2019-12-18 18:09:48,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:48,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:09:48,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929630889] [2019-12-18 18:09:48,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:09:48,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:48,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:09:48,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:09:48,616 INFO L87 Difference]: Start difference. First operand 1557 states and 3381 transitions. Second operand 7 states. [2019-12-18 18:09:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:49,676 INFO L93 Difference]: Finished difference Result 2962 states and 6177 transitions. [2019-12-18 18:09:49,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 18:09:49,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 18:09:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:49,683 INFO L225 Difference]: With dead ends: 2962 [2019-12-18 18:09:49,683 INFO L226 Difference]: Without dead ends: 2962 [2019-12-18 18:09:49,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:09:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2019-12-18 18:09:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1592. [2019-12-18 18:09:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2019-12-18 18:09:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 3462 transitions. [2019-12-18 18:09:49,721 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 3462 transitions. Word has length 52 [2019-12-18 18:09:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:49,722 INFO L462 AbstractCegarLoop]: Abstraction has 1592 states and 3462 transitions. [2019-12-18 18:09:49,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:09:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 3462 transitions. [2019-12-18 18:09:49,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:09:49,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:49,726 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] [2019-12-18 18:09:49,726 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:49,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:49,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1725495463, now seen corresponding path program 2 times [2019-12-18 18:09:49,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:49,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044313529] [2019-12-18 18:09:49,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:09:49,795 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 18:09:49,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044313529] [2019-12-18 18:09:49,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:09:49,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:09:49,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895418934] [2019-12-18 18:09:49,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:09:49,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:09:49,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:09:49,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:09:49,797 INFO L87 Difference]: Start difference. First operand 1592 states and 3462 transitions. Second operand 3 states. [2019-12-18 18:09:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:09:49,811 INFO L93 Difference]: Finished difference Result 1591 states and 3460 transitions. [2019-12-18 18:09:49,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:09:49,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:09:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:09:49,814 INFO L225 Difference]: With dead ends: 1591 [2019-12-18 18:09:49,814 INFO L226 Difference]: Without dead ends: 1591 [2019-12-18 18:09:49,815 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 18:09:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-12-18 18:09:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1125. [2019-12-18 18:09:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-12-18 18:09:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 2488 transitions. [2019-12-18 18:09:49,837 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 2488 transitions. Word has length 52 [2019-12-18 18:09:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:09:49,838 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 2488 transitions. [2019-12-18 18:09:49,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:09:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 2488 transitions. [2019-12-18 18:09:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:09:49,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:09:49,841 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] [2019-12-18 18:09:49,841 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:09:49,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:09:49,841 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-18 18:09:49,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:09:49,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609176320] [2019-12-18 18:09:49,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:09:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:09:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:09:50,002 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:09:50,002 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:09:50,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1707~0.base_24| 1)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1707~0.base_24| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1707~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1707~0.base_24|) |v_ULTIMATE.start_main_~#t1707~0.offset_18| 0)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1707~0.offset_18|) (= v_~__unbuffered_p1_EBX~0_40 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1707~0.base_24|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1707~0.base_24|)) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_~#t1708~0.offset=|v_ULTIMATE.start_main_~#t1708~0.offset_14|, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_~#t1708~0.base=|v_ULTIMATE.start_main_~#t1708~0.base_16|, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ULTIMATE.start_main_~#t1707~0.base=|v_ULTIMATE.start_main_~#t1707~0.base_24|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_~#t1707~0.offset=|v_ULTIMATE.start_main_~#t1707~0.offset_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1708~0.offset, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1708~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1707~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1707~0.offset, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:09:50,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 18:09:50,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1708~0.base_12|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1708~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1708~0.base_12|) |v_ULTIMATE.start_main_~#t1708~0.offset_10| 1))) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1708~0.base_12| 4) |v_#length_9|) (= 0 |v_ULTIMATE.start_main_~#t1708~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1708~0.base_12|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1708~0.base_12| 1) |v_#valid_27|) (not (= 0 |v_ULTIMATE.start_main_~#t1708~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1708~0.base=|v_ULTIMATE.start_main_~#t1708~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1708~0.offset=|v_ULTIMATE.start_main_~#t1708~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1708~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1708~0.offset] because there is no mapped edge [2019-12-18 18:09:50,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-180258755 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-180258755 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-180258755| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-180258755 |P0Thread1of1ForFork0_#t~ite5_Out-180258755|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-180258755, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-180258755} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-180258755|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-180258755, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-180258755} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:09:50,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1070924278 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out-1070924278| ~x$w_buff0~0_In-1070924278) (= |P1Thread1of1ForFork1_#t~ite14_In-1070924278| |P1Thread1of1ForFork1_#t~ite14_Out-1070924278|)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out-1070924278| |P1Thread1of1ForFork1_#t~ite14_Out-1070924278|) (= |P1Thread1of1ForFork1_#t~ite14_Out-1070924278| ~x$w_buff0~0_In-1070924278) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1070924278 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd2~0_In-1070924278 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1070924278 256))) (= 0 (mod ~x$w_buff0_used~0_In-1070924278 256)))) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1070924278, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1070924278, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1070924278, ~weak$$choice2~0=~weak$$choice2~0_In-1070924278, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1070924278, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1070924278|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1070924278} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1070924278, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1070924278, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1070924278, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1070924278|, ~weak$$choice2~0=~weak$$choice2~0_In-1070924278, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1070924278, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1070924278|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1070924278} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:09:50,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1359013261 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1359013261 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1359013261 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1359013261 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1359013261|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-1359013261 |P0Thread1of1ForFork0_#t~ite6_Out-1359013261|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1359013261, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1359013261, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1359013261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1359013261} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1359013261|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1359013261, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1359013261, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1359013261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1359013261} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:09:50,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1568172535 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1568172535 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In-1568172535 ~x$r_buff0_thd1~0_Out-1568172535)) (and (not .cse1) (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out-1568172535)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1568172535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1568172535} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1568172535, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1568172535|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1568172535} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 18:09:50,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In797037317 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In797037317 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In797037317 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In797037317 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out797037317|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$r_buff1_thd1~0_In797037317 |P0Thread1of1ForFork0_#t~ite8_Out797037317|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In797037317, ~x$w_buff1_used~0=~x$w_buff1_used~0_In797037317, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In797037317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In797037317} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In797037317, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out797037317|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In797037317, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In797037317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In797037317} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:09:50,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 18:09:50,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In208002905 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In208002905| |P1Thread1of1ForFork1_#t~ite17_Out208002905|) (= ~x$w_buff1~0_In208002905 |P1Thread1of1ForFork1_#t~ite18_Out208002905|) (not .cse0)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In208002905 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In208002905 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In208002905 256))) (= (mod ~x$w_buff0_used~0_In208002905 256) 0))) (= |P1Thread1of1ForFork1_#t~ite18_Out208002905| |P1Thread1of1ForFork1_#t~ite17_Out208002905|) (= ~x$w_buff1~0_In208002905 |P1Thread1of1ForFork1_#t~ite17_Out208002905|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In208002905, ~x$w_buff1_used~0=~x$w_buff1_used~0_In208002905, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In208002905, ~weak$$choice2~0=~weak$$choice2~0_In208002905, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In208002905, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In208002905|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In208002905} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out208002905|, ~x$w_buff1~0=~x$w_buff1~0_In208002905, ~x$w_buff1_used~0=~x$w_buff1_used~0_In208002905, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In208002905, ~weak$$choice2~0=~weak$$choice2~0_In208002905, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In208002905, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out208002905|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In208002905} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 18:09:50,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1517987238 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1517987238| ~x$w_buff0_used~0_In-1517987238) (= |P1Thread1of1ForFork1_#t~ite20_In-1517987238| |P1Thread1of1ForFork1_#t~ite20_Out-1517987238|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-1517987238| ~x$w_buff0_used~0_In-1517987238) (= |P1Thread1of1ForFork1_#t~ite21_Out-1517987238| |P1Thread1of1ForFork1_#t~ite20_Out-1517987238|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1517987238 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-1517987238 256) 0)) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In-1517987238 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1517987238 256))))))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1517987238|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1517987238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1517987238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1517987238, ~weak$$choice2~0=~weak$$choice2~0_In-1517987238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1517987238} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1517987238|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1517987238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1517987238, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1517987238|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1517987238, ~weak$$choice2~0=~weak$$choice2~0_In-1517987238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1517987238} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 18:09:50,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 18:09:50,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In222854817 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out222854817| |P1Thread1of1ForFork1_#t~ite30_Out222854817|) (= |P1Thread1of1ForFork1_#t~ite29_Out222854817| ~x$r_buff1_thd2~0_In222854817) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In222854817 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In222854817 256))) (= 0 (mod ~x$w_buff0_used~0_In222854817 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In222854817 256) 0))))) (and (= |P1Thread1of1ForFork1_#t~ite29_In222854817| |P1Thread1of1ForFork1_#t~ite29_Out222854817|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out222854817| ~x$r_buff1_thd2~0_In222854817)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In222854817|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In222854817, ~x$w_buff1_used~0=~x$w_buff1_used~0_In222854817, ~weak$$choice2~0=~weak$$choice2~0_In222854817, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In222854817, ~x$w_buff0_used~0=~x$w_buff0_used~0_In222854817} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out222854817|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out222854817|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In222854817, ~x$w_buff1_used~0=~x$w_buff1_used~0_In222854817, ~weak$$choice2~0=~weak$$choice2~0_In222854817, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In222854817, ~x$w_buff0_used~0=~x$w_buff0_used~0_In222854817} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 18:09:50,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-18 18:09:50,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In269004390 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In269004390 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out269004390| ~x$w_buff1~0_In269004390) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out269004390| ~x~0_In269004390) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In269004390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In269004390, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In269004390, ~x~0=~x~0_In269004390} OutVars{~x$w_buff1~0=~x$w_buff1~0_In269004390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In269004390, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In269004390, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out269004390|, ~x~0=~x~0_In269004390} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:09:50,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 18:09:50,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1719828815 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1719828815 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1719828815|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1719828815 |P1Thread1of1ForFork1_#t~ite34_Out1719828815|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1719828815, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1719828815} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1719828815|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1719828815, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1719828815} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:09:50,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1162939528 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1162939528 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1162939528 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1162939528 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1162939528| ~x$w_buff1_used~0_In1162939528) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite35_Out1162939528| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1162939528, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1162939528, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1162939528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1162939528} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1162939528, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1162939528, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1162939528|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1162939528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1162939528} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:09:50,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In220547292 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In220547292 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out220547292|) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In220547292 |P1Thread1of1ForFork1_#t~ite36_Out220547292|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In220547292, ~x$w_buff0_used~0=~x$w_buff0_used~0_In220547292} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In220547292, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out220547292|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In220547292} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:09:50,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1441202035 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1441202035 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1441202035 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1441202035 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1441202035 |P1Thread1of1ForFork1_#t~ite37_Out-1441202035|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1441202035|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1441202035, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1441202035, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1441202035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1441202035} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1441202035, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1441202035, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1441202035, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1441202035|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1441202035} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:09:50,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:09:50,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 18:09:50,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1343673774 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1343673774 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1343673774| ~x~0_In-1343673774) (or .cse0 .cse1)) (and (not .cse1) (= ~x$w_buff1~0_In-1343673774 |ULTIMATE.start_main_#t~ite40_Out-1343673774|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1343673774, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1343673774, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1343673774, ~x~0=~x~0_In-1343673774} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1343673774|, ~x$w_buff1~0=~x$w_buff1~0_In-1343673774, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1343673774, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1343673774, ~x~0=~x~0_In-1343673774} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 18:09:50,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-18 18:09:50,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-307079365 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-307079365 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-307079365| ~x$w_buff0_used~0_In-307079365) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-307079365| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-307079365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-307079365} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-307079365, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-307079365|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-307079365} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 18:09:50,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In501518862 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In501518862 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In501518862 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In501518862 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out501518862| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In501518862 |ULTIMATE.start_main_#t~ite43_Out501518862|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In501518862, ~x$w_buff1_used~0=~x$w_buff1_used~0_In501518862, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In501518862, ~x$w_buff0_used~0=~x$w_buff0_used~0_In501518862} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In501518862, ~x$w_buff1_used~0=~x$w_buff1_used~0_In501518862, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out501518862|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In501518862, ~x$w_buff0_used~0=~x$w_buff0_used~0_In501518862} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:09:50,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1577196307 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1577196307 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1577196307| ~x$r_buff0_thd0~0_In-1577196307) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1577196307| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1577196307, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577196307} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1577196307, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1577196307|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577196307} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:09:50,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In567051843 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In567051843 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In567051843 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In567051843 256)))) (or (and (= ~x$r_buff1_thd0~0_In567051843 |ULTIMATE.start_main_#t~ite45_Out567051843|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out567051843|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In567051843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In567051843, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In567051843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In567051843} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In567051843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In567051843, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In567051843, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out567051843|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In567051843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:09:50,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_20 0) (= v_~y~0_126 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 2 v_~__unbuffered_p1_EAX~0_27) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:09:50,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:09:50 BasicIcfg [2019-12-18 18:09:50,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:09:50,110 INFO L168 Benchmark]: Toolchain (without parser) took 17408.48 ms. Allocated memory was 138.4 MB in the beginning and 470.8 MB in the end (delta: 332.4 MB). Free memory was 100.9 MB in the beginning and 224.2 MB in the end (delta: -123.3 MB). Peak memory consumption was 209.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:09:50,111 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 18:09:50,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.35 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 100.5 MB in the beginning and 153.7 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 18:09:50,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.36 ms. Allocated memory is still 201.3 MB. Free memory was 153.7 MB in the beginning and 150.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:09:50,114 INFO L168 Benchmark]: Boogie Preprocessor took 64.00 ms. Allocated memory is still 201.3 MB. Free memory was 150.8 MB in the beginning and 148.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:09:50,114 INFO L168 Benchmark]: RCFGBuilder took 796.10 ms. Allocated memory is still 201.3 MB. Free memory was 148.8 MB in the beginning and 104.7 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:09:50,119 INFO L168 Benchmark]: TraceAbstraction took 15688.80 ms. Allocated memory was 201.3 MB in the beginning and 470.8 MB in the end (delta: 269.5 MB). Free memory was 104.1 MB in the beginning and 224.2 MB in the end (delta: -120.2 MB). Peak memory consumption was 149.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:09:50,127 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.26 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.35 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 100.5 MB in the beginning and 153.7 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.36 ms. Allocated memory is still 201.3 MB. Free memory was 153.7 MB in the beginning and 150.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.00 ms. Allocated memory is still 201.3 MB. Free memory was 150.8 MB in the beginning and 148.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 796.10 ms. Allocated memory is still 201.3 MB. Free memory was 148.8 MB in the beginning and 104.7 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15688.80 ms. Allocated memory was 201.3 MB in the beginning and 470.8 MB in the end (delta: 269.5 MB). Free memory was 104.1 MB in the beginning and 224.2 MB in the end (delta: -120.2 MB). Peak memory consumption was 149.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1707, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L799] FCALL, FORK 0 pthread_create(&t1708, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L774] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 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 [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 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 [L808] 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 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1993 SDtfs, 2345 SDslu, 4609 SDs, 0 SdLazy, 3388 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 25 SyntacticMatches, 12 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9438occurred 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: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 10424 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 59155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...