./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe022_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe022_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fac85231f5e7b09e0680a474d412fb9232e1875e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 18:30:41,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:30:41,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:30:41,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:30:41,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:30:41,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:30:41,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:30:41,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:30:41,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:30:41,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:30:41,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:30:41,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:30:41,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:30:41,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:30:41,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:30:41,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:30:41,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:30:41,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:30:41,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:30:41,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:30:41,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:30:41,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:30:41,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:30:41,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:30:41,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:30:41,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:30:41,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:30:41,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:30:41,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:30:41,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:30:41,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:30:41,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:30:41,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:30:41,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:30:41,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:30:41,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:30:41,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:30:41,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:30:41,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:30:41,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:30:41,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:30:41,444 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:30:41,458 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:30:41,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:30:41,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:30:41,461 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:30:41,461 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:30:41,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:30:41,462 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:30:41,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:30:41,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:30:41,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:30:41,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:30:41,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:30:41,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:30:41,463 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:30:41,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:30:41,464 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:30:41,464 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:30:41,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:30:41,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:30:41,465 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:30:41,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:30:41,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:30:41,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:30:41,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:30:41,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:30:41,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:30:41,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:30:41,467 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:30:41,468 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:30:41,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fac85231f5e7b09e0680a474d412fb9232e1875e [2019-11-28 18:30:41,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:30:41,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:30:41,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:30:41,833 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:30:41,835 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:30:41,836 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe022_rmo.oepc.i [2019-11-28 18:30:41,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19660ceac/d88b46b2aa8e40a0b3db48a90d4fe9ae/FLAG74493af5a [2019-11-28 18:30:42,542 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:30:42,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe022_rmo.oepc.i [2019-11-28 18:30:42,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19660ceac/d88b46b2aa8e40a0b3db48a90d4fe9ae/FLAG74493af5a [2019-11-28 18:30:42,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19660ceac/d88b46b2aa8e40a0b3db48a90d4fe9ae [2019-11-28 18:30:42,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:30:42,856 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:30:42,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:30:42,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:30:42,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:30:42,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:30:42" (1/1) ... [2019-11-28 18:30:42,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc7dcd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:42, skipping insertion in model container [2019-11-28 18:30:42,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:30:42" (1/1) ... [2019-11-28 18:30:42,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:30:42,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:30:43,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:30:43,441 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:30:43,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:30:43,633 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:30:43,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:43 WrapperNode [2019-11-28 18:30:43,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:30:43,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:30:43,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:30:43,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:30:43,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:43" (1/1) ... [2019-11-28 18:30:43,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:43" (1/1) ... [2019-11-28 18:30:43,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:30:43,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:30:43,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:30:43,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:30:43,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:43" (1/1) ... [2019-11-28 18:30:43,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:43" (1/1) ... [2019-11-28 18:30:43,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:43" (1/1) ... [2019-11-28 18:30:43,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:43" (1/1) ... [2019-11-28 18:30:43,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:43" (1/1) ... [2019-11-28 18:30:43,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:43" (1/1) ... [2019-11-28 18:30:43,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:43" (1/1) ... [2019-11-28 18:30:43,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:30:43,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:30:43,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:30:43,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:30:43,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:43" (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-11-28 18:30:43,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:30:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:30:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:30:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:30:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:30:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:30:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:30:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:30:43,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:30:43,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:30:43,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:30:43,848 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:30:44,516 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:30:44,517 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:30:44,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:30:44 BoogieIcfgContainer [2019-11-28 18:30:44,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:30:44,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:30:44,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:30:44,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:30:44,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:30:42" (1/3) ... [2019-11-28 18:30:44,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1e4190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:30:44, skipping insertion in model container [2019-11-28 18:30:44,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:43" (2/3) ... [2019-11-28 18:30:44,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1e4190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:30:44, skipping insertion in model container [2019-11-28 18:30:44,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:30:44" (3/3) ... [2019-11-28 18:30:44,530 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_rmo.oepc.i [2019-11-28 18:30:44,543 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:30:44,543 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:30:44,553 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:30:44,554 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:30:44,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,619 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:44,706 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:30:44,731 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:30:44,731 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:30:44,731 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:30:44,731 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:30:44,731 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:30:44,731 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:30:44,732 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:30:44,732 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:30:44,750 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:30:44,752 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:30:44,841 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:30:44,842 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:30:44,858 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 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:30:44,883 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:30:44,929 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:30:44,929 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:30:44,936 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 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:30:44,954 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:30:44,956 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:30:49,709 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:30:49,847 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:30:49,938 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-11-28 18:30:49,938 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-11-28 18:30:49,942 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-11-28 18:30:50,396 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-11-28 18:30:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-11-28 18:30:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:30:50,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:50,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:30:50,406 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:50,413 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-11-28 18:30:50,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:50,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872509506] [2019-11-28 18:30:50,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:50,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872509506] [2019-11-28 18:30:50,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:50,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:30:50,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748608655] [2019-11-28 18:30:50,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:30:50,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:50,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:30:50,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:30:50,651 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-11-28 18:30:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:50,917 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-11-28 18:30:50,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:30:50,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:30:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:51,041 INFO L225 Difference]: With dead ends: 8074 [2019-11-28 18:30:51,042 INFO L226 Difference]: Without dead ends: 7606 [2019-11-28 18:30:51,044 INFO L630 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-11-28 18:30:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-11-28 18:30:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-11-28 18:30:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-11-28 18:30:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-11-28 18:30:51,500 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-11-28 18:30:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:51,501 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-11-28 18:30:51,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:30:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-11-28 18:30:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:30:51,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:51,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:51,506 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:51,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:51,507 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-11-28 18:30:51,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:51,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575641079] [2019-11-28 18:30:51,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:51,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575641079] [2019-11-28 18:30:51,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:51,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:30:51,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347351646] [2019-11-28 18:30:51,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:30:51,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:51,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:30:51,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:30:51,698 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-11-28 18:30:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:52,150 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-11-28 18:30:52,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:30:52,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:30:52,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:52,247 INFO L225 Difference]: With dead ends: 11630 [2019-11-28 18:30:52,247 INFO L226 Difference]: Without dead ends: 11623 [2019-11-28 18:30:52,249 INFO L630 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-11-28 18:30:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-11-28 18:30:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-11-28 18:30:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-11-28 18:30:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-11-28 18:30:53,003 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-11-28 18:30:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:53,004 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-11-28 18:30:53,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:30:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-11-28 18:30:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:30:53,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:53,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:53,018 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:53,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-11-28 18:30:53,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:53,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345903920] [2019-11-28 18:30:53,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:53,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345903920] [2019-11-28 18:30:53,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:53,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:30:53,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168109578] [2019-11-28 18:30:53,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:30:53,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:53,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:30:53,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:30:53,176 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-11-28 18:30:53,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:53,527 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-11-28 18:30:53,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:30:53,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:30:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:53,581 INFO L225 Difference]: With dead ends: 14471 [2019-11-28 18:30:53,581 INFO L226 Difference]: Without dead ends: 14471 [2019-11-28 18:30:53,581 INFO L630 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-11-28 18:30:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-11-28 18:30:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-11-28 18:30:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-11-28 18:30:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-11-28 18:30:54,057 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-11-28 18:30:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:54,059 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-11-28 18:30:54,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:30:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-11-28 18:30:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:30:54,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:54,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:54,065 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:54,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:54,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-11-28 18:30:54,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:54,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894907177] [2019-11-28 18:30:54,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:54,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894907177] [2019-11-28 18:30:54,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:54,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:30:54,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003400730] [2019-11-28 18:30:54,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:30:54,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:54,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:30:54,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:30:54,168 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-11-28 18:30:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:54,235 INFO L93 Difference]: Finished difference Result 11335 states and 35719 transitions. [2019-11-28 18:30:54,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:30:54,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:30:54,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:54,281 INFO L225 Difference]: With dead ends: 11335 [2019-11-28 18:30:54,282 INFO L226 Difference]: Without dead ends: 11335 [2019-11-28 18:30:54,282 INFO L630 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-11-28 18:30:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11335 states. [2019-11-28 18:30:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11335 to 11335. [2019-11-28 18:30:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11335 states. [2019-11-28 18:30:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11335 states to 11335 states and 35719 transitions. [2019-11-28 18:30:54,609 INFO L78 Accepts]: Start accepts. Automaton has 11335 states and 35719 transitions. Word has length 16 [2019-11-28 18:30:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:54,610 INFO L462 AbstractCegarLoop]: Abstraction has 11335 states and 35719 transitions. [2019-11-28 18:30:54,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:30:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 11335 states and 35719 transitions. [2019-11-28 18:30:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:30:54,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:54,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:54,615 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:54,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1732892148, now seen corresponding path program 1 times [2019-11-28 18:30:54,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:54,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267345450] [2019-11-28 18:30:54,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:54,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267345450] [2019-11-28 18:30:54,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:54,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:30:54,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917884236] [2019-11-28 18:30:54,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:30:54,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:54,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:30:54,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:30:54,686 INFO L87 Difference]: Start difference. First operand 11335 states and 35719 transitions. Second operand 4 states. [2019-11-28 18:30:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:54,788 INFO L93 Difference]: Finished difference Result 16217 states and 51513 transitions. [2019-11-28 18:30:54,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:30:54,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:30:54,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:54,849 INFO L225 Difference]: With dead ends: 16217 [2019-11-28 18:30:54,850 INFO L226 Difference]: Without dead ends: 16217 [2019-11-28 18:30:54,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11-28 18:30:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16217 states. [2019-11-28 18:30:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16217 to 16180. [2019-11-28 18:30:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16180 states. [2019-11-28 18:30:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16180 states to 16180 states and 51458 transitions. [2019-11-28 18:30:55,485 INFO L78 Accepts]: Start accepts. Automaton has 16180 states and 51458 transitions. Word has length 17 [2019-11-28 18:30:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:55,485 INFO L462 AbstractCegarLoop]: Abstraction has 16180 states and 51458 transitions. [2019-11-28 18:30:55,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:30:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 16180 states and 51458 transitions. [2019-11-28 18:30:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:30:55,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:55,502 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:55,502 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:55,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:55,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1167521807, now seen corresponding path program 1 times [2019-11-28 18:30:55,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:55,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079885910] [2019-11-28 18:30:55,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:55,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:55,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079885910] [2019-11-28 18:30:55,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:55,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:30:55,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086240959] [2019-11-28 18:30:55,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:30:55,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:55,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:30:55,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:30:55,579 INFO L87 Difference]: Start difference. First operand 16180 states and 51458 transitions. Second operand 4 states. [2019-11-28 18:30:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:55,618 INFO L93 Difference]: Finished difference Result 2974 states and 7609 transitions. [2019-11-28 18:30:55,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:30:55,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 18:30:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:55,625 INFO L225 Difference]: With dead ends: 2974 [2019-11-28 18:30:55,626 INFO L226 Difference]: Without dead ends: 2084 [2019-11-28 18:30:55,626 INFO L630 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-11-28 18:30:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2019-11-28 18:30:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2068. [2019-11-28 18:30:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2068 states. [2019-11-28 18:30:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 4728 transitions. [2019-11-28 18:30:55,665 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 4728 transitions. Word has length 18 [2019-11-28 18:30:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:55,666 INFO L462 AbstractCegarLoop]: Abstraction has 2068 states and 4728 transitions. [2019-11-28 18:30:55,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:30:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 4728 transitions. [2019-11-28 18:30:55,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:30:55,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:55,670 INFO L410 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] [2019-11-28 18:30:55,670 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:55,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:55,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-11-28 18:30:55,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:55,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120366271] [2019-11-28 18:30:55,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:55,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-11-28 18:30:55,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120366271] [2019-11-28 18:30:55,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:55,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:30:55,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415198250] [2019-11-28 18:30:55,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:30:55,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:55,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:30:55,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:30:55,763 INFO L87 Difference]: Start difference. First operand 2068 states and 4728 transitions. Second operand 6 states. [2019-11-28 18:30:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:56,233 INFO L93 Difference]: Finished difference Result 2856 states and 6268 transitions. [2019-11-28 18:30:56,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:30:56,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 18:30:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:56,239 INFO L225 Difference]: With dead ends: 2856 [2019-11-28 18:30:56,239 INFO L226 Difference]: Without dead ends: 2804 [2019-11-28 18:30:56,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:30:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2019-11-28 18:30:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2146. [2019-11-28 18:30:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2019-11-28 18:30:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 4875 transitions. [2019-11-28 18:30:56,280 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 4875 transitions. Word has length 24 [2019-11-28 18:30:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:56,280 INFO L462 AbstractCegarLoop]: Abstraction has 2146 states and 4875 transitions. [2019-11-28 18:30:56,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:30:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 4875 transitions. [2019-11-28 18:30:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:30:56,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:56,284 INFO L410 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-11-28 18:30:56,285 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:56,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:56,285 INFO L82 PathProgramCache]: Analyzing trace with hash -451164714, now seen corresponding path program 1 times [2019-11-28 18:30:56,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:56,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958973437] [2019-11-28 18:30:56,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:56,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958973437] [2019-11-28 18:30:56,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:56,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:30:56,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144440730] [2019-11-28 18:30:56,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:30:56,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:56,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:30:56,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:30:56,367 INFO L87 Difference]: Start difference. First operand 2146 states and 4875 transitions. Second operand 5 states. [2019-11-28 18:30:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:56,822 INFO L93 Difference]: Finished difference Result 3235 states and 7178 transitions. [2019-11-28 18:30:56,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:30:56,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:30:56,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:56,828 INFO L225 Difference]: With dead ends: 3235 [2019-11-28 18:30:56,828 INFO L226 Difference]: Without dead ends: 3235 [2019-11-28 18:30:56,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:30:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2019-11-28 18:30:56,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 2919. [2019-11-28 18:30:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2919 states. [2019-11-28 18:30:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 6553 transitions. [2019-11-28 18:30:56,884 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 6553 transitions. Word has length 27 [2019-11-28 18:30:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:56,884 INFO L462 AbstractCegarLoop]: Abstraction has 2919 states and 6553 transitions. [2019-11-28 18:30:56,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:30:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 6553 transitions. [2019-11-28 18:30:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:30:56,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:56,891 INFO L410 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-11-28 18:30:56,891 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:56,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-11-28 18:30:56,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:56,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579561732] [2019-11-28 18:30:56,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:56,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579561732] [2019-11-28 18:30:56,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:56,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:30:56,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063261438] [2019-11-28 18:30:56,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:30:56,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:56,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:30:56,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:30:56,977 INFO L87 Difference]: Start difference. First operand 2919 states and 6553 transitions. Second operand 5 states. [2019-11-28 18:30:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:57,036 INFO L93 Difference]: Finished difference Result 1792 states and 3852 transitions. [2019-11-28 18:30:57,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:30:57,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 18:30:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:57,040 INFO L225 Difference]: With dead ends: 1792 [2019-11-28 18:30:57,040 INFO L226 Difference]: Without dead ends: 1625 [2019-11-28 18:30:57,040 INFO L630 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-11-28 18:30:57,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2019-11-28 18:30:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1076. [2019-11-28 18:30:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-11-28 18:30:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2287 transitions. [2019-11-28 18:30:57,069 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2287 transitions. Word has length 28 [2019-11-28 18:30:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:57,069 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 2287 transitions. [2019-11-28 18:30:57,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:30:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2287 transitions. [2019-11-28 18:30:57,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 18:30:57,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:57,074 INFO L410 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] [2019-11-28 18:30:57,074 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:57,075 INFO L82 PathProgramCache]: Analyzing trace with hash -44666522, now seen corresponding path program 1 times [2019-11-28 18:30:57,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:57,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083467560] [2019-11-28 18:30:57,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:57,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083467560] [2019-11-28 18:30:57,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:57,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:30:57,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485284357] [2019-11-28 18:30:57,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:30:57,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:57,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:30:57,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:30:57,160 INFO L87 Difference]: Start difference. First operand 1076 states and 2287 transitions. Second operand 3 states. [2019-11-28 18:30:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:57,226 INFO L93 Difference]: Finished difference Result 1488 states and 3143 transitions. [2019-11-28 18:30:57,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:30:57,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 18:30:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:57,230 INFO L225 Difference]: With dead ends: 1488 [2019-11-28 18:30:57,230 INFO L226 Difference]: Without dead ends: 1488 [2019-11-28 18:30:57,230 INFO L630 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-11-28 18:30:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-11-28 18:30:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1171. [2019-11-28 18:30:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2019-11-28 18:30:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 2513 transitions. [2019-11-28 18:30:57,252 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 2513 transitions. Word has length 50 [2019-11-28 18:30:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:57,253 INFO L462 AbstractCegarLoop]: Abstraction has 1171 states and 2513 transitions. [2019-11-28 18:30:57,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:30:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 2513 transitions. [2019-11-28 18:30:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:30:57,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:57,256 INFO L410 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-11-28 18:30:57,256 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:57,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:57,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2032930801, now seen corresponding path program 1 times [2019-11-28 18:30:57,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:57,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020636654] [2019-11-28 18:30:57,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:57,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020636654] [2019-11-28 18:30:57,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:57,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:30:57,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465776658] [2019-11-28 18:30:57,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:30:57,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:57,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:30:57,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:30:57,387 INFO L87 Difference]: Start difference. First operand 1171 states and 2513 transitions. Second operand 6 states. [2019-11-28 18:30:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:57,833 INFO L93 Difference]: Finished difference Result 1382 states and 2902 transitions. [2019-11-28 18:30:57,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:30:57,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-28 18:30:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:57,837 INFO L225 Difference]: With dead ends: 1382 [2019-11-28 18:30:57,837 INFO L226 Difference]: Without dead ends: 1382 [2019-11-28 18:30:57,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:30:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-11-28 18:30:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1153. [2019-11-28 18:30:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-11-28 18:30:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 2474 transitions. [2019-11-28 18:30:57,861 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 2474 transitions. Word has length 51 [2019-11-28 18:30:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:57,862 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 2474 transitions. [2019-11-28 18:30:57,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:30:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 2474 transitions. [2019-11-28 18:30:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:30:57,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:57,866 INFO L410 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-11-28 18:30:57,866 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:57,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1871822573, now seen corresponding path program 2 times [2019-11-28 18:30:57,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:57,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602999069] [2019-11-28 18:30:57,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:57,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602999069] [2019-11-28 18:30:57,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:57,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:30:57,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057020337] [2019-11-28 18:30:57,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:30:57,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:57,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:30:57,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:30:57,949 INFO L87 Difference]: Start difference. First operand 1153 states and 2474 transitions. Second operand 3 states. [2019-11-28 18:30:57,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:57,965 INFO L93 Difference]: Finished difference Result 1152 states and 2472 transitions. [2019-11-28 18:30:57,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:30:57,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:30:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:57,968 INFO L225 Difference]: With dead ends: 1152 [2019-11-28 18:30:57,968 INFO L226 Difference]: Without dead ends: 1152 [2019-11-28 18:30:57,969 INFO L630 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-11-28 18:30:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-11-28 18:30:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 956. [2019-11-28 18:30:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-28 18:30:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2092 transitions. [2019-11-28 18:30:57,990 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2092 transitions. Word has length 51 [2019-11-28 18:30:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:57,990 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2092 transitions. [2019-11-28 18:30:57,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:30:57,991 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2092 transitions. [2019-11-28 18:30:57,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:57,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:57,994 INFO L410 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-11-28 18:30:57,994 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:57,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:57,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-11-28 18:30:57,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:57,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843188583] [2019-11-28 18:30:57,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:58,455 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2019-11-28 18:30:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:58,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843188583] [2019-11-28 18:30:58,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:58,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:30:58,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653357568] [2019-11-28 18:30:58,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 18:30:58,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 18:30:58,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:30:58,482 INFO L87 Difference]: Start difference. First operand 956 states and 2092 transitions. Second operand 11 states. [2019-11-28 18:30:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:59,223 INFO L93 Difference]: Finished difference Result 2426 states and 5230 transitions. [2019-11-28 18:30:59,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:30:59,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-11-28 18:30:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:59,226 INFO L225 Difference]: With dead ends: 2426 [2019-11-28 18:30:59,226 INFO L226 Difference]: Without dead ends: 759 [2019-11-28 18:30:59,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:30:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-11-28 18:30:59,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2019-11-28 18:30:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-11-28 18:30:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1666 transitions. [2019-11-28 18:30:59,239 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1666 transitions. Word has length 52 [2019-11-28 18:30:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:59,240 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1666 transitions. [2019-11-28 18:30:59,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 18:30:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1666 transitions. [2019-11-28 18:30:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:59,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:59,242 INFO L410 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-11-28 18:30:59,242 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:59,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:59,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 2 times [2019-11-28 18:30:59,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:59,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367171529] [2019-11-28 18:30:59,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:59,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367171529] [2019-11-28 18:30:59,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:59,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:30:59,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755901180] [2019-11-28 18:30:59,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:30:59,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:59,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:30:59,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:30:59,609 INFO L87 Difference]: Start difference. First operand 759 states and 1666 transitions. Second operand 13 states. [2019-11-28 18:31:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:31:01,085 INFO L93 Difference]: Finished difference Result 1086 states and 2309 transitions. [2019-11-28 18:31:01,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 18:31:01,085 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-11-28 18:31:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:31:01,087 INFO L225 Difference]: With dead ends: 1086 [2019-11-28 18:31:01,087 INFO L226 Difference]: Without dead ends: 865 [2019-11-28 18:31:01,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2019-11-28 18:31:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-11-28 18:31:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 790. [2019-11-28 18:31:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 18:31:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1740 transitions. [2019-11-28 18:31:01,100 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1740 transitions. Word has length 52 [2019-11-28 18:31:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:31:01,100 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1740 transitions. [2019-11-28 18:31:01,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:31:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1740 transitions. [2019-11-28 18:31:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:31:01,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:31:01,102 INFO L410 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-11-28 18:31:01,102 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:31:01,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:31:01,103 INFO L82 PathProgramCache]: Analyzing trace with hash 925896582, now seen corresponding path program 3 times [2019-11-28 18:31:01,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:31:01,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881594717] [2019-11-28 18:31:01,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:31:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:31:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:31:01,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881594717] [2019-11-28 18:31:01,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:31:01,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:31:01,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587579038] [2019-11-28 18:31:01,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:31:01,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:31:01,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:31:01,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:31:01,200 INFO L87 Difference]: Start difference. First operand 790 states and 1740 transitions. Second operand 7 states. [2019-11-28 18:31:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:31:01,382 INFO L93 Difference]: Finished difference Result 1290 states and 2749 transitions. [2019-11-28 18:31:01,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:31:01,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:31:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:31:01,385 INFO L225 Difference]: With dead ends: 1290 [2019-11-28 18:31:01,385 INFO L226 Difference]: Without dead ends: 919 [2019-11-28 18:31:01,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:31:01,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-11-28 18:31:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 754. [2019-11-28 18:31:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-11-28 18:31:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-11-28 18:31:01,399 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 52 [2019-11-28 18:31:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:31:01,400 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-11-28 18:31:01,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:31:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-11-28 18:31:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:31:01,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:31:01,402 INFO L410 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-11-28 18:31:01,402 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:31:01,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:31:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 4 times [2019-11-28 18:31:01,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:31:01,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48217743] [2019-11-28 18:31:01,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:31:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:31:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:31:01,564 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:31:01,566 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:31:01,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2313~0.base_48|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2313~0.base_48|) 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2313~0.base_48| 4)) (= v_~y$r_buff1_thd0~0_129 0) (= |v_ULTIMATE.start_main_~#t2313~0.offset_31| 0) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2313~0.base_48| 1)) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2313~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2313~0.base_48|) |v_ULTIMATE.start_main_~#t2313~0.offset_31| 0))) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2314~0.base=|v_ULTIMATE.start_main_~#t2314~0.base_49|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2313~0.offset=|v_ULTIMATE.start_main_~#t2313~0.offset_31|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ULTIMATE.start_main_~#t2313~0.base=|v_ULTIMATE.start_main_~#t2313~0.base_48|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t2314~0.offset=|v_ULTIMATE.start_main_~#t2314~0.offset_31|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2314~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2313~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t2313~0.base, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2314~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:31:01,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_ULTIMATE.start_main_~#t2314~0.offset_11| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2314~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2314~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2314~0.base_13| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2314~0.base_13| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2314~0.base_13| 4) |v_#length_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2314~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2314~0.base_13|) |v_ULTIMATE.start_main_~#t2314~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2314~0.base=|v_ULTIMATE.start_main_~#t2314~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2314~0.offset=|v_ULTIMATE.start_main_~#t2314~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2314~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2314~0.offset] because there is no mapped edge [2019-11-28 18:31:01,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd0~0_Out-272237098 ~y$r_buff0_thd0~0_In-272237098) (= ~y$r_buff1_thd2~0_Out-272237098 ~y$r_buff0_thd2~0_In-272237098) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-272237098 0)) (= ~y$r_buff0_thd1~0_In-272237098 ~y$r_buff1_thd1~0_Out-272237098) (= ~x~0_Out-272237098 1) (= ~y$r_buff0_thd1~0_Out-272237098 1)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-272237098, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-272237098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-272237098, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-272237098} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-272237098, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-272237098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-272237098, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-272237098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-272237098, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-272237098, ~x~0=~x~0_Out-272237098, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-272237098} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:31:01,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In695162823 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In695162823 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out695162823|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In695162823 |P0Thread1of1ForFork0_#t~ite5_Out695162823|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In695162823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In695162823} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out695162823|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In695162823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In695162823} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:31:01,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1569152245 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1569152245 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1569152245 256)) (and (= (mod ~y$r_buff1_thd2~0_In-1569152245 256) 0) .cse0) (and (= (mod ~y$w_buff1_used~0_In-1569152245 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1569152245| |P1Thread1of1ForFork1_#t~ite20_Out-1569152245|) .cse1 (= ~y$w_buff0_used~0_In-1569152245 |P1Thread1of1ForFork1_#t~ite20_Out-1569152245|)) (and (= ~y$w_buff0_used~0_In-1569152245 |P1Thread1of1ForFork1_#t~ite21_Out-1569152245|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In-1569152245| |P1Thread1of1ForFork1_#t~ite20_Out-1569152245|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1569152245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1569152245, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1569152245|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1569152245, ~weak$$choice2~0=~weak$$choice2~0_In-1569152245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1569152245} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1569152245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1569152245, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1569152245|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1569152245, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1569152245|, ~weak$$choice2~0=~weak$$choice2~0_In-1569152245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1569152245} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:31:01,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse4 (= 0 (mod ~y$r_buff1_thd2~0_In-482708997 256))) (.cse5 (= (mod ~y$w_buff1_used~0_In-482708997 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-482708997 256))) (.cse0 (= (mod ~weak$$choice2~0_In-482708997 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out-482708997| |P1Thread1of1ForFork1_#t~ite24_Out-482708997|)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-482708997 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-482708997| |P1Thread1of1ForFork1_#t~ite22_Out-482708997|) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-482708997| ~y$w_buff1_used~0_In-482708997) (= |P1Thread1of1ForFork1_#t~ite23_Out-482708997| |P1Thread1of1ForFork1_#t~ite23_In-482708997|) (not .cse0)) (and .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out-482708997| ~y$w_buff1_used~0_In-482708997) (or .cse2 (and .cse3 .cse4) (and .cse5 .cse3))))) (let ((.cse6 (not .cse3))) (and (or (not .cse4) .cse6) (= |P1Thread1of1ForFork1_#t~ite22_Out-482708997| 0) (or (not .cse5) .cse6) (= |P1Thread1of1ForFork1_#t~ite22_Out-482708997| |P1Thread1of1ForFork1_#t~ite23_Out-482708997|) (not .cse2) .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-482708997, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-482708997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-482708997, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-482708997|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-482708997|, ~weak$$choice2~0=~weak$$choice2~0_In-482708997, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-482708997} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-482708997, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-482708997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-482708997, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-482708997|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-482708997|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-482708997|, ~weak$$choice2~0=~weak$$choice2~0_In-482708997, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-482708997} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:31:01,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2122294837 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In2122294837 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2122294837 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In2122294837 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2122294837 |P0Thread1of1ForFork0_#t~ite6_Out2122294837|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out2122294837|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2122294837, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2122294837, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2122294837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2122294837} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2122294837|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2122294837, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2122294837, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2122294837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2122294837} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:31:01,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In-389628928 ~y$r_buff0_thd1~0_Out-389628928)) (.cse2 (= (mod ~y$w_buff0_used~0_In-389628928 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-389628928 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse2) (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-389628928)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-389628928, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-389628928} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-389628928, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-389628928|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-389628928} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:31:01,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1527975793 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1527975793 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1527975793 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1527975793 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1527975793|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In1527975793 |P0Thread1of1ForFork0_#t~ite8_Out1527975793|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1527975793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1527975793, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1527975793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527975793} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1527975793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1527975793, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1527975793|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1527975793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527975793} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:31:01,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:31:01,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1058657 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1058657| |P1Thread1of1ForFork1_#t~ite29_Out-1058657|) (= |P1Thread1of1ForFork1_#t~ite30_Out-1058657| ~y$r_buff1_thd2~0_In-1058657)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1058657| ~y$r_buff1_thd2~0_In-1058657) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1058657 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1058657 256)) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1058657 256))) (= (mod ~y$w_buff0_used~0_In-1058657 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1058657| |P1Thread1of1ForFork1_#t~ite30_Out-1058657|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1058657, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1058657|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1058657, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1058657, ~weak$$choice2~0=~weak$$choice2~0_In-1058657, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1058657} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1058657, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1058657|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1058657|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1058657, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1058657, ~weak$$choice2~0=~weak$$choice2~0_In-1058657, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1058657} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:31:01,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:31:01,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In558347552 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In558347552 256)))) (or (and (= ~y~0_In558347552 |P1Thread1of1ForFork1_#t~ite32_Out558347552|) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In558347552 |P1Thread1of1ForFork1_#t~ite32_Out558347552|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In558347552, ~y$w_buff1~0=~y$w_buff1~0_In558347552, ~y~0=~y~0_In558347552, ~y$w_buff1_used~0=~y$w_buff1_used~0_In558347552} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In558347552, ~y$w_buff1~0=~y$w_buff1~0_In558347552, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out558347552|, ~y~0=~y~0_In558347552, ~y$w_buff1_used~0=~y$w_buff1_used~0_In558347552} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:31:01,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |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_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:31:01,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1245840492 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1245840492 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1245840492| ~y$w_buff0_used~0_In-1245840492) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1245840492| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245840492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245840492} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245840492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245840492, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1245840492|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:31:01,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1563107477 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1563107477 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1563107477 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1563107477 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1563107477 |P1Thread1of1ForFork1_#t~ite35_Out1563107477|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1563107477|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563107477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563107477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563107477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563107477} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563107477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563107477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563107477, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1563107477|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563107477} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:31:01,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1626204538 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1626204538 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1626204538|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In1626204538 |P1Thread1of1ForFork1_#t~ite36_Out1626204538|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1626204538, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1626204538} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1626204538, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1626204538, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1626204538|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:31:01,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1528802792 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1528802792 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1528802792 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1528802792 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1528802792 |P1Thread1of1ForFork1_#t~ite37_Out1528802792|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1528802792|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1528802792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1528802792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1528802792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1528802792} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1528802792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1528802792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1528802792, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1528802792|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1528802792} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:31:01,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:31:01,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:31:01,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:31:01,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1588975532 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1588975532 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1588975532| ~y$w_buff1~0_In-1588975532)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1588975532| ~y~0_In-1588975532)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1588975532, ~y~0=~y~0_In-1588975532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1588975532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1588975532} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1588975532|, ~y$w_buff1~0=~y$w_buff1~0_In-1588975532, ~y~0=~y~0_In-1588975532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1588975532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1588975532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:31:01,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:31:01,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1884597006 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1884597006 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out1884597006|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1884597006 |ULTIMATE.start_main_#t~ite42_Out1884597006|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1884597006, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1884597006} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1884597006, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1884597006, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1884597006|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:31:01,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In305112639 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In305112639 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In305112639 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In305112639 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out305112639| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite43_Out305112639| ~y$w_buff1_used~0_In305112639) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In305112639, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In305112639, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In305112639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In305112639} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In305112639, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In305112639, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out305112639|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In305112639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In305112639} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:31:01,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1410382642 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1410382642 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1410382642| ~y$r_buff0_thd0~0_In1410382642) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1410382642| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1410382642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1410382642} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1410382642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1410382642, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1410382642|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:31:01,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1026067028 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1026067028 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1026067028 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1026067028 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1026067028| ~y$r_buff1_thd0~0_In-1026067028) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1026067028|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026067028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1026067028, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1026067028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1026067028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026067028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1026067028, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1026067028, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1026067028|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1026067028} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:31:01,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_17 0) (= 1 v_~__unbuffered_p1_EAX~0_21))) 1 0)) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:31:01,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:31:01 BasicIcfg [2019-11-28 18:31:01,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:31:01,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:31:01,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:31:01,665 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:31:01,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:30:44" (3/4) ... [2019-11-28 18:31:01,668 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:31:01,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2313~0.base_48|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2313~0.base_48|) 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2313~0.base_48| 4)) (= v_~y$r_buff1_thd0~0_129 0) (= |v_ULTIMATE.start_main_~#t2313~0.offset_31| 0) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2313~0.base_48| 1)) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2313~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2313~0.base_48|) |v_ULTIMATE.start_main_~#t2313~0.offset_31| 0))) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2314~0.base=|v_ULTIMATE.start_main_~#t2314~0.base_49|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2313~0.offset=|v_ULTIMATE.start_main_~#t2313~0.offset_31|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ULTIMATE.start_main_~#t2313~0.base=|v_ULTIMATE.start_main_~#t2313~0.base_48|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t2314~0.offset=|v_ULTIMATE.start_main_~#t2314~0.offset_31|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2314~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2313~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t2313~0.base, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2314~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:31:01,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_ULTIMATE.start_main_~#t2314~0.offset_11| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2314~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2314~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2314~0.base_13| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2314~0.base_13| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2314~0.base_13| 4) |v_#length_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2314~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2314~0.base_13|) |v_ULTIMATE.start_main_~#t2314~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2314~0.base=|v_ULTIMATE.start_main_~#t2314~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2314~0.offset=|v_ULTIMATE.start_main_~#t2314~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2314~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2314~0.offset] because there is no mapped edge [2019-11-28 18:31:01,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd0~0_Out-272237098 ~y$r_buff0_thd0~0_In-272237098) (= ~y$r_buff1_thd2~0_Out-272237098 ~y$r_buff0_thd2~0_In-272237098) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-272237098 0)) (= ~y$r_buff0_thd1~0_In-272237098 ~y$r_buff1_thd1~0_Out-272237098) (= ~x~0_Out-272237098 1) (= ~y$r_buff0_thd1~0_Out-272237098 1)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-272237098, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-272237098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-272237098, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-272237098} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-272237098, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-272237098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-272237098, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-272237098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-272237098, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-272237098, ~x~0=~x~0_Out-272237098, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-272237098} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:31:01,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In695162823 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In695162823 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out695162823|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In695162823 |P0Thread1of1ForFork0_#t~ite5_Out695162823|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In695162823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In695162823} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out695162823|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In695162823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In695162823} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:31:01,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1569152245 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1569152245 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1569152245 256)) (and (= (mod ~y$r_buff1_thd2~0_In-1569152245 256) 0) .cse0) (and (= (mod ~y$w_buff1_used~0_In-1569152245 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1569152245| |P1Thread1of1ForFork1_#t~ite20_Out-1569152245|) .cse1 (= ~y$w_buff0_used~0_In-1569152245 |P1Thread1of1ForFork1_#t~ite20_Out-1569152245|)) (and (= ~y$w_buff0_used~0_In-1569152245 |P1Thread1of1ForFork1_#t~ite21_Out-1569152245|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In-1569152245| |P1Thread1of1ForFork1_#t~ite20_Out-1569152245|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1569152245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1569152245, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1569152245|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1569152245, ~weak$$choice2~0=~weak$$choice2~0_In-1569152245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1569152245} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1569152245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1569152245, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1569152245|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1569152245, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1569152245|, ~weak$$choice2~0=~weak$$choice2~0_In-1569152245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1569152245} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:31:01,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse4 (= 0 (mod ~y$r_buff1_thd2~0_In-482708997 256))) (.cse5 (= (mod ~y$w_buff1_used~0_In-482708997 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-482708997 256))) (.cse0 (= (mod ~weak$$choice2~0_In-482708997 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out-482708997| |P1Thread1of1ForFork1_#t~ite24_Out-482708997|)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-482708997 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-482708997| |P1Thread1of1ForFork1_#t~ite22_Out-482708997|) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-482708997| ~y$w_buff1_used~0_In-482708997) (= |P1Thread1of1ForFork1_#t~ite23_Out-482708997| |P1Thread1of1ForFork1_#t~ite23_In-482708997|) (not .cse0)) (and .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out-482708997| ~y$w_buff1_used~0_In-482708997) (or .cse2 (and .cse3 .cse4) (and .cse5 .cse3))))) (let ((.cse6 (not .cse3))) (and (or (not .cse4) .cse6) (= |P1Thread1of1ForFork1_#t~ite22_Out-482708997| 0) (or (not .cse5) .cse6) (= |P1Thread1of1ForFork1_#t~ite22_Out-482708997| |P1Thread1of1ForFork1_#t~ite23_Out-482708997|) (not .cse2) .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-482708997, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-482708997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-482708997, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-482708997|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-482708997|, ~weak$$choice2~0=~weak$$choice2~0_In-482708997, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-482708997} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-482708997, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-482708997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-482708997, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-482708997|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-482708997|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-482708997|, ~weak$$choice2~0=~weak$$choice2~0_In-482708997, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-482708997} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:31:01,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2122294837 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In2122294837 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2122294837 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In2122294837 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2122294837 |P0Thread1of1ForFork0_#t~ite6_Out2122294837|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out2122294837|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2122294837, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2122294837, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2122294837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2122294837} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2122294837|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2122294837, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2122294837, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2122294837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2122294837} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:31:01,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In-389628928 ~y$r_buff0_thd1~0_Out-389628928)) (.cse2 (= (mod ~y$w_buff0_used~0_In-389628928 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-389628928 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse2) (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-389628928)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-389628928, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-389628928} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-389628928, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-389628928|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-389628928} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:31:01,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1527975793 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1527975793 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1527975793 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1527975793 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1527975793|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In1527975793 |P0Thread1of1ForFork0_#t~ite8_Out1527975793|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1527975793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1527975793, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1527975793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527975793} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1527975793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1527975793, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1527975793|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1527975793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527975793} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:31:01,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:31:01,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1058657 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1058657| |P1Thread1of1ForFork1_#t~ite29_Out-1058657|) (= |P1Thread1of1ForFork1_#t~ite30_Out-1058657| ~y$r_buff1_thd2~0_In-1058657)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1058657| ~y$r_buff1_thd2~0_In-1058657) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1058657 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1058657 256)) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1058657 256))) (= (mod ~y$w_buff0_used~0_In-1058657 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1058657| |P1Thread1of1ForFork1_#t~ite30_Out-1058657|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1058657, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1058657|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1058657, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1058657, ~weak$$choice2~0=~weak$$choice2~0_In-1058657, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1058657} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1058657, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1058657|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1058657|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1058657, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1058657, ~weak$$choice2~0=~weak$$choice2~0_In-1058657, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1058657} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:31:01,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:31:01,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In558347552 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In558347552 256)))) (or (and (= ~y~0_In558347552 |P1Thread1of1ForFork1_#t~ite32_Out558347552|) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In558347552 |P1Thread1of1ForFork1_#t~ite32_Out558347552|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In558347552, ~y$w_buff1~0=~y$w_buff1~0_In558347552, ~y~0=~y~0_In558347552, ~y$w_buff1_used~0=~y$w_buff1_used~0_In558347552} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In558347552, ~y$w_buff1~0=~y$w_buff1~0_In558347552, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out558347552|, ~y~0=~y~0_In558347552, ~y$w_buff1_used~0=~y$w_buff1_used~0_In558347552} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:31:01,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |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_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:31:01,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1245840492 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1245840492 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1245840492| ~y$w_buff0_used~0_In-1245840492) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1245840492| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245840492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245840492} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245840492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245840492, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1245840492|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:31:01,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1563107477 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1563107477 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1563107477 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1563107477 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1563107477 |P1Thread1of1ForFork1_#t~ite35_Out1563107477|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1563107477|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563107477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563107477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563107477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563107477} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563107477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563107477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563107477, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1563107477|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563107477} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:31:01,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1626204538 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1626204538 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1626204538|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In1626204538 |P1Thread1of1ForFork1_#t~ite36_Out1626204538|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1626204538, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1626204538} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1626204538, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1626204538, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1626204538|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:31:01,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1528802792 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1528802792 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1528802792 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1528802792 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1528802792 |P1Thread1of1ForFork1_#t~ite37_Out1528802792|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1528802792|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1528802792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1528802792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1528802792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1528802792} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1528802792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1528802792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1528802792, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1528802792|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1528802792} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:31:01,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:31:01,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:31:01,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:31:01,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1588975532 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1588975532 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1588975532| ~y$w_buff1~0_In-1588975532)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1588975532| ~y~0_In-1588975532)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1588975532, ~y~0=~y~0_In-1588975532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1588975532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1588975532} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1588975532|, ~y$w_buff1~0=~y$w_buff1~0_In-1588975532, ~y~0=~y~0_In-1588975532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1588975532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1588975532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:31:01,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:31:01,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1884597006 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1884597006 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out1884597006|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1884597006 |ULTIMATE.start_main_#t~ite42_Out1884597006|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1884597006, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1884597006} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1884597006, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1884597006, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1884597006|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:31:01,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In305112639 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In305112639 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In305112639 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In305112639 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out305112639| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite43_Out305112639| ~y$w_buff1_used~0_In305112639) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In305112639, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In305112639, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In305112639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In305112639} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In305112639, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In305112639, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out305112639|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In305112639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In305112639} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:31:01,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1410382642 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1410382642 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1410382642| ~y$r_buff0_thd0~0_In1410382642) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1410382642| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1410382642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1410382642} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1410382642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1410382642, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1410382642|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:31:01,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1026067028 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1026067028 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1026067028 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1026067028 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1026067028| ~y$r_buff1_thd0~0_In-1026067028) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1026067028|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026067028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1026067028, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1026067028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1026067028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026067028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1026067028, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1026067028, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1026067028|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1026067028} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:31:01,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_17 0) (= 1 v_~__unbuffered_p1_EAX~0_21))) 1 0)) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:31:01,755 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:31:01,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:31:01,758 INFO L168 Benchmark]: Toolchain (without parser) took 18901.84 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 549.5 MB). Free memory was 955.0 MB in the beginning and 944.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 560.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:31:01,758 INFO L168 Benchmark]: CDTParser took 1.09 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:31:01,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:31:01,760 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:31:01,760 INFO L168 Benchmark]: Boogie Preprocessor took 44.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:31:01,761 INFO L168 Benchmark]: RCFGBuilder took 754.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:31:01,762 INFO L168 Benchmark]: TraceAbstraction took 17143.86 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 407.4 MB). Free memory was 1.0 GB in the beginning and 969.5 MB in the end (delta: 78.2 MB). Peak memory consumption was 485.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:31:01,762 INFO L168 Benchmark]: Witness Printer took 91.84 ms. Allocated memory is still 1.6 GB. Free memory was 969.5 MB in the beginning and 944.2 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:31:01,765 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 777.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 754.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17143.86 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 407.4 MB). Free memory was 1.0 GB in the beginning and 969.5 MB in the end (delta: 78.2 MB). Peak memory consumption was 485.6 MB. Max. memory is 11.5 GB. * Witness Printer took 91.84 ms. Allocated memory is still 1.6 GB. Free memory was 969.5 MB in the beginning and 944.2 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2313, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2314, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1843 SDtfs, 2430 SDslu, 4440 SDs, 0 SdLazy, 3376 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 19 SyntacticMatches, 12 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16180occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 6877 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 80285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...