./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_rmo.oepc.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_2f15f386-d2f7-44a8-952a-b13430fa5645/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/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 cdedd2c6a1c364b12302caa45346a9281105eb2c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:22:53,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:22:53,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:22:53,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:22:53,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:22:53,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:22:53,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:22:53,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:22:53,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:22:53,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:22:53,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:22:53,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:22:53,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:22:53,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:22:53,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:22:53,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:22:53,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:22:53,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:22:53,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:22:53,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:22:53,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:22:53,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:22:53,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:22:53,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:22:53,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:22:53,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:22:53,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:22:53,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:22:53,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:22:53,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:22:53,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:22:53,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:22:53,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:22:53,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:22:53,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:22:53,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:22:53,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:22:53,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:22:53,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:22:53,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:22:53,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:22:53,370 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:22:53,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:22:53,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:22:53,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:22:53,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:22:53,381 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:22:53,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:22:53,381 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:22:53,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:22:53,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:22:53,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:22:53,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:22:53,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:22:53,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:22:53,382 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:22:53,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:22:53,382 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:22:53,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:22:53,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:22:53,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:22:53,383 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:22:53,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:22:53,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:22:53,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:22:53,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:22:53,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:22:53,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:22:53,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:22:53,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:22:53,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:22:53,384 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_2f15f386-d2f7-44a8-952a-b13430fa5645/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 -> cdedd2c6a1c364b12302caa45346a9281105eb2c [2019-12-07 11:22:53,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:22:53,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:22:53,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:22:53,494 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:22:53,494 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:22:53,495 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_rmo.oepc.i [2019-12-07 11:22:53,532 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/bin/uautomizer/data/10ce69a21/51c886e6476248a198c0132f08b31e82/FLAGc415868b6 [2019-12-07 11:22:53,960 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:22:53,961 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/sv-benchmarks/c/pthread-wmm/safe033_rmo.oepc.i [2019-12-07 11:22:53,970 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/bin/uautomizer/data/10ce69a21/51c886e6476248a198c0132f08b31e82/FLAGc415868b6 [2019-12-07 11:22:54,316 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/bin/uautomizer/data/10ce69a21/51c886e6476248a198c0132f08b31e82 [2019-12-07 11:22:54,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:22:54,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:22:54,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:22:54,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:22:54,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:22:54,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:22:54" (1/1) ... [2019-12-07 11:22:54,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296938c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54, skipping insertion in model container [2019-12-07 11:22:54,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:22:54" (1/1) ... [2019-12-07 11:22:54,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:22:54,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:22:54,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:22:54,632 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:22:54,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:22:54,721 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:22:54,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54 WrapperNode [2019-12-07 11:22:54,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:22:54,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:22:54,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:22:54,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:22:54,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54" (1/1) ... [2019-12-07 11:22:54,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54" (1/1) ... [2019-12-07 11:22:54,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:22:54,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:22:54,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:22:54,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:22:54,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54" (1/1) ... [2019-12-07 11:22:54,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54" (1/1) ... [2019-12-07 11:22:54,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54" (1/1) ... [2019-12-07 11:22:54,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54" (1/1) ... [2019-12-07 11:22:54,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54" (1/1) ... [2019-12-07 11:22:54,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54" (1/1) ... [2019-12-07 11:22:54,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54" (1/1) ... [2019-12-07 11:22:54,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:22:54,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:22:54,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:22:54,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:22:54,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/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 11:22:54,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:22:54,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:22:54,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:22:54,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:22:54,824 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:22:54,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:22:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:22:54,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:22:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:22:54,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:22:54,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:22:54,826 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 11:22:55,134 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:22:55,134 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:22:55,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:22:55 BoogieIcfgContainer [2019-12-07 11:22:55,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:22:55,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:22:55,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:22:55,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:22:55,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:22:54" (1/3) ... [2019-12-07 11:22:55,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbba2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:22:55, skipping insertion in model container [2019-12-07 11:22:55,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:54" (2/3) ... [2019-12-07 11:22:55,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbba2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:22:55, skipping insertion in model container [2019-12-07 11:22:55,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:22:55" (3/3) ... [2019-12-07 11:22:55,140 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_rmo.oepc.i [2019-12-07 11:22:55,145 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:22:55,146 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:22:55,150 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:22:55,151 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:22:55,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,183 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,183 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,184 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,184 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,184 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:22:55,197 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 11:22:55,209 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:22:55,209 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:22:55,209 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:22:55,209 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:22:55,209 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:22:55,209 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:22:55,210 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:22:55,210 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:22:55,220 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-07 11:22:55,221 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-07 11:22:55,263 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-07 11:22:55,264 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:22:55,271 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 11:22:55,281 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-07 11:22:55,303 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-07 11:22:55,304 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:22:55,306 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 11:22:55,315 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 11:22:55,315 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:22:57,815 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 11:22:57,943 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40283 [2019-12-07 11:22:57,943 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-07 11:22:57,945 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 78 transitions [2019-12-07 11:22:58,168 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-07 11:22:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-07 11:22:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:22:58,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:22:58,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:22:58,175 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:22:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash 673057218, now seen corresponding path program 1 times [2019-12-07 11:22:58,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:58,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508275885] [2019-12-07 11:22:58,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:58,327 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 11:22:58,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508275885] [2019-12-07 11:22:58,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:22:58,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:22:58,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013837095] [2019-12-07 11:22:58,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:22:58,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:58,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:22:58,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:22:58,344 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-07 11:22:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:58,525 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-07 11:22:58,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:22:58,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:22:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:22:58,580 INFO L225 Difference]: With dead ends: 6240 [2019-12-07 11:22:58,580 INFO L226 Difference]: Without dead ends: 5850 [2019-12-07 11:22:58,581 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 11:22:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-07 11:22:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-07 11:22:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-07 11:22:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-07 11:22:58,819 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-07 11:22:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:22:58,819 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-07 11:22:58,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:22:58,819 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-07 11:22:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:22:58,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:22:58,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:58,822 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:22:58,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:58,822 INFO L82 PathProgramCache]: Analyzing trace with hash 93905246, now seen corresponding path program 1 times [2019-12-07 11:22:58,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:58,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287894301] [2019-12-07 11:22:58,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:58,870 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 11:22:58,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287894301] [2019-12-07 11:22:58,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:22:58,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:22:58,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085193446] [2019-12-07 11:22:58,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:22:58,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:58,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:22:58,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:22:58,872 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-12-07 11:22:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:58,890 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-12-07 11:22:58,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:22:58,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 11:22:58,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:22:58,896 INFO L225 Difference]: With dead ends: 1185 [2019-12-07 11:22:58,896 INFO L226 Difference]: Without dead ends: 1185 [2019-12-07 11:22:58,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:22:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-07 11:22:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-07 11:22:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-07 11:22:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-12-07 11:22:58,918 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-12-07 11:22:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:22:58,919 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-12-07 11:22:58,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:22:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-12-07 11:22:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:22:58,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:22:58,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:58,920 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:22:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:58,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1893769716, now seen corresponding path program 1 times [2019-12-07 11:22:58,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:58,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537410617] [2019-12-07 11:22:58,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:58,956 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 11:22:58,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537410617] [2019-12-07 11:22:58,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:22:58,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:22:58,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140348169] [2019-12-07 11:22:58,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:22:58,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:58,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:22:58,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:22:58,957 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 3 states. [2019-12-07 11:22:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:59,015 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-12-07 11:22:59,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:22:59,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 11:22:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:22:59,027 INFO L225 Difference]: With dead ends: 1756 [2019-12-07 11:22:59,027 INFO L226 Difference]: Without dead ends: 1756 [2019-12-07 11:22:59,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:22:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-07 11:22:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-12-07 11:22:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-07 11:22:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-12-07 11:22:59,059 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-12-07 11:22:59,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:22:59,060 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-12-07 11:22:59,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:22:59,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-12-07 11:22:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:22:59,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:22:59,061 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:59,061 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:22:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1890038153, now seen corresponding path program 1 times [2019-12-07 11:22:59,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:59,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336193659] [2019-12-07 11:22:59,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:59,111 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 11:22:59,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336193659] [2019-12-07 11:22:59,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:22:59,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:22:59,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113835764] [2019-12-07 11:22:59,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:22:59,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:59,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:22:59,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:22:59,113 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 4 states. [2019-12-07 11:22:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:59,217 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-12-07 11:22:59,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:22:59,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:22:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:22:59,228 INFO L225 Difference]: With dead ends: 1703 [2019-12-07 11:22:59,228 INFO L226 Difference]: Without dead ends: 1703 [2019-12-07 11:22:59,229 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 11:22:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-07 11:22:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-12-07 11:22:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-07 11:22:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-12-07 11:22:59,272 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-12-07 11:22:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:22:59,272 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-12-07 11:22:59,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:22:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-12-07 11:22:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:22:59,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:22:59,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:22:59,274 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:22:59,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:59,274 INFO L82 PathProgramCache]: Analyzing trace with hash 422006117, now seen corresponding path program 1 times [2019-12-07 11:22:59,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:59,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509563470] [2019-12-07 11:22:59,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:59,327 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 11:22:59,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509563470] [2019-12-07 11:22:59,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:22:59,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:22:59,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380157255] [2019-12-07 11:22:59,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:22:59,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:59,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:22:59,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:22:59,329 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 4 states. [2019-12-07 11:22:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:59,451 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-12-07 11:22:59,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:22:59,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:22:59,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:22:59,460 INFO L225 Difference]: With dead ends: 1972 [2019-12-07 11:22:59,460 INFO L226 Difference]: Without dead ends: 1972 [2019-12-07 11:22:59,460 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 11:22:59,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-12-07 11:22:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-12-07 11:22:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-07 11:22:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-07 11:22:59,492 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-12-07 11:22:59,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:22:59,492 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-07 11:22:59,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:22:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-07 11:22:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:22:59,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:22:59,494 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 11:22:59,494 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:22:59,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:59,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1141853416, now seen corresponding path program 1 times [2019-12-07 11:22:59,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:59,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124177837] [2019-12-07 11:22:59,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:59,541 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 11:22:59,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124177837] [2019-12-07 11:22:59,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:22:59,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:22:59,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104877959] [2019-12-07 11:22:59,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:22:59,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:59,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:22:59,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:22:59,543 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 4 states. [2019-12-07 11:22:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:59,563 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-07 11:22:59,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:22:59,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 11:22:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:22:59,568 INFO L225 Difference]: With dead ends: 772 [2019-12-07 11:22:59,569 INFO L226 Difference]: Without dead ends: 772 [2019-12-07 11:22:59,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:22:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-07 11:22:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-12-07 11:22:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-07 11:22:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-12-07 11:22:59,584 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-12-07 11:22:59,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:22:59,584 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-12-07 11:22:59,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:22:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-12-07 11:22:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:22:59,586 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:22:59,587 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] [2019-12-07 11:22:59,587 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:22:59,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:59,587 INFO L82 PathProgramCache]: Analyzing trace with hash -635782706, now seen corresponding path program 1 times [2019-12-07 11:22:59,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:59,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408148234] [2019-12-07 11:22:59,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:59,662 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 11:22:59,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408148234] [2019-12-07 11:22:59,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:22:59,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:22:59,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032567004] [2019-12-07 11:22:59,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:22:59,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:59,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:22:59,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:22:59,663 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 5 states. [2019-12-07 11:22:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:59,868 INFO L93 Difference]: Finished difference Result 1061 states and 2336 transitions. [2019-12-07 11:22:59,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:22:59,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 11:22:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:22:59,872 INFO L225 Difference]: With dead ends: 1061 [2019-12-07 11:22:59,872 INFO L226 Difference]: Without dead ends: 1061 [2019-12-07 11:22:59,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:22:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-12-07 11:22:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 901. [2019-12-07 11:22:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-12-07 11:22:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 2017 transitions. [2019-12-07 11:22:59,885 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 2017 transitions. Word has length 41 [2019-12-07 11:22:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:22:59,885 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 2017 transitions. [2019-12-07 11:22:59,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:22:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 2017 transitions. [2019-12-07 11:22:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:22:59,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:22:59,887 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] [2019-12-07 11:22:59,887 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:22:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash 562189682, now seen corresponding path program 2 times [2019-12-07 11:22:59,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:59,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863476885] [2019-12-07 11:22:59,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:22:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:22:59,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863476885] [2019-12-07 11:22:59,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:22:59,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:22:59,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435533160] [2019-12-07 11:22:59,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:22:59,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:22:59,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:22:59,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:22:59,930 INFO L87 Difference]: Start difference. First operand 901 states and 2017 transitions. Second operand 3 states. [2019-12-07 11:22:59,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:22:59,940 INFO L93 Difference]: Finished difference Result 901 states and 2015 transitions. [2019-12-07 11:22:59,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:22:59,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 11:22:59,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:22:59,944 INFO L225 Difference]: With dead ends: 901 [2019-12-07 11:22:59,944 INFO L226 Difference]: Without dead ends: 901 [2019-12-07 11:22:59,945 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 11:22:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-12-07 11:22:59,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 781. [2019-12-07 11:22:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-12-07 11:22:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1786 transitions. [2019-12-07 11:22:59,975 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1786 transitions. Word has length 41 [2019-12-07 11:22:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:22:59,975 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1786 transitions. [2019-12-07 11:22:59,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:22:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1786 transitions. [2019-12-07 11:22:59,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:22:59,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:22:59,977 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] [2019-12-07 11:22:59,977 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:22:59,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:22:59,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1761581763, now seen corresponding path program 1 times [2019-12-07 11:22:59,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:22:59,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512438099] [2019-12-07 11:22:59,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:22:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:00,027 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 11:23:00,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512438099] [2019-12-07 11:23:00,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:00,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:23:00,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059898765] [2019-12-07 11:23:00,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:23:00,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:00,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:23:00,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:23:00,029 INFO L87 Difference]: Start difference. First operand 781 states and 1786 transitions. Second operand 3 states. [2019-12-07 11:23:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:00,042 INFO L93 Difference]: Finished difference Result 1350 states and 3100 transitions. [2019-12-07 11:23:00,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:23:00,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 11:23:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:00,048 INFO L225 Difference]: With dead ends: 1350 [2019-12-07 11:23:00,048 INFO L226 Difference]: Without dead ends: 1256 [2019-12-07 11:23:00,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:23:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-12-07 11:23:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 761. [2019-12-07 11:23:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-12-07 11:23:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1735 transitions. [2019-12-07 11:23:00,061 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1735 transitions. Word has length 42 [2019-12-07 11:23:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:00,061 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1735 transitions. [2019-12-07 11:23:00,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:23:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1735 transitions. [2019-12-07 11:23:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:23:00,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:00,063 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] [2019-12-07 11:23:00,063 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:00,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:00,063 INFO L82 PathProgramCache]: Analyzing trace with hash 58672515, now seen corresponding path program 2 times [2019-12-07 11:23:00,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:00,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357714727] [2019-12-07 11:23:00,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:00,113 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 11:23:00,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357714727] [2019-12-07 11:23:00,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:00,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:23:00,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527750276] [2019-12-07 11:23:00,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:00,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:00,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:00,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:00,114 INFO L87 Difference]: Start difference. First operand 761 states and 1735 transitions. Second operand 4 states. [2019-12-07 11:23:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:00,129 INFO L93 Difference]: Finished difference Result 1326 states and 3041 transitions. [2019-12-07 11:23:00,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:00,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 11:23:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:00,132 INFO L225 Difference]: With dead ends: 1326 [2019-12-07 11:23:00,132 INFO L226 Difference]: Without dead ends: 593 [2019-12-07 11:23:00,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-12-07 11:23:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-12-07 11:23:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-12-07 11:23:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1354 transitions. [2019-12-07 11:23:00,144 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1354 transitions. Word has length 42 [2019-12-07 11:23:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:00,144 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 1354 transitions. [2019-12-07 11:23:00,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1354 transitions. [2019-12-07 11:23:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:23:00,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:00,146 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] [2019-12-07 11:23:00,146 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:00,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:00,146 INFO L82 PathProgramCache]: Analyzing trace with hash 501545049, now seen corresponding path program 3 times [2019-12-07 11:23:00,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:00,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990749416] [2019-12-07 11:23:00,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:00,204 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 11:23:00,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990749416] [2019-12-07 11:23:00,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:00,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:23:00,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811857908] [2019-12-07 11:23:00,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:23:00,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:00,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:23:00,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:23:00,205 INFO L87 Difference]: Start difference. First operand 593 states and 1354 transitions. Second operand 6 states. [2019-12-07 11:23:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:00,295 INFO L93 Difference]: Finished difference Result 969 states and 2157 transitions. [2019-12-07 11:23:00,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:23:00,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 11:23:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:00,297 INFO L225 Difference]: With dead ends: 969 [2019-12-07 11:23:00,297 INFO L226 Difference]: Without dead ends: 658 [2019-12-07 11:23:00,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:23:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-12-07 11:23:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 616. [2019-12-07 11:23:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-12-07 11:23:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1384 transitions. [2019-12-07 11:23:00,306 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1384 transitions. Word has length 42 [2019-12-07 11:23:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:00,307 INFO L462 AbstractCegarLoop]: Abstraction has 616 states and 1384 transitions. [2019-12-07 11:23:00,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:23:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1384 transitions. [2019-12-07 11:23:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:23:00,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:00,308 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] [2019-12-07 11:23:00,308 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:00,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:00,308 INFO L82 PathProgramCache]: Analyzing trace with hash -296631181, now seen corresponding path program 4 times [2019-12-07 11:23:00,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:00,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45215907] [2019-12-07 11:23:00,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:23:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:23:00,383 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:23:00,383 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:23:00,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= 0 v_~x$r_buff0_thd2~0_163) (= v_~x$r_buff0_thd0~0_130 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2569~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2569~0.base_24|) |v_ULTIMATE.start_main_~#t2569~0.offset_18| 0)) |v_#memory_int_11|) (= v_~y~0_90 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2569~0.base_24| 1)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= (select .cse0 |v_ULTIMATE.start_main_~#t2569~0.base_24|) 0) (= 0 v_~x$w_buff1_used~0_600) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2569~0.base_24|) (= 0 |v_ULTIMATE.start_main_~#t2569~0.offset_18|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2569~0.base_24| 4)) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, #length=|v_#length_15|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t2569~0.offset=|v_ULTIMATE.start_main_~#t2569~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ULTIMATE.start_main_~#t2570~0.offset=|v_ULTIMATE.start_main_~#t2570~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2569~0.base=|v_ULTIMATE.start_main_~#t2569~0.base_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ULTIMATE.start_main_~#t2570~0.base=|v_ULTIMATE.start_main_~#t2570~0.base_25|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t2569~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2570~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2569~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2570~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:23:00,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2570~0.base_11| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t2570~0.base_11| 0)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2570~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2570~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t2570~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2570~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2570~0.base_11|) |v_ULTIMATE.start_main_~#t2570~0.offset_9| 1))) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2570~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2570~0.offset=|v_ULTIMATE.start_main_~#t2570~0.offset_9|, ULTIMATE.start_main_~#t2570~0.base=|v_ULTIMATE.start_main_~#t2570~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2570~0.offset, ULTIMATE.start_main_~#t2570~0.base] because there is no mapped edge [2019-12-07 11:23:00,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:23:00,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2124991775 256)))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite8_Out-2124991775| |P0Thread1of1ForFork1_#t~ite9_Out-2124991775|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2124991775 256)))) (or (= (mod ~x$w_buff0_used~0_In-2124991775 256) 0) (and (= (mod ~x$w_buff1_used~0_In-2124991775 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2124991775 256))))) (= |P0Thread1of1ForFork1_#t~ite8_Out-2124991775| ~x$w_buff0~0_In-2124991775)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite9_Out-2124991775| ~x$w_buff0~0_In-2124991775) (= |P0Thread1of1ForFork1_#t~ite8_In-2124991775| |P0Thread1of1ForFork1_#t~ite8_Out-2124991775|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-2124991775, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2124991775, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-2124991775|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2124991775, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2124991775, ~weak$$choice2~0=~weak$$choice2~0_In-2124991775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2124991775} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-2124991775, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2124991775, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-2124991775|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-2124991775|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2124991775, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2124991775, ~weak$$choice2~0=~weak$$choice2~0_In-2124991775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2124991775} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 11:23:00,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 11:23:00,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 11:23:00,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-873212152 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-873212152 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-873212152| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-873212152| ~x$w_buff0_used~0_In-873212152) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-873212152, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-873212152} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-873212152, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-873212152|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-873212152} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:23:00,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-1577560814 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1577560814 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1577560814 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1577560814 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1577560814 |P1Thread1of1ForFork0_#t~ite29_Out-1577560814|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1577560814|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1577560814, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1577560814, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1577560814, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577560814} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1577560814, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1577560814, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1577560814, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1577560814|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577560814} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:23:00,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1806904495 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1806904495 256) 0)) (.cse1 (= ~x$r_buff0_thd2~0_In1806904495 ~x$r_buff0_thd2~0_Out1806904495))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1806904495)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1806904495, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1806904495} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1806904495|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1806904495, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1806904495} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 11:23:00,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In264595830 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In264595830 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In264595830 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In264595830 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out264595830| ~x$r_buff1_thd2~0_In264595830)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out264595830| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In264595830, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In264595830, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In264595830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In264595830} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out264595830|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In264595830, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In264595830, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In264595830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In264595830} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 11:23:00,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 11:23:00,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:23:00,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite34_Out1922411015| |ULTIMATE.start_main_#t~ite35_Out1922411015|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1922411015 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1922411015 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out1922411015| ~x~0_In1922411015) .cse2) (and (= |ULTIMATE.start_main_#t~ite34_Out1922411015| ~x$w_buff1~0_In1922411015) .cse2 (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1922411015, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1922411015, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1922411015, ~x~0=~x~0_In1922411015} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1922411015, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1922411015|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1922411015, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1922411015, ~x~0=~x~0_In1922411015, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1922411015|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 11:23:00,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1820566776 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1820566776 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1820566776 |ULTIMATE.start_main_#t~ite36_Out-1820566776|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out-1820566776|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1820566776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1820566776} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1820566776, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1820566776|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1820566776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 11:23:00,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In11971479 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In11971479 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In11971479 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In11971479 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In11971479 |ULTIMATE.start_main_#t~ite37_Out11971479|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out11971479|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In11971479, ~x$w_buff1_used~0=~x$w_buff1_used~0_In11971479, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In11971479, ~x$w_buff0_used~0=~x$w_buff0_used~0_In11971479} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In11971479, ~x$w_buff1_used~0=~x$w_buff1_used~0_In11971479, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out11971479|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In11971479, ~x$w_buff0_used~0=~x$w_buff0_used~0_In11971479} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:23:00,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In826777742 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In826777742 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out826777742| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out826777742| ~x$r_buff0_thd0~0_In826777742) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In826777742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In826777742} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In826777742, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out826777742|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In826777742} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 11:23:00,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-163546025 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-163546025 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-163546025 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-163546025 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-163546025| ~x$r_buff1_thd0~0_In-163546025) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite39_Out-163546025| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-163546025, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-163546025, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-163546025, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-163546025} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-163546025, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-163546025|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-163546025, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-163546025, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-163546025} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:23:00,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:23:00,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:23:00 BasicIcfg [2019-12-07 11:23:00,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:23:00,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:23:00,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:23:00,441 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:23:00,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:22:55" (3/4) ... [2019-12-07 11:23:00,443 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:23:00,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= 0 v_~x$r_buff0_thd2~0_163) (= v_~x$r_buff0_thd0~0_130 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2569~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2569~0.base_24|) |v_ULTIMATE.start_main_~#t2569~0.offset_18| 0)) |v_#memory_int_11|) (= v_~y~0_90 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2569~0.base_24| 1)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= (select .cse0 |v_ULTIMATE.start_main_~#t2569~0.base_24|) 0) (= 0 v_~x$w_buff1_used~0_600) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2569~0.base_24|) (= 0 |v_ULTIMATE.start_main_~#t2569~0.offset_18|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2569~0.base_24| 4)) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, #length=|v_#length_15|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t2569~0.offset=|v_ULTIMATE.start_main_~#t2569~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ULTIMATE.start_main_~#t2570~0.offset=|v_ULTIMATE.start_main_~#t2570~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2569~0.base=|v_ULTIMATE.start_main_~#t2569~0.base_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ULTIMATE.start_main_~#t2570~0.base=|v_ULTIMATE.start_main_~#t2570~0.base_25|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t2569~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2570~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2569~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2570~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:23:00,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2570~0.base_11| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t2570~0.base_11| 0)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2570~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2570~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t2570~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2570~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2570~0.base_11|) |v_ULTIMATE.start_main_~#t2570~0.offset_9| 1))) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2570~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2570~0.offset=|v_ULTIMATE.start_main_~#t2570~0.offset_9|, ULTIMATE.start_main_~#t2570~0.base=|v_ULTIMATE.start_main_~#t2570~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2570~0.offset, ULTIMATE.start_main_~#t2570~0.base] because there is no mapped edge [2019-12-07 11:23:00,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:23:00,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2124991775 256)))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite8_Out-2124991775| |P0Thread1of1ForFork1_#t~ite9_Out-2124991775|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2124991775 256)))) (or (= (mod ~x$w_buff0_used~0_In-2124991775 256) 0) (and (= (mod ~x$w_buff1_used~0_In-2124991775 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2124991775 256))))) (= |P0Thread1of1ForFork1_#t~ite8_Out-2124991775| ~x$w_buff0~0_In-2124991775)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite9_Out-2124991775| ~x$w_buff0~0_In-2124991775) (= |P0Thread1of1ForFork1_#t~ite8_In-2124991775| |P0Thread1of1ForFork1_#t~ite8_Out-2124991775|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-2124991775, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2124991775, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-2124991775|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2124991775, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2124991775, ~weak$$choice2~0=~weak$$choice2~0_In-2124991775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2124991775} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-2124991775, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2124991775, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-2124991775|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-2124991775|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2124991775, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2124991775, ~weak$$choice2~0=~weak$$choice2~0_In-2124991775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2124991775} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 11:23:00,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 11:23:00,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 11:23:00,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-873212152 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-873212152 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-873212152| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-873212152| ~x$w_buff0_used~0_In-873212152) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-873212152, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-873212152} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-873212152, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-873212152|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-873212152} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:23:00,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-1577560814 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1577560814 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1577560814 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1577560814 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1577560814 |P1Thread1of1ForFork0_#t~ite29_Out-1577560814|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1577560814|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1577560814, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1577560814, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1577560814, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577560814} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1577560814, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1577560814, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1577560814, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1577560814|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577560814} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:23:00,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1806904495 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1806904495 256) 0)) (.cse1 (= ~x$r_buff0_thd2~0_In1806904495 ~x$r_buff0_thd2~0_Out1806904495))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1806904495)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1806904495, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1806904495} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1806904495|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1806904495, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1806904495} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 11:23:00,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In264595830 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In264595830 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In264595830 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In264595830 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out264595830| ~x$r_buff1_thd2~0_In264595830)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out264595830| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In264595830, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In264595830, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In264595830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In264595830} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out264595830|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In264595830, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In264595830, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In264595830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In264595830} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 11:23:00,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 11:23:00,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:23:00,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite34_Out1922411015| |ULTIMATE.start_main_#t~ite35_Out1922411015|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1922411015 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1922411015 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out1922411015| ~x~0_In1922411015) .cse2) (and (= |ULTIMATE.start_main_#t~ite34_Out1922411015| ~x$w_buff1~0_In1922411015) .cse2 (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1922411015, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1922411015, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1922411015, ~x~0=~x~0_In1922411015} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1922411015, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1922411015|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1922411015, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1922411015, ~x~0=~x~0_In1922411015, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1922411015|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 11:23:00,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1820566776 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1820566776 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1820566776 |ULTIMATE.start_main_#t~ite36_Out-1820566776|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out-1820566776|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1820566776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1820566776} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1820566776, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1820566776|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1820566776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 11:23:00,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In11971479 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In11971479 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In11971479 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In11971479 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In11971479 |ULTIMATE.start_main_#t~ite37_Out11971479|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out11971479|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In11971479, ~x$w_buff1_used~0=~x$w_buff1_used~0_In11971479, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In11971479, ~x$w_buff0_used~0=~x$w_buff0_used~0_In11971479} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In11971479, ~x$w_buff1_used~0=~x$w_buff1_used~0_In11971479, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out11971479|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In11971479, ~x$w_buff0_used~0=~x$w_buff0_used~0_In11971479} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:23:00,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In826777742 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In826777742 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out826777742| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out826777742| ~x$r_buff0_thd0~0_In826777742) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In826777742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In826777742} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In826777742, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out826777742|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In826777742} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 11:23:00,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-163546025 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-163546025 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-163546025 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-163546025 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-163546025| ~x$r_buff1_thd0~0_In-163546025) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite39_Out-163546025| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-163546025, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-163546025, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-163546025, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-163546025} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-163546025, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-163546025|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-163546025, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-163546025, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-163546025} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:23:00,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:23:00,512 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2f15f386-d2f7-44a8-952a-b13430fa5645/bin/uautomizer/witness.graphml [2019-12-07 11:23:00,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:23:00,514 INFO L168 Benchmark]: Toolchain (without parser) took 6189.38 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 251.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 118.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:23:00,514 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:23:00,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -137.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:23:00,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.43 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 11:23:00,515 INFO L168 Benchmark]: Boogie Preprocessor took 23.65 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 11:23:00,516 INFO L168 Benchmark]: RCFGBuilder took 351.07 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:23:00,516 INFO L168 Benchmark]: TraceAbstraction took 5304.52 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -64.9 MB). Peak memory consumption was 84.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:23:00,516 INFO L168 Benchmark]: Witness Printer took 71.62 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:23:00,519 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 395.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -137.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.43 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 23.65 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 351.07 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5304.52 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -64.9 MB). Peak memory consumption was 84.0 MB. Max. memory is 11.5 GB. * Witness Printer took 71.62 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 134 ProgramPointsBefore, 66 ProgramPointsAfterwards, 162 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4187 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 40283 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2569, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L792] FCALL, FORK 0 pthread_create(&t2570, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$r_buff0_thd2=1, 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] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$r_buff0_thd2=1, 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] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$r_buff0_thd2=1, 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] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 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 [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 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, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 5.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1099 SDtfs, 762 SDslu, 1403 SDs, 0 SdLazy, 630 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6362occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1878 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 34447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...