./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_power.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_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/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 7f42d731525094a6cd35949032977f8d605fc795 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 14:39:04,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:39:04,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:39:04,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:39:04,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:39:04,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:39:04,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:39:04,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:39:04,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:39:04,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:39:04,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:39:04,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:39:04,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:39:04,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:39:04,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:39:04,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:39:04,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:39:04,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:39:04,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:39:04,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:39:04,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:39:04,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:39:04,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:39:04,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:39:04,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:39:04,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:39:04,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:39:04,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:39:04,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:39:04,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:39:04,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:39:04,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:39:04,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:39:04,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:39:04,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:39:04,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:39:04,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:39:04,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:39:04,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:39:04,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:39:04,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:39:04,364 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:39:04,374 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:39:04,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:39:04,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:39:04,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:39:04,375 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:39:04,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:39:04,375 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:39:04,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:39:04,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:39:04,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:39:04,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:39:04,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:39:04,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:39:04,376 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:39:04,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:39:04,376 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:39:04,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:39:04,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:39:04,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:39:04,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:39:04,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:39:04,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:39:04,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:39:04,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:39:04,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:39:04,377 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:39:04,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:39:04,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:39:04,378 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:39:04,378 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_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/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 -> 7f42d731525094a6cd35949032977f8d605fc795 [2019-12-07 14:39:04,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:39:04,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:39:04,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:39:04,498 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:39:04,498 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:39:04,499 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc.i [2019-12-07 14:39:04,541 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/bin/uautomizer/data/fb0b44084/ddc1ba5738e94b7fa9c6263249469c7c/FLAG9e29a7bd2 [2019-12-07 14:39:04,950 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:39:04,950 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/sv-benchmarks/c/pthread-wmm/mix041_power.oepc.i [2019-12-07 14:39:04,961 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/bin/uautomizer/data/fb0b44084/ddc1ba5738e94b7fa9c6263249469c7c/FLAG9e29a7bd2 [2019-12-07 14:39:04,970 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/bin/uautomizer/data/fb0b44084/ddc1ba5738e94b7fa9c6263249469c7c [2019-12-07 14:39:04,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:39:04,973 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:39:04,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:39:04,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:39:04,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:39:04,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:39:04" (1/1) ... [2019-12-07 14:39:04,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:04, skipping insertion in model container [2019-12-07 14:39:04,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:39:04" (1/1) ... [2019-12-07 14:39:04,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:39:05,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:39:05,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:39:05,266 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:39:05,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:39:05,355 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:39:05,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:05 WrapperNode [2019-12-07 14:39:05,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:39:05,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:39:05,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:39:05,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:39:05,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:05" (1/1) ... [2019-12-07 14:39:05,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:05" (1/1) ... [2019-12-07 14:39:05,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:39:05,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:39:05,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:39:05,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:39:05,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:05" (1/1) ... [2019-12-07 14:39:05,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:05" (1/1) ... [2019-12-07 14:39:05,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:05" (1/1) ... [2019-12-07 14:39:05,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:05" (1/1) ... [2019-12-07 14:39:05,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:05" (1/1) ... [2019-12-07 14:39:05,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:05" (1/1) ... [2019-12-07 14:39:05,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:05" (1/1) ... [2019-12-07 14:39:05,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:39:05,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:39:05,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:39:05,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:39:05,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/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 14:39:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:39:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:39:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:39:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:39:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:39:05,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:39:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:39:05,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:39:05,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:39:05,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:39:05,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:39:05,467 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 14:39:05,806 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:39:05,806 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:39:05,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:39:05 BoogieIcfgContainer [2019-12-07 14:39:05,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:39:05,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:39:05,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:39:05,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:39:05,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:39:04" (1/3) ... [2019-12-07 14:39:05,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6573dc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:39:05, skipping insertion in model container [2019-12-07 14:39:05,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:39:05" (2/3) ... [2019-12-07 14:39:05,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6573dc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:39:05, skipping insertion in model container [2019-12-07 14:39:05,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:39:05" (3/3) ... [2019-12-07 14:39:05,811 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc.i [2019-12-07 14:39:05,817 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:39:05,817 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:39:05,822 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:39:05,822 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:39:05,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,845 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,845 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,845 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,846 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,846 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,850 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,851 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:39:05,873 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:39:05,885 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:39:05,885 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:39:05,885 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:39:05,885 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:39:05,885 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:39:05,885 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:39:05,886 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:39:05,886 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:39:05,896 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-07 14:39:05,897 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 14:39:05,945 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 14:39:05,945 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:39:05,953 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 576 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 14:39:05,964 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 14:39:05,989 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 14:39:05,989 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:39:05,993 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 576 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 14:39:06,003 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 14:39:06,004 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:39:08,409 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 14:39:08,729 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82827 [2019-12-07 14:39:08,730 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-07 14:39:08,732 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-07 14:39:09,089 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 14:39:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 14:39:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:39:09,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:09,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:39:09,096 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash 792296, now seen corresponding path program 1 times [2019-12-07 14:39:09,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:09,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321899539] [2019-12-07 14:39:09,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:09,238 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 14:39:09,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321899539] [2019-12-07 14:39:09,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:09,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:39:09,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005070223] [2019-12-07 14:39:09,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:39:09,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:09,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:39:09,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:39:09,260 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 14:39:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:09,442 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-07 14:39:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:39:09,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 14:39:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:09,503 INFO L225 Difference]: With dead ends: 8506 [2019-12-07 14:39:09,503 INFO L226 Difference]: Without dead ends: 7522 [2019-12-07 14:39:09,504 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 14:39:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-07 14:39:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-07 14:39:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-07 14:39:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-07 14:39:09,774 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-07 14:39:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:09,775 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-07 14:39:09,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:39:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-07 14:39:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:39:09,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:09,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:09,778 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:09,779 INFO L82 PathProgramCache]: Analyzing trace with hash -476377294, now seen corresponding path program 1 times [2019-12-07 14:39:09,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:09,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532307152] [2019-12-07 14:39:09,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:09,848 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 14:39:09,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532307152] [2019-12-07 14:39:09,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:09,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:39:09,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539286792] [2019-12-07 14:39:09,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:39:09,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:09,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:39:09,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:39:09,851 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 3 states. [2019-12-07 14:39:09,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:09,877 INFO L93 Difference]: Finished difference Result 1232 states and 2827 transitions. [2019-12-07 14:39:09,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:39:09,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 14:39:09,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:09,885 INFO L225 Difference]: With dead ends: 1232 [2019-12-07 14:39:09,885 INFO L226 Difference]: Without dead ends: 1232 [2019-12-07 14:39:09,886 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 14:39:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-07 14:39:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-07 14:39:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-07 14:39:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2827 transitions. [2019-12-07 14:39:09,914 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2827 transitions. Word has length 11 [2019-12-07 14:39:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:09,914 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2827 transitions. [2019-12-07 14:39:09,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:39:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2827 transitions. [2019-12-07 14:39:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:39:09,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:09,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:09,917 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:09,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash 394534895, now seen corresponding path program 1 times [2019-12-07 14:39:09,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:09,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514684325] [2019-12-07 14:39:09,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:09,961 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 14:39:09,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514684325] [2019-12-07 14:39:09,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:09,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:39:09,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773212925] [2019-12-07 14:39:09,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:39:09,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:09,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:39:09,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:39:09,963 INFO L87 Difference]: Start difference. First operand 1232 states and 2827 transitions. Second operand 3 states. [2019-12-07 14:39:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:10,008 INFO L93 Difference]: Finished difference Result 1960 states and 4354 transitions. [2019-12-07 14:39:10,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:39:10,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 14:39:10,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:10,016 INFO L225 Difference]: With dead ends: 1960 [2019-12-07 14:39:10,017 INFO L226 Difference]: Without dead ends: 1960 [2019-12-07 14:39:10,017 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 14:39:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2019-12-07 14:39:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1384. [2019-12-07 14:39:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-12-07 14:39:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3137 transitions. [2019-12-07 14:39:10,045 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3137 transitions. Word has length 14 [2019-12-07 14:39:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:10,045 INFO L462 AbstractCegarLoop]: Abstraction has 1384 states and 3137 transitions. [2019-12-07 14:39:10,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:39:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3137 transitions. [2019-12-07 14:39:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:39:10,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:10,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:10,047 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:10,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash 304327747, now seen corresponding path program 1 times [2019-12-07 14:39:10,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:10,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919545253] [2019-12-07 14:39:10,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:10,103 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 14:39:10,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919545253] [2019-12-07 14:39:10,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:10,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:39:10,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145498590] [2019-12-07 14:39:10,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:39:10,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:10,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:39:10,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:39:10,105 INFO L87 Difference]: Start difference. First operand 1384 states and 3137 transitions. Second operand 4 states. [2019-12-07 14:39:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:10,246 INFO L93 Difference]: Finished difference Result 1706 states and 3795 transitions. [2019-12-07 14:39:10,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:39:10,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:39:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:10,253 INFO L225 Difference]: With dead ends: 1706 [2019-12-07 14:39:10,253 INFO L226 Difference]: Without dead ends: 1706 [2019-12-07 14:39:10,253 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 14:39:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-07 14:39:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1646. [2019-12-07 14:39:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-12-07 14:39:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3679 transitions. [2019-12-07 14:39:10,279 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3679 transitions. Word has length 14 [2019-12-07 14:39:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:10,279 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 3679 transitions. [2019-12-07 14:39:10,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:39:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3679 transitions. [2019-12-07 14:39:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:39:10,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:10,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:10,280 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:10,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:10,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1071051512, now seen corresponding path program 1 times [2019-12-07 14:39:10,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:10,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134765193] [2019-12-07 14:39:10,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:10,324 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 14:39:10,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134765193] [2019-12-07 14:39:10,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:10,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:39:10,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948374339] [2019-12-07 14:39:10,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:39:10,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:10,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:39:10,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:39:10,326 INFO L87 Difference]: Start difference. First operand 1646 states and 3679 transitions. Second operand 4 states. [2019-12-07 14:39:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:10,447 INFO L93 Difference]: Finished difference Result 2032 states and 4499 transitions. [2019-12-07 14:39:10,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:39:10,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:39:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:10,456 INFO L225 Difference]: With dead ends: 2032 [2019-12-07 14:39:10,456 INFO L226 Difference]: Without dead ends: 2032 [2019-12-07 14:39:10,456 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 14:39:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-12-07 14:39:10,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1750. [2019-12-07 14:39:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-12-07 14:39:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3922 transitions. [2019-12-07 14:39:10,482 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 3922 transitions. Word has length 14 [2019-12-07 14:39:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:10,482 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 3922 transitions. [2019-12-07 14:39:10,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:39:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3922 transitions. [2019-12-07 14:39:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:39:10,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:10,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:10,484 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:10,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:10,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1681809556, now seen corresponding path program 1 times [2019-12-07 14:39:10,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:10,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666787324] [2019-12-07 14:39:10,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:10,540 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 14:39:10,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666787324] [2019-12-07 14:39:10,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:10,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:39:10,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252603950] [2019-12-07 14:39:10,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:39:10,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:10,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:39:10,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:39:10,541 INFO L87 Difference]: Start difference. First operand 1750 states and 3922 transitions. Second operand 5 states. [2019-12-07 14:39:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:10,695 INFO L93 Difference]: Finished difference Result 2284 states and 4985 transitions. [2019-12-07 14:39:10,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:39:10,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 14:39:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:10,704 INFO L225 Difference]: With dead ends: 2284 [2019-12-07 14:39:10,704 INFO L226 Difference]: Without dead ends: 2284 [2019-12-07 14:39:10,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:39:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-12-07 14:39:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2035. [2019-12-07 14:39:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-07 14:39:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4506 transitions. [2019-12-07 14:39:10,734 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4506 transitions. Word has length 25 [2019-12-07 14:39:10,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:10,734 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4506 transitions. [2019-12-07 14:39:10,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:39:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4506 transitions. [2019-12-07 14:39:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:39:10,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:10,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:10,736 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:10,736 INFO L82 PathProgramCache]: Analyzing trace with hash 968997935, now seen corresponding path program 1 times [2019-12-07 14:39:10,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:10,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027648205] [2019-12-07 14:39:10,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:10,761 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 14:39:10,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027648205] [2019-12-07 14:39:10,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:10,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:39:10,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321527639] [2019-12-07 14:39:10,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:39:10,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:10,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:39:10,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:39:10,762 INFO L87 Difference]: Start difference. First operand 2035 states and 4506 transitions. Second operand 3 states. [2019-12-07 14:39:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:10,791 INFO L93 Difference]: Finished difference Result 2578 states and 5509 transitions. [2019-12-07 14:39:10,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:39:10,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 14:39:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:10,799 INFO L225 Difference]: With dead ends: 2578 [2019-12-07 14:39:10,799 INFO L226 Difference]: Without dead ends: 2578 [2019-12-07 14:39:10,799 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 14:39:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-07 14:39:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1993. [2019-12-07 14:39:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-07 14:39:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4274 transitions. [2019-12-07 14:39:10,834 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4274 transitions. Word has length 25 [2019-12-07 14:39:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:10,834 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 4274 transitions. [2019-12-07 14:39:10,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:39:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4274 transitions. [2019-12-07 14:39:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:39:10,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:10,836 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 14:39:10,836 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:10,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1274554926, now seen corresponding path program 1 times [2019-12-07 14:39:10,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:10,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567372017] [2019-12-07 14:39:10,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:10,886 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 14:39:10,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567372017] [2019-12-07 14:39:10,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:10,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:39:10,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894856697] [2019-12-07 14:39:10,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:39:10,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:10,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:39:10,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:39:10,887 INFO L87 Difference]: Start difference. First operand 1993 states and 4274 transitions. Second operand 5 states. [2019-12-07 14:39:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:11,181 INFO L93 Difference]: Finished difference Result 2878 states and 6078 transitions. [2019-12-07 14:39:11,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:39:11,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 14:39:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:11,186 INFO L225 Difference]: With dead ends: 2878 [2019-12-07 14:39:11,186 INFO L226 Difference]: Without dead ends: 2878 [2019-12-07 14:39:11,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:39:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2019-12-07 14:39:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2455. [2019-12-07 14:39:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2455 states. [2019-12-07 14:39:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 5239 transitions. [2019-12-07 14:39:11,222 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 5239 transitions. Word has length 26 [2019-12-07 14:39:11,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:11,222 INFO L462 AbstractCegarLoop]: Abstraction has 2455 states and 5239 transitions. [2019-12-07 14:39:11,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:39:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 5239 transitions. [2019-12-07 14:39:11,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:39:11,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:11,224 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 14:39:11,224 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:11,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:11,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1286104553, now seen corresponding path program 1 times [2019-12-07 14:39:11,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:11,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198734394] [2019-12-07 14:39:11,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:11,282 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 14:39:11,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198734394] [2019-12-07 14:39:11,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:11,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:39:11,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272821196] [2019-12-07 14:39:11,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:39:11,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:11,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:39:11,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:39:11,284 INFO L87 Difference]: Start difference. First operand 2455 states and 5239 transitions. Second operand 5 states. [2019-12-07 14:39:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:11,447 INFO L93 Difference]: Finished difference Result 2934 states and 6185 transitions. [2019-12-07 14:39:11,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:39:11,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 14:39:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:11,451 INFO L225 Difference]: With dead ends: 2934 [2019-12-07 14:39:11,451 INFO L226 Difference]: Without dead ends: 2934 [2019-12-07 14:39:11,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:39:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2019-12-07 14:39:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2422. [2019-12-07 14:39:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2422 states. [2019-12-07 14:39:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 5163 transitions. [2019-12-07 14:39:11,484 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 5163 transitions. Word has length 26 [2019-12-07 14:39:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:11,484 INFO L462 AbstractCegarLoop]: Abstraction has 2422 states and 5163 transitions. [2019-12-07 14:39:11,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:39:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 5163 transitions. [2019-12-07 14:39:11,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:39:11,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:11,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:11,488 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:11,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:11,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1537408145, now seen corresponding path program 1 times [2019-12-07 14:39:11,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:11,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503953511] [2019-12-07 14:39:11,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:11,553 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 14:39:11,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503953511] [2019-12-07 14:39:11,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:11,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:39:11,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539433127] [2019-12-07 14:39:11,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:39:11,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:11,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:39:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:39:11,554 INFO L87 Difference]: Start difference. First operand 2422 states and 5163 transitions. Second operand 3 states. [2019-12-07 14:39:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:11,576 INFO L93 Difference]: Finished difference Result 4221 states and 9049 transitions. [2019-12-07 14:39:11,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:39:11,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 14:39:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:11,584 INFO L225 Difference]: With dead ends: 4221 [2019-12-07 14:39:11,585 INFO L226 Difference]: Without dead ends: 3506 [2019-12-07 14:39:11,585 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 14:39:11,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2019-12-07 14:39:11,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3490. [2019-12-07 14:39:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-12-07 14:39:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 7474 transitions. [2019-12-07 14:39:11,656 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 7474 transitions. Word has length 27 [2019-12-07 14:39:11,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:11,656 INFO L462 AbstractCegarLoop]: Abstraction has 3490 states and 7474 transitions. [2019-12-07 14:39:11,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:39:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 7474 transitions. [2019-12-07 14:39:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:39:11,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:11,659 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:11,659 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1804230119, now seen corresponding path program 1 times [2019-12-07 14:39:11,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:11,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449259154] [2019-12-07 14:39:11,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:11,693 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 14:39:11,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449259154] [2019-12-07 14:39:11,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:11,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:39:11,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027736421] [2019-12-07 14:39:11,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:39:11,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:11,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:39:11,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:39:11,694 INFO L87 Difference]: Start difference. First operand 3490 states and 7474 transitions. Second operand 4 states. [2019-12-07 14:39:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:11,706 INFO L93 Difference]: Finished difference Result 2022 states and 4139 transitions. [2019-12-07 14:39:11,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:39:11,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 14:39:11,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:11,709 INFO L225 Difference]: With dead ends: 2022 [2019-12-07 14:39:11,709 INFO L226 Difference]: Without dead ends: 1979 [2019-12-07 14:39:11,709 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 14:39:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-12-07 14:39:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1221. [2019-12-07 14:39:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-12-07 14:39:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 2510 transitions. [2019-12-07 14:39:11,727 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 2510 transitions. Word has length 28 [2019-12-07 14:39:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:11,727 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 2510 transitions. [2019-12-07 14:39:11,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:39:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 2510 transitions. [2019-12-07 14:39:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 14:39:11,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:11,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:11,729 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:11,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1370475912, now seen corresponding path program 1 times [2019-12-07 14:39:11,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:11,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756109582] [2019-12-07 14:39:11,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:11,797 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 14:39:11,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756109582] [2019-12-07 14:39:11,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:11,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:39:11,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885524613] [2019-12-07 14:39:11,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:39:11,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:11,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:39:11,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:39:11,799 INFO L87 Difference]: Start difference. First operand 1221 states and 2510 transitions. Second operand 6 states. [2019-12-07 14:39:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:12,152 INFO L93 Difference]: Finished difference Result 1600 states and 3225 transitions. [2019-12-07 14:39:12,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:39:12,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-07 14:39:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:12,155 INFO L225 Difference]: With dead ends: 1600 [2019-12-07 14:39:12,155 INFO L226 Difference]: Without dead ends: 1600 [2019-12-07 14:39:12,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:39:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2019-12-07 14:39:12,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1284. [2019-12-07 14:39:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-07 14:39:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2634 transitions. [2019-12-07 14:39:12,178 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2634 transitions. Word has length 51 [2019-12-07 14:39:12,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:12,179 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2634 transitions. [2019-12-07 14:39:12,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:39:12,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2634 transitions. [2019-12-07 14:39:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 14:39:12,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:12,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:12,181 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:12,182 INFO L82 PathProgramCache]: Analyzing trace with hash -678347650, now seen corresponding path program 2 times [2019-12-07 14:39:12,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:12,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37189356] [2019-12-07 14:39:12,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:12,240 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 14:39:12,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37189356] [2019-12-07 14:39:12,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:12,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:39:12,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489824689] [2019-12-07 14:39:12,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:39:12,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:12,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:39:12,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:39:12,242 INFO L87 Difference]: Start difference. First operand 1284 states and 2634 transitions. Second operand 5 states. [2019-12-07 14:39:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:12,376 INFO L93 Difference]: Finished difference Result 1413 states and 2867 transitions. [2019-12-07 14:39:12,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:39:12,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 14:39:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:12,379 INFO L225 Difference]: With dead ends: 1413 [2019-12-07 14:39:12,379 INFO L226 Difference]: Without dead ends: 1413 [2019-12-07 14:39:12,379 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 14:39:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-12-07 14:39:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1292. [2019-12-07 14:39:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-12-07 14:39:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2651 transitions. [2019-12-07 14:39:12,397 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2651 transitions. Word has length 51 [2019-12-07 14:39:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:12,398 INFO L462 AbstractCegarLoop]: Abstraction has 1292 states and 2651 transitions. [2019-12-07 14:39:12,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:39:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2651 transitions. [2019-12-07 14:39:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 14:39:12,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:12,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:12,401 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:12,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1065259256, now seen corresponding path program 3 times [2019-12-07 14:39:12,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:12,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165445305] [2019-12-07 14:39:12,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:12,480 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 14:39:12,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165445305] [2019-12-07 14:39:12,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:12,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:39:12,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172052134] [2019-12-07 14:39:12,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:39:12,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:12,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:39:12,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:39:12,481 INFO L87 Difference]: Start difference. First operand 1292 states and 2651 transitions. Second operand 3 states. [2019-12-07 14:39:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:12,493 INFO L93 Difference]: Finished difference Result 1292 states and 2650 transitions. [2019-12-07 14:39:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:39:12,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 14:39:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:12,497 INFO L225 Difference]: With dead ends: 1292 [2019-12-07 14:39:12,497 INFO L226 Difference]: Without dead ends: 1292 [2019-12-07 14:39:12,497 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 14:39:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-07 14:39:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1069. [2019-12-07 14:39:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-12-07 14:39:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2232 transitions. [2019-12-07 14:39:12,513 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2232 transitions. Word has length 51 [2019-12-07 14:39:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:12,514 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 2232 transitions. [2019-12-07 14:39:12,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:39:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2232 transitions. [2019-12-07 14:39:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:39:12,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:12,516 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:12,516 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:12,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:12,516 INFO L82 PathProgramCache]: Analyzing trace with hash -234851773, now seen corresponding path program 1 times [2019-12-07 14:39:12,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:12,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305958975] [2019-12-07 14:39:12,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:12,579 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 14:39:12,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305958975] [2019-12-07 14:39:12,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:12,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:39:12,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286347034] [2019-12-07 14:39:12,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:39:12,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:12,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:39:12,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:39:12,580 INFO L87 Difference]: Start difference. First operand 1069 states and 2232 transitions. Second operand 3 states. [2019-12-07 14:39:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:12,617 INFO L93 Difference]: Finished difference Result 1262 states and 2633 transitions. [2019-12-07 14:39:12,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:39:12,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 14:39:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:12,619 INFO L225 Difference]: With dead ends: 1262 [2019-12-07 14:39:12,619 INFO L226 Difference]: Without dead ends: 1262 [2019-12-07 14:39:12,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 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 14:39:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-12-07 14:39:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 967. [2019-12-07 14:39:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2019-12-07 14:39:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 2040 transitions. [2019-12-07 14:39:12,634 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 2040 transitions. Word has length 52 [2019-12-07 14:39:12,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:12,634 INFO L462 AbstractCegarLoop]: Abstraction has 967 states and 2040 transitions. [2019-12-07 14:39:12,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:39:12,634 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 2040 transitions. [2019-12-07 14:39:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:39:12,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:12,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:12,636 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:12,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:12,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1478308957, now seen corresponding path program 1 times [2019-12-07 14:39:12,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:12,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297189538] [2019-12-07 14:39:12,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:12,703 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 14:39:12,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297189538] [2019-12-07 14:39:12,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:12,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:39:12,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993147130] [2019-12-07 14:39:12,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:39:12,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:39:12,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:39:12,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:39:12,704 INFO L87 Difference]: Start difference. First operand 967 states and 2040 transitions. Second operand 7 states. [2019-12-07 14:39:12,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:12,900 INFO L93 Difference]: Finished difference Result 2774 states and 5695 transitions. [2019-12-07 14:39:12,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:39:12,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 14:39:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:12,903 INFO L225 Difference]: With dead ends: 2774 [2019-12-07 14:39:12,903 INFO L226 Difference]: Without dead ends: 1881 [2019-12-07 14:39:12,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:39:12,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2019-12-07 14:39:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1024. [2019-12-07 14:39:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2019-12-07 14:39:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2144 transitions. [2019-12-07 14:39:12,916 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2144 transitions. Word has length 53 [2019-12-07 14:39:12,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:12,917 INFO L462 AbstractCegarLoop]: Abstraction has 1024 states and 2144 transitions. [2019-12-07 14:39:12,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:39:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2144 transitions. [2019-12-07 14:39:12,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:39:12,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:12,918 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:12,918 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:12,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash -409769665, now seen corresponding path program 2 times [2019-12-07 14:39:12,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:39:12,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502481888] [2019-12-07 14:39:12,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:39:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:39:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:39:12,987 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:39:12,987 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:39:12,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= |v_ULTIMATE.start_main_~#t1089~0.offset_19| 0) (= v_~z$mem_tmp~0_25 0) (= v_~y~0_23 0) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1089~0.base_27|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1089~0.base_27| 1) |v_#valid_58|) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$r_buff0_thd1~0_174 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_45) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1089~0.base_27|)) (= v_~z$w_buff0~0_252 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1089~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1089~0.base_27|) |v_ULTIMATE.start_main_~#t1089~0.offset_19| 0)) |v_#memory_int_11|) (= v_~z~0_120 0) (= v_~z$r_buff0_thd0~0_134 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~main$tmp_guard0~0_20 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_33) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_196 0) (= v_~z$r_buff1_thd0~0_144 0) (= 0 v_~weak$$choice2~0_99) (= v_~z$w_buff0_used~0_606 0) (= v_~z$w_buff1_used~0_306 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1089~0.base_27| 4)) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$r_buff0_thd2~0_279 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_160, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_~#t1090~0.base=|v_ULTIMATE.start_main_~#t1090~0.base_22|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_370|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_93|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ULTIMATE.start_main_~#t1089~0.offset=|v_ULTIMATE.start_main_~#t1089~0.offset_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, #length=|v_#length_17|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_279, ~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_606, ~z$w_buff0~0=v_~z$w_buff0~0_252, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_306, ~z$flush_delayed~0=v_~z$flush_delayed~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_23, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_22|, ULTIMATE.start_main_~#t1089~0.base=|v_ULTIMATE.start_main_~#t1089~0.base_27|, ULTIMATE.start_main_~#t1090~0.offset=|v_ULTIMATE.start_main_~#t1090~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_58|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~z~0=v_~z~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~x~0=v_~x~0_98} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1090~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1089~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1089~0.base, ULTIMATE.start_main_~#t1090~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 14:39:12,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~z$r_buff1_thd2~0_Out-1091220198 ~z$r_buff0_thd2~0_In-1091220198) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1091220198)) (= ~z$r_buff0_thd1~0_In-1091220198 ~z$r_buff1_thd1~0_Out-1091220198) (= 1 ~x~0_Out-1091220198) (= ~z$r_buff0_thd0~0_In-1091220198 ~z$r_buff1_thd0~0_Out-1091220198) (= 1 ~z$r_buff0_thd1~0_Out-1091220198)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1091220198, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1091220198, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1091220198, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1091220198} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1091220198, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1091220198, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1091220198, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1091220198, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1091220198, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1091220198, ~x~0=~x~0_Out-1091220198, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1091220198} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 14:39:12,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1090~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1090~0.base_11|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1090~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1090~0.base_11|) |v_ULTIMATE.start_main_~#t1090~0.offset_10| 1))) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1090~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1090~0.offset_10|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1090~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1090~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1090~0.offset=|v_ULTIMATE.start_main_~#t1090~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1090~0.base=|v_ULTIMATE.start_main_~#t1090~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1090~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1090~0.base] because there is no mapped edge [2019-12-07 14:39:12,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2121363527 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2121363527 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2121363527| ~z$w_buff0_used~0_In2121363527)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2121363527| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2121363527, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121363527} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2121363527|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2121363527, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121363527} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:39:12,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-921525876 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-921525876 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-921525876 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-921525876 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-921525876 |P0Thread1of1ForFork0_#t~ite6_Out-921525876|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-921525876| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-921525876, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-921525876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-921525876, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-921525876} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-921525876|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-921525876, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-921525876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-921525876, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-921525876} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:39:12,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-629745605 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-629745605 256))) (.cse2 (= ~z$r_buff0_thd1~0_Out-629745605 ~z$r_buff0_thd1~0_In-629745605))) (or (and (= ~z$r_buff0_thd1~0_Out-629745605 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-629745605, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-629745605} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-629745605, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-629745605|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-629745605} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:39:12,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In2105048073 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2105048073 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In2105048073 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In2105048073 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out2105048073| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out2105048073| ~z$r_buff1_thd1~0_In2105048073)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2105048073, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2105048073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2105048073, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2105048073} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2105048073, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2105048073|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2105048073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2105048073, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2105048073} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:39:12,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:39:12,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_61 v_~z$r_buff0_thd2~0_60)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_61} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 14:39:12,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-454154949 256)))) (or (and (= ~z$r_buff1_thd2~0_In-454154949 |P1Thread1of1ForFork1_#t~ite29_Out-454154949|) (= |P1Thread1of1ForFork1_#t~ite30_Out-454154949| |P1Thread1of1ForFork1_#t~ite29_Out-454154949|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-454154949 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-454154949 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In-454154949 256) 0)) (= (mod ~z$w_buff0_used~0_In-454154949 256) 0)))) (and (= |P1Thread1of1ForFork1_#t~ite29_In-454154949| |P1Thread1of1ForFork1_#t~ite29_Out-454154949|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-454154949| ~z$r_buff1_thd2~0_In-454154949)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-454154949|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-454154949, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-454154949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-454154949, ~weak$$choice2~0=~weak$$choice2~0_In-454154949, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-454154949} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-454154949|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-454154949|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-454154949, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-454154949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-454154949, ~weak$$choice2~0=~weak$$choice2~0_In-454154949, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-454154949} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 14:39:12,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~z~0_27 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_8) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 14:39:12,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1816745652 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1816745652 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1816745652| ~z$w_buff1~0_In1816745652) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1816745652| ~z~0_In1816745652)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1816745652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816745652, ~z$w_buff1~0=~z$w_buff1~0_In1816745652, ~z~0=~z~0_In1816745652} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1816745652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816745652, ~z$w_buff1~0=~z$w_buff1~0_In1816745652, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1816745652|, ~z~0=~z~0_In1816745652} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:39:12,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_39 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~z~0=v_~z~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-12-07 14:39:12,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-661797671 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-661797671 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-661797671|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-661797671 |P1Thread1of1ForFork1_#t~ite34_Out-661797671|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-661797671, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-661797671} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-661797671, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-661797671|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-661797671} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:39:12,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In654265737 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In654265737 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In654265737 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In654265737 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out654265737| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out654265737| ~z$w_buff1_used~0_In654265737) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In654265737, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In654265737, ~z$w_buff1_used~0=~z$w_buff1_used~0_In654265737, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In654265737} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In654265737, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In654265737, ~z$w_buff1_used~0=~z$w_buff1_used~0_In654265737, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out654265737|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In654265737} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:39:12,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-715104310 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-715104310 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-715104310|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-715104310 |P1Thread1of1ForFork1_#t~ite36_Out-715104310|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-715104310, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-715104310} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-715104310, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-715104310, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-715104310|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:39:12,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-946427230 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-946427230 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-946427230 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-946427230 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-946427230 |P1Thread1of1ForFork1_#t~ite37_Out-946427230|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-946427230|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-946427230, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-946427230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-946427230, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-946427230} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-946427230, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-946427230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-946427230, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-946427230, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-946427230|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:39:12,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~z$r_buff1_thd2~0_88) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:39:12,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_16) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 14:39:12,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-152873049 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite40_Out-152873049| |ULTIMATE.start_main_#t~ite41_Out-152873049|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-152873049 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-152873049| ~z~0_In-152873049) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-152873049| ~z$w_buff1~0_In-152873049) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-152873049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-152873049, ~z$w_buff1~0=~z$w_buff1~0_In-152873049, ~z~0=~z~0_In-152873049} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-152873049|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-152873049|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-152873049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-152873049, ~z$w_buff1~0=~z$w_buff1~0_In-152873049, ~z~0=~z~0_In-152873049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 14:39:12,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2114624376 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2114624376 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2114624376 |ULTIMATE.start_main_#t~ite42_Out-2114624376|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-2114624376|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2114624376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2114624376} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2114624376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2114624376, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2114624376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 14:39:12,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1811484376 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1811484376 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1811484376 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1811484376 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1811484376| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1811484376| ~z$w_buff1_used~0_In-1811484376) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1811484376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1811484376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1811484376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1811484376} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1811484376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1811484376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1811484376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1811484376, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1811484376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:39:12,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In197766721 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In197766721 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out197766721|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In197766721 |ULTIMATE.start_main_#t~ite44_Out197766721|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In197766721, ~z$w_buff0_used~0=~z$w_buff0_used~0_In197766721} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In197766721, ~z$w_buff0_used~0=~z$w_buff0_used~0_In197766721, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out197766721|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:39:12,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-746861885 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-746861885 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-746861885 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-746861885 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-746861885| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out-746861885| ~z$r_buff1_thd0~0_In-746861885) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-746861885, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746861885, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-746861885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-746861885} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-746861885, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746861885, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-746861885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-746861885, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-746861885|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:39:12,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_107 |v_ULTIMATE.start_main_#t~ite45_60|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_28) (= v_~x~0_67 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_22) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_22 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_107, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_59|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:39:13,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:39:13 BasicIcfg [2019-12-07 14:39:13,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:39:13,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:39:13,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:39:13,039 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:39:13,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:39:05" (3/4) ... [2019-12-07 14:39:13,041 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:39:13,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= |v_ULTIMATE.start_main_~#t1089~0.offset_19| 0) (= v_~z$mem_tmp~0_25 0) (= v_~y~0_23 0) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1089~0.base_27|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1089~0.base_27| 1) |v_#valid_58|) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$r_buff0_thd1~0_174 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_45) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1089~0.base_27|)) (= v_~z$w_buff0~0_252 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1089~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1089~0.base_27|) |v_ULTIMATE.start_main_~#t1089~0.offset_19| 0)) |v_#memory_int_11|) (= v_~z~0_120 0) (= v_~z$r_buff0_thd0~0_134 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~main$tmp_guard0~0_20 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_33) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_196 0) (= v_~z$r_buff1_thd0~0_144 0) (= 0 v_~weak$$choice2~0_99) (= v_~z$w_buff0_used~0_606 0) (= v_~z$w_buff1_used~0_306 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1089~0.base_27| 4)) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$r_buff0_thd2~0_279 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_160, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_~#t1090~0.base=|v_ULTIMATE.start_main_~#t1090~0.base_22|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_370|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_93|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ULTIMATE.start_main_~#t1089~0.offset=|v_ULTIMATE.start_main_~#t1089~0.offset_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, #length=|v_#length_17|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_279, ~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_606, ~z$w_buff0~0=v_~z$w_buff0~0_252, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_306, ~z$flush_delayed~0=v_~z$flush_delayed~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_23, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_22|, ULTIMATE.start_main_~#t1089~0.base=|v_ULTIMATE.start_main_~#t1089~0.base_27|, ULTIMATE.start_main_~#t1090~0.offset=|v_ULTIMATE.start_main_~#t1090~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_58|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~z~0=v_~z~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~x~0=v_~x~0_98} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1090~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1089~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1089~0.base, ULTIMATE.start_main_~#t1090~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 14:39:13,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~z$r_buff1_thd2~0_Out-1091220198 ~z$r_buff0_thd2~0_In-1091220198) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1091220198)) (= ~z$r_buff0_thd1~0_In-1091220198 ~z$r_buff1_thd1~0_Out-1091220198) (= 1 ~x~0_Out-1091220198) (= ~z$r_buff0_thd0~0_In-1091220198 ~z$r_buff1_thd0~0_Out-1091220198) (= 1 ~z$r_buff0_thd1~0_Out-1091220198)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1091220198, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1091220198, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1091220198, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1091220198} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1091220198, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1091220198, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1091220198, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1091220198, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1091220198, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1091220198, ~x~0=~x~0_Out-1091220198, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1091220198} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 14:39:13,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1090~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1090~0.base_11|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1090~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1090~0.base_11|) |v_ULTIMATE.start_main_~#t1090~0.offset_10| 1))) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1090~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1090~0.offset_10|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1090~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1090~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1090~0.offset=|v_ULTIMATE.start_main_~#t1090~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1090~0.base=|v_ULTIMATE.start_main_~#t1090~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1090~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1090~0.base] because there is no mapped edge [2019-12-07 14:39:13,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2121363527 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2121363527 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2121363527| ~z$w_buff0_used~0_In2121363527)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2121363527| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2121363527, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121363527} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2121363527|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2121363527, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121363527} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:39:13,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-921525876 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-921525876 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-921525876 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-921525876 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-921525876 |P0Thread1of1ForFork0_#t~ite6_Out-921525876|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-921525876| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-921525876, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-921525876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-921525876, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-921525876} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-921525876|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-921525876, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-921525876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-921525876, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-921525876} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:39:13,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-629745605 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-629745605 256))) (.cse2 (= ~z$r_buff0_thd1~0_Out-629745605 ~z$r_buff0_thd1~0_In-629745605))) (or (and (= ~z$r_buff0_thd1~0_Out-629745605 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-629745605, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-629745605} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-629745605, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-629745605|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-629745605} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:39:13,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In2105048073 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2105048073 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In2105048073 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In2105048073 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out2105048073| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out2105048073| ~z$r_buff1_thd1~0_In2105048073)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2105048073, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2105048073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2105048073, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2105048073} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2105048073, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2105048073|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2105048073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2105048073, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2105048073} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:39:13,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:39:13,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_61 v_~z$r_buff0_thd2~0_60)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_61} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 14:39:13,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-454154949 256)))) (or (and (= ~z$r_buff1_thd2~0_In-454154949 |P1Thread1of1ForFork1_#t~ite29_Out-454154949|) (= |P1Thread1of1ForFork1_#t~ite30_Out-454154949| |P1Thread1of1ForFork1_#t~ite29_Out-454154949|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-454154949 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-454154949 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In-454154949 256) 0)) (= (mod ~z$w_buff0_used~0_In-454154949 256) 0)))) (and (= |P1Thread1of1ForFork1_#t~ite29_In-454154949| |P1Thread1of1ForFork1_#t~ite29_Out-454154949|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-454154949| ~z$r_buff1_thd2~0_In-454154949)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-454154949|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-454154949, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-454154949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-454154949, ~weak$$choice2~0=~weak$$choice2~0_In-454154949, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-454154949} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-454154949|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-454154949|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-454154949, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-454154949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-454154949, ~weak$$choice2~0=~weak$$choice2~0_In-454154949, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-454154949} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 14:39:13,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~z~0_27 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_8) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 14:39:13,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1816745652 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1816745652 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1816745652| ~z$w_buff1~0_In1816745652) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1816745652| ~z~0_In1816745652)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1816745652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816745652, ~z$w_buff1~0=~z$w_buff1~0_In1816745652, ~z~0=~z~0_In1816745652} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1816745652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816745652, ~z$w_buff1~0=~z$w_buff1~0_In1816745652, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1816745652|, ~z~0=~z~0_In1816745652} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:39:13,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_39 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~z~0=v_~z~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-12-07 14:39:13,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-661797671 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-661797671 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-661797671|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-661797671 |P1Thread1of1ForFork1_#t~ite34_Out-661797671|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-661797671, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-661797671} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-661797671, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-661797671|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-661797671} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:39:13,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In654265737 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In654265737 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In654265737 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In654265737 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out654265737| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out654265737| ~z$w_buff1_used~0_In654265737) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In654265737, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In654265737, ~z$w_buff1_used~0=~z$w_buff1_used~0_In654265737, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In654265737} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In654265737, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In654265737, ~z$w_buff1_used~0=~z$w_buff1_used~0_In654265737, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out654265737|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In654265737} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:39:13,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-715104310 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-715104310 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-715104310|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-715104310 |P1Thread1of1ForFork1_#t~ite36_Out-715104310|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-715104310, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-715104310} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-715104310, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-715104310, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-715104310|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:39:13,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-946427230 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-946427230 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-946427230 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-946427230 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-946427230 |P1Thread1of1ForFork1_#t~ite37_Out-946427230|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-946427230|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-946427230, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-946427230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-946427230, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-946427230} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-946427230, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-946427230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-946427230, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-946427230, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-946427230|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:39:13,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~z$r_buff1_thd2~0_88) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:39:13,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_16) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 14:39:13,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-152873049 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite40_Out-152873049| |ULTIMATE.start_main_#t~ite41_Out-152873049|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-152873049 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-152873049| ~z~0_In-152873049) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-152873049| ~z$w_buff1~0_In-152873049) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-152873049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-152873049, ~z$w_buff1~0=~z$w_buff1~0_In-152873049, ~z~0=~z~0_In-152873049} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-152873049|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-152873049|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-152873049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-152873049, ~z$w_buff1~0=~z$w_buff1~0_In-152873049, ~z~0=~z~0_In-152873049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 14:39:13,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2114624376 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2114624376 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2114624376 |ULTIMATE.start_main_#t~ite42_Out-2114624376|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-2114624376|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2114624376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2114624376} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2114624376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2114624376, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2114624376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 14:39:13,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1811484376 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1811484376 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1811484376 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1811484376 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1811484376| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1811484376| ~z$w_buff1_used~0_In-1811484376) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1811484376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1811484376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1811484376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1811484376} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1811484376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1811484376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1811484376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1811484376, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1811484376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:39:13,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In197766721 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In197766721 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out197766721|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In197766721 |ULTIMATE.start_main_#t~ite44_Out197766721|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In197766721, ~z$w_buff0_used~0=~z$w_buff0_used~0_In197766721} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In197766721, ~z$w_buff0_used~0=~z$w_buff0_used~0_In197766721, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out197766721|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:39:13,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-746861885 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-746861885 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-746861885 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-746861885 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-746861885| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out-746861885| ~z$r_buff1_thd0~0_In-746861885) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-746861885, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746861885, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-746861885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-746861885} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-746861885, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746861885, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-746861885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-746861885, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-746861885|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:39:13,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_107 |v_ULTIMATE.start_main_#t~ite45_60|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_28) (= v_~x~0_67 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_22) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_22 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_107, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_59|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:39:13,107 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a7bc56de-4d23-49d9-8b2a-518cfdaf8898/bin/uautomizer/witness.graphml [2019-12-07 14:39:13,107 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:39:13,108 INFO L168 Benchmark]: Toolchain (without parser) took 8135.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.5 MB). Free memory was 944.6 MB in the beginning and 1.3 GB in the end (delta: -362.9 MB). Peak memory consumption was 373.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:39:13,108 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:39:13,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:39:13,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.56 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 14:39:13,109 INFO L168 Benchmark]: Boogie Preprocessor took 24.92 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 14:39:13,109 INFO L168 Benchmark]: RCFGBuilder took 387.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:39:13,109 INFO L168 Benchmark]: TraceAbstraction took 7230.98 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 114.8 MB). Free memory was 1.0 GB in the beginning and 798.7 MB in the end (delta: 226.1 MB). Peak memory consumption was 340.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:39:13,110 INFO L168 Benchmark]: Witness Printer took 68.47 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 110.6 MB). Free memory was 798.7 MB in the beginning and 1.3 GB in the end (delta: -508.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:39:13,111 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.56 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 24.92 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 387.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7230.98 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 114.8 MB). Free memory was 1.0 GB in the beginning and 798.7 MB in the end (delta: 226.1 MB). Peak memory consumption was 340.9 MB. Max. memory is 11.5 GB. * Witness Printer took 68.47 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 110.6 MB). Free memory was 798.7 MB in the beginning and 1.3 GB in the end (delta: -508.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.8s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 13 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 4608 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 82827 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1089, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t1090, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2136 SDtfs, 1454 SDslu, 3684 SDs, 0 SdLazy, 1934 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 5273 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 88719 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...