./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer --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 bebf2e800959dd87191c01f9bf178b468f23daf8 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-12-07 18:41:01,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:41:01,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:41:01,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:41:01,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:41:01,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:41:01,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:41:01,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:41:01,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:41:01,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:41:01,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:41:01,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:41:01,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:41:01,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:41:01,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:41:01,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:41:01,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:41:01,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:41:01,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:41:01,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:41:01,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:41:01,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:41:01,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:41:01,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:41:01,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:41:01,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:41:01,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:41:01,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:41:01,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:41:01,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:41:01,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:41:01,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:41:01,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:41:01,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:41:01,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:41:01,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:41:01,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:41:01,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:41:01,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:41:01,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:41:01,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:41:01,685 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:41:01,697 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:41:01,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:41:01,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:41:01,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:41:01,698 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:41:01,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:41:01,699 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:41:01,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:41:01,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:41:01,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:41:01,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:41:01,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:41:01,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:41:01,700 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:41:01,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:41:01,700 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:41:01,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:41:01,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:41:01,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:41:01,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:41:01,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:41:01,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:41:01,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:41:01,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:41:01,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:41:01,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:41:01,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:41:01,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:41:01,702 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:41:01,702 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer 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 -> bebf2e800959dd87191c01f9bf178b468f23daf8 [2019-12-07 18:41:01,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:41:01,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:41:01,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:41:01,824 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:41:01,824 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:41:01,825 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.opt.i [2019-12-07 18:41:01,862 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer/data/757d10d90/bb3086a0700949d191be7a83ff233a88/FLAG1bfa180b1 [2019-12-07 18:41:02,314 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:41:02,314 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/sv-benchmarks/c/pthread-wmm/rfi007_rmo.opt.i [2019-12-07 18:41:02,327 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer/data/757d10d90/bb3086a0700949d191be7a83ff233a88/FLAG1bfa180b1 [2019-12-07 18:41:02,335 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer/data/757d10d90/bb3086a0700949d191be7a83ff233a88 [2019-12-07 18:41:02,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:41:02,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:41:02,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:41:02,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:41:02,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:41:02,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:41:02" (1/1) ... [2019-12-07 18:41:02,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02, skipping insertion in model container [2019-12-07 18:41:02,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:41:02" (1/1) ... [2019-12-07 18:41:02,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:41:02,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:41:02,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:41:02,629 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:41:02,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:41:02,717 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:41:02,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02 WrapperNode [2019-12-07 18:41:02,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:41:02,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:41:02,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:41:02,718 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:41:02,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02" (1/1) ... [2019-12-07 18:41:02,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02" (1/1) ... [2019-12-07 18:41:02,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:41:02,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:41:02,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:41:02,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:41:02,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02" (1/1) ... [2019-12-07 18:41:02,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02" (1/1) ... [2019-12-07 18:41:02,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02" (1/1) ... [2019-12-07 18:41:02,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02" (1/1) ... [2019-12-07 18:41:02,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02" (1/1) ... [2019-12-07 18:41:02,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02" (1/1) ... [2019-12-07 18:41:02,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02" (1/1) ... [2019-12-07 18:41:02,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:41:02,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:41:02,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:41:02,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:41:02,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:41:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:41:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:41:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:41:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:41:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:41:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:41:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:41:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:41:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:41:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:41:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:41:02,858 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:41:03,188 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:41:03,188 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:41:03,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:41:03 BoogieIcfgContainer [2019-12-07 18:41:03,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:41:03,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:41:03,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:41:03,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:41:03,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:41:02" (1/3) ... [2019-12-07 18:41:03,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e09d2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:41:03, skipping insertion in model container [2019-12-07 18:41:03,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:41:02" (2/3) ... [2019-12-07 18:41:03,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e09d2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:41:03, skipping insertion in model container [2019-12-07 18:41:03,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:41:03" (3/3) ... [2019-12-07 18:41:03,193 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.opt.i [2019-12-07 18:41:03,199 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:41:03,199 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:41:03,204 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:41:03,204 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:41:03,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,228 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,228 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,232 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,232 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:41:03,254 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 18:41:03,267 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:41:03,267 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:41:03,267 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:41:03,267 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:41:03,267 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:41:03,267 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:41:03,267 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:41:03,267 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:41:03,277 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 18:41:03,279 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 18:41:03,327 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 18:41:03,327 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:41:03,335 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 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 18:41:03,346 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 18:41:03,371 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 18:41:03,372 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:41:03,375 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 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 18:41:03,385 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 18:41:03,386 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:41:05,977 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 18:41:06,290 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-07 18:41:06,290 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-07 18:41:06,292 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-07 18:41:06,678 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-07 18:41:06,680 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-07 18:41:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 18:41:06,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:06,685 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 18:41:06,686 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:06,691 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-07 18:41:06,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:06,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937685742] [2019-12-07 18:41:06,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:06,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937685742] [2019-12-07 18:41:06,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:06,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:41:06,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505388638] [2019-12-07 18:41:06,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:41:06,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:06,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:41:06,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:41:06,888 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-07 18:41:07,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:07,105 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-07 18:41:07,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:41:07,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 18:41:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:07,181 INFO L225 Difference]: With dead ends: 9266 [2019-12-07 18:41:07,181 INFO L226 Difference]: Without dead ends: 8258 [2019-12-07 18:41:07,182 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-12-07 18:41:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-07 18:41:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-07 18:41:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-07 18:41:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-07 18:41:07,507 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-07 18:41:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:07,508 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-07 18:41:07,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:41:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-07 18:41:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:41:07,512 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:07,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:07,512 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:07,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:07,513 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-07 18:41:07,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:07,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982074443] [2019-12-07 18:41:07,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:07,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982074443] [2019-12-07 18:41:07,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:07,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:41:07,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480399929] [2019-12-07 18:41:07,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:41:07,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:07,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:41:07,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:07,603 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-07 18:41:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:07,866 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-12-07 18:41:07,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:41:07,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:41:07,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:07,927 INFO L225 Difference]: With dead ends: 12603 [2019-12-07 18:41:07,927 INFO L226 Difference]: Without dead ends: 12589 [2019-12-07 18:41:07,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-12-07 18:41:08,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-12-07 18:41:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-12-07 18:41:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-12-07 18:41:08,215 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-12-07 18:41:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:08,216 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-12-07 18:41:08,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:41:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-12-07 18:41:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:41:08,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:08,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:08,221 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:08,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:08,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-07 18:41:08,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:08,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801855027] [2019-12-07 18:41:08,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:08,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801855027] [2019-12-07 18:41:08,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:08,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:41:08,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055256378] [2019-12-07 18:41:08,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:41:08,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:08,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:41:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:08,274 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-12-07 18:41:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:08,445 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-12-07 18:41:08,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:41:08,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:41:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:08,473 INFO L225 Difference]: With dead ends: 13736 [2019-12-07 18:41:08,474 INFO L226 Difference]: Without dead ends: 13736 [2019-12-07 18:41:08,474 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-12-07 18:41:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-12-07 18:41:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-12-07 18:41:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-12-07 18:41:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-12-07 18:41:08,763 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-12-07 18:41:08,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:08,764 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-12-07 18:41:08,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:41:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-12-07 18:41:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:41:08,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:08,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:08,767 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:08,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:08,767 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-12-07 18:41:08,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:08,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427457310] [2019-12-07 18:41:08,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:08,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427457310] [2019-12-07 18:41:08,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:08,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:41:08,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754379478] [2019-12-07 18:41:08,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:41:08,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:08,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:41:08,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:41:08,815 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-12-07 18:41:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:08,850 INFO L93 Difference]: Finished difference Result 11576 states and 35711 transitions. [2019-12-07 18:41:08,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:41:08,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:41:08,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:08,866 INFO L225 Difference]: With dead ends: 11576 [2019-12-07 18:41:08,866 INFO L226 Difference]: Without dead ends: 11576 [2019-12-07 18:41:08,866 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-12-07 18:41:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11576 states. [2019-12-07 18:41:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11576 to 11496. [2019-12-07 18:41:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11496 states. [2019-12-07 18:41:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11496 states to 11496 states and 35479 transitions. [2019-12-07 18:41:09,045 INFO L78 Accepts]: Start accepts. Automaton has 11496 states and 35479 transitions. Word has length 16 [2019-12-07 18:41:09,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:09,045 INFO L462 AbstractCegarLoop]: Abstraction has 11496 states and 35479 transitions. [2019-12-07 18:41:09,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:41:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 11496 states and 35479 transitions. [2019-12-07 18:41:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:41:09,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:09,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:09,048 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:09,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1184696536, now seen corresponding path program 1 times [2019-12-07 18:41:09,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:09,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173309140] [2019-12-07 18:41:09,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:09,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173309140] [2019-12-07 18:41:09,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:09,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:41:09,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001835051] [2019-12-07 18:41:09,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:41:09,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:09,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:41:09,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:41:09,105 INFO L87 Difference]: Start difference. First operand 11496 states and 35479 transitions. Second operand 3 states. [2019-12-07 18:41:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:09,159 INFO L93 Difference]: Finished difference Result 19925 states and 60894 transitions. [2019-12-07 18:41:09,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:41:09,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:41:09,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:09,184 INFO L225 Difference]: With dead ends: 19925 [2019-12-07 18:41:09,184 INFO L226 Difference]: Without dead ends: 17497 [2019-12-07 18:41:09,184 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-12-07 18:41:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17497 states. [2019-12-07 18:41:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17497 to 16697. [2019-12-07 18:41:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16697 states. [2019-12-07 18:41:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16697 states to 16697 states and 51504 transitions. [2019-12-07 18:41:09,483 INFO L78 Accepts]: Start accepts. Automaton has 16697 states and 51504 transitions. Word has length 16 [2019-12-07 18:41:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:09,484 INFO L462 AbstractCegarLoop]: Abstraction has 16697 states and 51504 transitions. [2019-12-07 18:41:09,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:41:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 16697 states and 51504 transitions. [2019-12-07 18:41:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:41:09,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:09,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:09,488 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:09,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1923749814, now seen corresponding path program 1 times [2019-12-07 18:41:09,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:09,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886655808] [2019-12-07 18:41:09,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:09,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886655808] [2019-12-07 18:41:09,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:09,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:41:09,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462390030] [2019-12-07 18:41:09,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:41:09,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:09,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:41:09,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:09,534 INFO L87 Difference]: Start difference. First operand 16697 states and 51504 transitions. Second operand 4 states. [2019-12-07 18:41:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:09,559 INFO L93 Difference]: Finished difference Result 3027 states and 7631 transitions. [2019-12-07 18:41:09,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:41:09,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 18:41:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:09,562 INFO L225 Difference]: With dead ends: 3027 [2019-12-07 18:41:09,562 INFO L226 Difference]: Without dead ends: 2101 [2019-12-07 18:41:09,562 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-12-07 18:41:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2019-12-07 18:41:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2101. [2019-12-07 18:41:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-07 18:41:09,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 4686 transitions. [2019-12-07 18:41:09,584 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 4686 transitions. Word has length 17 [2019-12-07 18:41:09,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:09,584 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 4686 transitions. [2019-12-07 18:41:09,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:41:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 4686 transitions. [2019-12-07 18:41:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:41:09,586 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:09,586 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] [2019-12-07 18:41:09,586 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:09,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:09,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-07 18:41:09,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:09,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902843480] [2019-12-07 18:41:09,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:09,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902843480] [2019-12-07 18:41:09,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:09,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:41:09,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902850904] [2019-12-07 18:41:09,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:41:09,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:09,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:41:09,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:41:09,658 INFO L87 Difference]: Start difference. First operand 2101 states and 4686 transitions. Second operand 6 states. [2019-12-07 18:41:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:09,998 INFO L93 Difference]: Finished difference Result 5510 states and 12155 transitions. [2019-12-07 18:41:09,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:41:09,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 18:41:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:10,004 INFO L225 Difference]: With dead ends: 5510 [2019-12-07 18:41:10,004 INFO L226 Difference]: Without dead ends: 5475 [2019-12-07 18:41:10,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:41:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2019-12-07 18:41:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 2768. [2019-12-07 18:41:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2768 states. [2019-12-07 18:41:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 6308 transitions. [2019-12-07 18:41:10,038 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 6308 transitions. Word has length 25 [2019-12-07 18:41:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:10,039 INFO L462 AbstractCegarLoop]: Abstraction has 2768 states and 6308 transitions. [2019-12-07 18:41:10,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:41:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 6308 transitions. [2019-12-07 18:41:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:41:10,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:10,041 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] [2019-12-07 18:41:10,041 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:10,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:10,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-07 18:41:10,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:10,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865728485] [2019-12-07 18:41:10,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:10,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865728485] [2019-12-07 18:41:10,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:10,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:41:10,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025808007] [2019-12-07 18:41:10,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:41:10,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:10,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:41:10,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:41:10,102 INFO L87 Difference]: Start difference. First operand 2768 states and 6308 transitions. Second operand 6 states. [2019-12-07 18:41:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:10,438 INFO L93 Difference]: Finished difference Result 5148 states and 11236 transitions. [2019-12-07 18:41:10,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:41:10,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 18:41:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:10,442 INFO L225 Difference]: With dead ends: 5148 [2019-12-07 18:41:10,442 INFO L226 Difference]: Without dead ends: 5119 [2019-12-07 18:41:10,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:41:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-12-07 18:41:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 2810. [2019-12-07 18:41:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-07 18:41:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6417 transitions. [2019-12-07 18:41:10,477 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6417 transitions. Word has length 26 [2019-12-07 18:41:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:10,477 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 6417 transitions. [2019-12-07 18:41:10,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:41:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6417 transitions. [2019-12-07 18:41:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:41:10,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:10,480 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-12-07 18:41:10,480 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:10,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-07 18:41:10,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:10,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610574615] [2019-12-07 18:41:10,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:10,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610574615] [2019-12-07 18:41:10,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:10,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:41:10,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664973808] [2019-12-07 18:41:10,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:41:10,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:41:10,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:10,531 INFO L87 Difference]: Start difference. First operand 2810 states and 6417 transitions. Second operand 5 states. [2019-12-07 18:41:10,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:10,560 INFO L93 Difference]: Finished difference Result 1471 states and 3338 transitions. [2019-12-07 18:41:10,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:41:10,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 18:41:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:10,561 INFO L225 Difference]: With dead ends: 1471 [2019-12-07 18:41:10,561 INFO L226 Difference]: Without dead ends: 1312 [2019-12-07 18:41:10,562 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-12-07 18:41:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-12-07 18:41:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 841. [2019-12-07 18:41:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-12-07 18:41:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1889 transitions. [2019-12-07 18:41:10,572 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1889 transitions. Word has length 28 [2019-12-07 18:41:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:10,572 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1889 transitions. [2019-12-07 18:41:10,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:41:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1889 transitions. [2019-12-07 18:41:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:41:10,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:10,575 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-12-07 18:41:10,575 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:10,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:10,576 INFO L82 PathProgramCache]: Analyzing trace with hash 551725022, now seen corresponding path program 1 times [2019-12-07 18:41:10,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:10,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536154898] [2019-12-07 18:41:10,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:10,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536154898] [2019-12-07 18:41:10,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:10,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:41:10,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328770637] [2019-12-07 18:41:10,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:41:10,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:41:10,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:41:10,637 INFO L87 Difference]: Start difference. First operand 841 states and 1889 transitions. Second operand 3 states. [2019-12-07 18:41:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:10,683 INFO L93 Difference]: Finished difference Result 1065 states and 2362 transitions. [2019-12-07 18:41:10,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:41:10,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 18:41:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:10,685 INFO L225 Difference]: With dead ends: 1065 [2019-12-07 18:41:10,685 INFO L226 Difference]: Without dead ends: 1065 [2019-12-07 18:41:10,685 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-12-07 18:41:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2019-12-07 18:41:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 765. [2019-12-07 18:41:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-12-07 18:41:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1700 transitions. [2019-12-07 18:41:10,695 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1700 transitions. Word has length 52 [2019-12-07 18:41:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:10,696 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1700 transitions. [2019-12-07 18:41:10,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:41:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1700 transitions. [2019-12-07 18:41:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:41:10,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:10,697 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, 1] [2019-12-07 18:41:10,698 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1774994823, now seen corresponding path program 1 times [2019-12-07 18:41:10,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:10,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340189012] [2019-12-07 18:41:10,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:11,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340189012] [2019-12-07 18:41:11,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:11,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:41:11,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151204064] [2019-12-07 18:41:11,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:41:11,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:11,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:41:11,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:41:11,128 INFO L87 Difference]: Start difference. First operand 765 states and 1700 transitions. Second operand 16 states. [2019-12-07 18:41:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:13,093 INFO L93 Difference]: Finished difference Result 2702 states and 5895 transitions. [2019-12-07 18:41:13,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 18:41:13,094 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-12-07 18:41:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:13,095 INFO L225 Difference]: With dead ends: 2702 [2019-12-07 18:41:13,095 INFO L226 Difference]: Without dead ends: 2266 [2019-12-07 18:41:13,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=348, Invalid=1722, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 18:41:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-12-07 18:41:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 980. [2019-12-07 18:41:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-12-07 18:41:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2161 transitions. [2019-12-07 18:41:13,107 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2161 transitions. Word has length 53 [2019-12-07 18:41:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:13,107 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 2161 transitions. [2019-12-07 18:41:13,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:41:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2161 transitions. [2019-12-07 18:41:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:41:13,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:13,109 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, 1] [2019-12-07 18:41:13,109 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1410718248, now seen corresponding path program 1 times [2019-12-07 18:41:13,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:13,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855750219] [2019-12-07 18:41:13,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:13,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855750219] [2019-12-07 18:41:13,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:13,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:41:13,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786915885] [2019-12-07 18:41:13,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:41:13,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:13,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:41:13,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:13,152 INFO L87 Difference]: Start difference. First operand 980 states and 2161 transitions. Second operand 4 states. [2019-12-07 18:41:13,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:13,220 INFO L93 Difference]: Finished difference Result 1137 states and 2496 transitions. [2019-12-07 18:41:13,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:41:13,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 18:41:13,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:13,222 INFO L225 Difference]: With dead ends: 1137 [2019-12-07 18:41:13,222 INFO L226 Difference]: Without dead ends: 1137 [2019-12-07 18:41:13,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-12-07 18:41:13,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 951. [2019-12-07 18:41:13,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-07 18:41:13,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2100 transitions. [2019-12-07 18:41:13,234 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2100 transitions. Word has length 53 [2019-12-07 18:41:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:13,235 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 2100 transitions. [2019-12-07 18:41:13,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:41:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2100 transitions. [2019-12-07 18:41:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:41:13,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:13,236 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, 1] [2019-12-07 18:41:13,236 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:13,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:13,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1141076047, now seen corresponding path program 2 times [2019-12-07 18:41:13,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:13,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443477968] [2019-12-07 18:41:13,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:13,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443477968] [2019-12-07 18:41:13,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:13,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:41:13,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903617635] [2019-12-07 18:41:13,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:41:13,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:13,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:41:13,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:41:13,306 INFO L87 Difference]: Start difference. First operand 951 states and 2100 transitions. Second operand 7 states. [2019-12-07 18:41:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:13,533 INFO L93 Difference]: Finished difference Result 3633 states and 7902 transitions. [2019-12-07 18:41:13,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:41:13,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 18:41:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:13,535 INFO L225 Difference]: With dead ends: 3633 [2019-12-07 18:41:13,535 INFO L226 Difference]: Without dead ends: 2353 [2019-12-07 18:41:13,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:41:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-12-07 18:41:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 974. [2019-12-07 18:41:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-12-07 18:41:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 2166 transitions. [2019-12-07 18:41:13,547 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 2166 transitions. Word has length 53 [2019-12-07 18:41:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:13,547 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 2166 transitions. [2019-12-07 18:41:13,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:41:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 2166 transitions. [2019-12-07 18:41:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:41:13,548 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:13,548 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, 1] [2019-12-07 18:41:13,548 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:13,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:13,548 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 3 times [2019-12-07 18:41:13,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:13,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036712231] [2019-12-07 18:41:13,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:41:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:41:13,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:41:13,624 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:41:13,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| 4)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24| 1)) (= 0 |v_ULTIMATE.start_main_~#t1715~0.offset_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24|) |v_ULTIMATE.start_main_~#t1715~0.offset_18| 0)) |v_#memory_int_13|) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1715~0.base_24|) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24|)) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_~#t1715~0.offset=|v_ULTIMATE.start_main_~#t1715~0.offset_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, ULTIMATE.start_main_~#t1715~0.base=|v_ULTIMATE.start_main_~#t1715~0.base_24|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1715~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1716~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1716~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1715~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 18:41:13,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:41:13,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1716~0.base_12| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1716~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1716~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12|) |v_ULTIMATE.start_main_~#t1716~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1716~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1716~0.base] because there is no mapped edge [2019-12-07 18:41:13,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1973532228 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1973532228 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1973532228 |P0Thread1of1ForFork0_#t~ite5_Out-1973532228|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1973532228|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1973532228, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1973532228} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1973532228|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1973532228, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1973532228} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:41:13,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In198523634 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In198523634| |P1Thread1of1ForFork1_#t~ite14_Out198523634|) (= |P1Thread1of1ForFork1_#t~ite15_Out198523634| ~x$w_buff0~0_In198523634) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out198523634| |P1Thread1of1ForFork1_#t~ite14_Out198523634|) (= ~x$w_buff0~0_In198523634 |P1Thread1of1ForFork1_#t~ite14_Out198523634|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In198523634 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In198523634 256))) (= (mod ~x$w_buff0_used~0_In198523634 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In198523634 256) 0)))) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In198523634, ~x$w_buff1_used~0=~x$w_buff1_used~0_In198523634, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In198523634, ~weak$$choice2~0=~weak$$choice2~0_In198523634, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In198523634, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In198523634|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In198523634} OutVars{~x$w_buff0~0=~x$w_buff0~0_In198523634, ~x$w_buff1_used~0=~x$w_buff1_used~0_In198523634, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In198523634, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out198523634|, ~weak$$choice2~0=~weak$$choice2~0_In198523634, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In198523634, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out198523634|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In198523634} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 18:41:13,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In86887085 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In86887085 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In86887085 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In86887085 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In86887085 |P0Thread1of1ForFork0_#t~ite6_Out86887085|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out86887085| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In86887085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In86887085, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In86887085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In86887085} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out86887085|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In86887085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In86887085, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In86887085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In86887085} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:41:13,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= ~x$r_buff0_thd1~0_Out1078284292 ~x$r_buff0_thd1~0_In1078284292)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1078284292 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1078284292 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (= ~x$r_buff0_thd1~0_Out1078284292 0) (not .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1078284292, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1078284292} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1078284292, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1078284292|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1078284292} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 18:41:13,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In2048631225 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In2048631225 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In2048631225 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In2048631225 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out2048631225|)) (and (= ~x$r_buff1_thd1~0_In2048631225 |P0Thread1of1ForFork0_#t~ite8_Out2048631225|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2048631225, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2048631225, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2048631225, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2048631225} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2048631225, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2048631225|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2048631225, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2048631225, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2048631225} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:41:13,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 18:41:13,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1075429830 256) 0))) (or (and .cse0 (= ~x$w_buff1~0_In1075429830 |P1Thread1of1ForFork1_#t~ite17_Out1075429830|) (= |P1Thread1of1ForFork1_#t~ite17_Out1075429830| |P1Thread1of1ForFork1_#t~ite18_Out1075429830|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1075429830 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In1075429830 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In1075429830 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1075429830 256)))))) (and (= |P1Thread1of1ForFork1_#t~ite17_In1075429830| |P1Thread1of1ForFork1_#t~ite17_Out1075429830|) (= ~x$w_buff1~0_In1075429830 |P1Thread1of1ForFork1_#t~ite18_Out1075429830|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1075429830, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1075429830, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1075429830, ~weak$$choice2~0=~weak$$choice2~0_In1075429830, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1075429830, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1075429830|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1075429830} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1075429830|, ~x$w_buff1~0=~x$w_buff1~0_In1075429830, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1075429830, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1075429830, ~weak$$choice2~0=~weak$$choice2~0_In1075429830, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1075429830, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1075429830|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1075429830} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 18:41:13,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1808396314 256)))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In1808396314 |P1Thread1of1ForFork1_#t~ite21_Out1808396314|) (= |P1Thread1of1ForFork1_#t~ite20_In1808396314| |P1Thread1of1ForFork1_#t~ite20_Out1808396314|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1808396314| |P1Thread1of1ForFork1_#t~ite21_Out1808396314|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1808396314 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1808396314 256)) (and (= (mod ~x$w_buff1_used~0_In1808396314 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1808396314 256))))) (= |P1Thread1of1ForFork1_#t~ite20_Out1808396314| ~x$w_buff0_used~0_In1808396314)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1808396314|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1808396314, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1808396314, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1808396314, ~weak$$choice2~0=~weak$$choice2~0_In1808396314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1808396314} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1808396314|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1808396314, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1808396314, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1808396314|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1808396314, ~weak$$choice2~0=~weak$$choice2~0_In1808396314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1808396314} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 18:41:13,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:41:13,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1044837337 256)))) (or (and (= ~x$r_buff1_thd2~0_In1044837337 |P1Thread1of1ForFork1_#t~ite30_Out1044837337|) (= |P1Thread1of1ForFork1_#t~ite29_In1044837337| |P1Thread1of1ForFork1_#t~ite29_Out1044837337|) (not .cse0)) (and (= ~x$r_buff1_thd2~0_In1044837337 |P1Thread1of1ForFork1_#t~ite29_Out1044837337|) (= |P1Thread1of1ForFork1_#t~ite30_Out1044837337| |P1Thread1of1ForFork1_#t~ite29_Out1044837337|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1044837337 256) 0))) (or (= (mod ~x$w_buff0_used~0_In1044837337 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In1044837337 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In1044837337 256)) .cse1))) .cse0))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1044837337|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1044837337, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1044837337, ~weak$$choice2~0=~weak$$choice2~0_In1044837337, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1044837337, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1044837337} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1044837337|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1044837337|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1044837337, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1044837337, ~weak$$choice2~0=~weak$$choice2~0_In1044837337, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1044837337, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1044837337} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:41:13,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-07 18:41:13,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-270059728 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-270059728 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-270059728 |P1Thread1of1ForFork1_#t~ite32_Out-270059728|)) (and (= ~x~0_In-270059728 |P1Thread1of1ForFork1_#t~ite32_Out-270059728|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-270059728, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-270059728, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-270059728, ~x~0=~x~0_In-270059728} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-270059728, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-270059728, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-270059728, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-270059728|, ~x~0=~x~0_In-270059728} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 18:41:13,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 18:41:13,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-195544416 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-195544416 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-195544416|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-195544416 |P1Thread1of1ForFork1_#t~ite34_Out-195544416|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-195544416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-195544416} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-195544416|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-195544416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-195544416} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:41:13,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1847221047 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1847221047 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1847221047 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1847221047 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1847221047|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1847221047 |P1Thread1of1ForFork1_#t~ite35_Out1847221047|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1847221047, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1847221047, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1847221047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1847221047} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1847221047, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1847221047, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1847221047|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1847221047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1847221047} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:41:13,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In378162737 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In378162737 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In378162737 |P1Thread1of1ForFork1_#t~ite36_Out378162737|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out378162737|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In378162737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In378162737} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In378162737, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out378162737|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In378162737} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:41:13,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1687041182 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1687041182 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1687041182 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1687041182 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1687041182|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out1687041182| ~x$r_buff1_thd2~0_In1687041182) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1687041182, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1687041182, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1687041182, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1687041182} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1687041182, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1687041182, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1687041182, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1687041182|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1687041182} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:41:13,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:41:13,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:41:13,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1685480739 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1685480739 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1685480739| ~x$w_buff1~0_In1685480739) (not .cse1)) (and (= ~x~0_In1685480739 |ULTIMATE.start_main_#t~ite40_Out1685480739|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1685480739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1685480739, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1685480739, ~x~0=~x~0_In1685480739} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1685480739|, ~x$w_buff1~0=~x$w_buff1~0_In1685480739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1685480739, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1685480739, ~x~0=~x~0_In1685480739} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:41:13,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-07 18:41:13,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-2011856895 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2011856895 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-2011856895|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2011856895 |ULTIMATE.start_main_#t~ite42_Out-2011856895|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2011856895, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2011856895} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2011856895, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2011856895|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2011856895} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:41:13,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In814824298 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In814824298 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In814824298 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In814824298 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out814824298| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In814824298 |ULTIMATE.start_main_#t~ite43_Out814824298|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In814824298, ~x$w_buff1_used~0=~x$w_buff1_used~0_In814824298, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In814824298, ~x$w_buff0_used~0=~x$w_buff0_used~0_In814824298} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In814824298, ~x$w_buff1_used~0=~x$w_buff1_used~0_In814824298, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out814824298|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In814824298, ~x$w_buff0_used~0=~x$w_buff0_used~0_In814824298} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:41:13,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In876044557 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In876044557 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In876044557 |ULTIMATE.start_main_#t~ite44_Out876044557|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out876044557|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In876044557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In876044557} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In876044557, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out876044557|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In876044557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:41:13,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-623882798 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-623882798 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-623882798 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-623882798 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-623882798| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out-623882798| ~x$r_buff1_thd0~0_In-623882798) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-623882798, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-623882798, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-623882798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-623882798} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-623882798, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-623882798, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-623882798, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-623882798|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-623882798} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:41:13,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:41:13,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:41:13 BasicIcfg [2019-12-07 18:41:13,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:41:13,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:41:13,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:41:13,672 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:41:13,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:41:03" (3/4) ... [2019-12-07 18:41:13,674 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:41:13,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| 4)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24| 1)) (= 0 |v_ULTIMATE.start_main_~#t1715~0.offset_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24|) |v_ULTIMATE.start_main_~#t1715~0.offset_18| 0)) |v_#memory_int_13|) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1715~0.base_24|) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24|)) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_~#t1715~0.offset=|v_ULTIMATE.start_main_~#t1715~0.offset_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, ULTIMATE.start_main_~#t1715~0.base=|v_ULTIMATE.start_main_~#t1715~0.base_24|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1715~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1716~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1716~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1715~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 18:41:13,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:41:13,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1716~0.base_12| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1716~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1716~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12|) |v_ULTIMATE.start_main_~#t1716~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1716~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1716~0.base] because there is no mapped edge [2019-12-07 18:41:13,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1973532228 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1973532228 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1973532228 |P0Thread1of1ForFork0_#t~ite5_Out-1973532228|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1973532228|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1973532228, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1973532228} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1973532228|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1973532228, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1973532228} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:41:13,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In198523634 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In198523634| |P1Thread1of1ForFork1_#t~ite14_Out198523634|) (= |P1Thread1of1ForFork1_#t~ite15_Out198523634| ~x$w_buff0~0_In198523634) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out198523634| |P1Thread1of1ForFork1_#t~ite14_Out198523634|) (= ~x$w_buff0~0_In198523634 |P1Thread1of1ForFork1_#t~ite14_Out198523634|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In198523634 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In198523634 256))) (= (mod ~x$w_buff0_used~0_In198523634 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In198523634 256) 0)))) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In198523634, ~x$w_buff1_used~0=~x$w_buff1_used~0_In198523634, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In198523634, ~weak$$choice2~0=~weak$$choice2~0_In198523634, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In198523634, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In198523634|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In198523634} OutVars{~x$w_buff0~0=~x$w_buff0~0_In198523634, ~x$w_buff1_used~0=~x$w_buff1_used~0_In198523634, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In198523634, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out198523634|, ~weak$$choice2~0=~weak$$choice2~0_In198523634, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In198523634, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out198523634|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In198523634} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 18:41:13,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In86887085 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In86887085 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In86887085 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In86887085 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In86887085 |P0Thread1of1ForFork0_#t~ite6_Out86887085|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out86887085| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In86887085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In86887085, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In86887085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In86887085} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out86887085|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In86887085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In86887085, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In86887085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In86887085} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:41:13,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= ~x$r_buff0_thd1~0_Out1078284292 ~x$r_buff0_thd1~0_In1078284292)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1078284292 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1078284292 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (= ~x$r_buff0_thd1~0_Out1078284292 0) (not .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1078284292, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1078284292} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1078284292, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1078284292|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1078284292} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 18:41:13,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In2048631225 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In2048631225 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In2048631225 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In2048631225 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out2048631225|)) (and (= ~x$r_buff1_thd1~0_In2048631225 |P0Thread1of1ForFork0_#t~ite8_Out2048631225|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2048631225, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2048631225, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2048631225, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2048631225} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2048631225, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2048631225|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2048631225, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2048631225, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2048631225} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:41:13,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 18:41:13,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1075429830 256) 0))) (or (and .cse0 (= ~x$w_buff1~0_In1075429830 |P1Thread1of1ForFork1_#t~ite17_Out1075429830|) (= |P1Thread1of1ForFork1_#t~ite17_Out1075429830| |P1Thread1of1ForFork1_#t~ite18_Out1075429830|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1075429830 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In1075429830 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In1075429830 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1075429830 256)))))) (and (= |P1Thread1of1ForFork1_#t~ite17_In1075429830| |P1Thread1of1ForFork1_#t~ite17_Out1075429830|) (= ~x$w_buff1~0_In1075429830 |P1Thread1of1ForFork1_#t~ite18_Out1075429830|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1075429830, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1075429830, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1075429830, ~weak$$choice2~0=~weak$$choice2~0_In1075429830, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1075429830, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1075429830|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1075429830} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1075429830|, ~x$w_buff1~0=~x$w_buff1~0_In1075429830, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1075429830, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1075429830, ~weak$$choice2~0=~weak$$choice2~0_In1075429830, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1075429830, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1075429830|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1075429830} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 18:41:13,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1808396314 256)))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In1808396314 |P1Thread1of1ForFork1_#t~ite21_Out1808396314|) (= |P1Thread1of1ForFork1_#t~ite20_In1808396314| |P1Thread1of1ForFork1_#t~ite20_Out1808396314|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1808396314| |P1Thread1of1ForFork1_#t~ite21_Out1808396314|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1808396314 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1808396314 256)) (and (= (mod ~x$w_buff1_used~0_In1808396314 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1808396314 256))))) (= |P1Thread1of1ForFork1_#t~ite20_Out1808396314| ~x$w_buff0_used~0_In1808396314)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1808396314|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1808396314, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1808396314, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1808396314, ~weak$$choice2~0=~weak$$choice2~0_In1808396314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1808396314} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1808396314|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1808396314, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1808396314, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1808396314|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1808396314, ~weak$$choice2~0=~weak$$choice2~0_In1808396314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1808396314} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 18:41:13,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:41:13,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1044837337 256)))) (or (and (= ~x$r_buff1_thd2~0_In1044837337 |P1Thread1of1ForFork1_#t~ite30_Out1044837337|) (= |P1Thread1of1ForFork1_#t~ite29_In1044837337| |P1Thread1of1ForFork1_#t~ite29_Out1044837337|) (not .cse0)) (and (= ~x$r_buff1_thd2~0_In1044837337 |P1Thread1of1ForFork1_#t~ite29_Out1044837337|) (= |P1Thread1of1ForFork1_#t~ite30_Out1044837337| |P1Thread1of1ForFork1_#t~ite29_Out1044837337|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1044837337 256) 0))) (or (= (mod ~x$w_buff0_used~0_In1044837337 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In1044837337 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In1044837337 256)) .cse1))) .cse0))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1044837337|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1044837337, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1044837337, ~weak$$choice2~0=~weak$$choice2~0_In1044837337, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1044837337, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1044837337} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1044837337|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1044837337|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1044837337, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1044837337, ~weak$$choice2~0=~weak$$choice2~0_In1044837337, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1044837337, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1044837337} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:41:13,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-07 18:41:13,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-270059728 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-270059728 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-270059728 |P1Thread1of1ForFork1_#t~ite32_Out-270059728|)) (and (= ~x~0_In-270059728 |P1Thread1of1ForFork1_#t~ite32_Out-270059728|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-270059728, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-270059728, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-270059728, ~x~0=~x~0_In-270059728} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-270059728, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-270059728, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-270059728, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-270059728|, ~x~0=~x~0_In-270059728} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 18:41:13,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 18:41:13,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-195544416 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-195544416 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-195544416|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-195544416 |P1Thread1of1ForFork1_#t~ite34_Out-195544416|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-195544416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-195544416} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-195544416|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-195544416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-195544416} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:41:13,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1847221047 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1847221047 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1847221047 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1847221047 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1847221047|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1847221047 |P1Thread1of1ForFork1_#t~ite35_Out1847221047|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1847221047, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1847221047, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1847221047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1847221047} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1847221047, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1847221047, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1847221047|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1847221047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1847221047} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:41:13,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In378162737 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In378162737 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In378162737 |P1Thread1of1ForFork1_#t~ite36_Out378162737|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out378162737|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In378162737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In378162737} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In378162737, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out378162737|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In378162737} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:41:13,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1687041182 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1687041182 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1687041182 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1687041182 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1687041182|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out1687041182| ~x$r_buff1_thd2~0_In1687041182) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1687041182, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1687041182, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1687041182, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1687041182} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1687041182, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1687041182, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1687041182, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1687041182|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1687041182} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:41:13,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:41:13,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:41:13,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1685480739 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1685480739 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1685480739| ~x$w_buff1~0_In1685480739) (not .cse1)) (and (= ~x~0_In1685480739 |ULTIMATE.start_main_#t~ite40_Out1685480739|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1685480739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1685480739, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1685480739, ~x~0=~x~0_In1685480739} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1685480739|, ~x$w_buff1~0=~x$w_buff1~0_In1685480739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1685480739, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1685480739, ~x~0=~x~0_In1685480739} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:41:13,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-07 18:41:13,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-2011856895 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2011856895 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-2011856895|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2011856895 |ULTIMATE.start_main_#t~ite42_Out-2011856895|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2011856895, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2011856895} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2011856895, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2011856895|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2011856895} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:41:13,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In814824298 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In814824298 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In814824298 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In814824298 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out814824298| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In814824298 |ULTIMATE.start_main_#t~ite43_Out814824298|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In814824298, ~x$w_buff1_used~0=~x$w_buff1_used~0_In814824298, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In814824298, ~x$w_buff0_used~0=~x$w_buff0_used~0_In814824298} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In814824298, ~x$w_buff1_used~0=~x$w_buff1_used~0_In814824298, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out814824298|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In814824298, ~x$w_buff0_used~0=~x$w_buff0_used~0_In814824298} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:41:13,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In876044557 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In876044557 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In876044557 |ULTIMATE.start_main_#t~ite44_Out876044557|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out876044557|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In876044557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In876044557} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In876044557, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out876044557|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In876044557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:41:13,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-623882798 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-623882798 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-623882798 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-623882798 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-623882798| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out-623882798| ~x$r_buff1_thd0~0_In-623882798) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-623882798, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-623882798, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-623882798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-623882798} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-623882798, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-623882798, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-623882798, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-623882798|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-623882798} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:41:13,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:41:13,729 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1bb34594-fd42-48b6-a4e8-6e4344f81f61/bin/uautomizer/witness.graphml [2019-12-07 18:41:13,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:41:13,731 INFO L168 Benchmark]: Toolchain (without parser) took 11392.90 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 529.5 MB). Free memory was 938.7 MB in the beginning and 1.3 GB in the end (delta: -327.8 MB). Peak memory consumption was 201.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:41:13,731 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:41:13,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:41:13,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:41:13,732 INFO L168 Benchmark]: Boogie Preprocessor took 37.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:41:13,732 INFO L168 Benchmark]: RCFGBuilder took 382.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:41:13,732 INFO L168 Benchmark]: TraceAbstraction took 10482.77 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 427.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -268.4 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:41:13,733 INFO L168 Benchmark]: Witness Printer took 57.53 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:41:13,734 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 382.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10482.77 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 427.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -268.4 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. * Witness Printer took 57.53 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1715, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1716, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1844 SDtfs, 2301 SDslu, 4599 SDs, 0 SdLazy, 2895 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16697occurred 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: 1.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 12310 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 100914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...