./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_pso.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_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/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 73f223ea09ae1d01ec80d75737e558f25a1a2bd2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:38:29,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:38:29,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:38:29,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:38:29,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:38:29,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:38:29,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:38:29,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:38:29,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:38:29,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:38:29,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:38:29,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:38:29,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:38:29,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:38:29,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:38:29,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:38:29,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:38:29,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:38:29,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:38:29,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:38:29,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:38:29,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:38:29,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:38:29,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:38:29,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:38:29,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:38:29,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:38:29,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:38:29,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:38:29,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:38:29,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:38:29,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:38:29,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:38:29,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:38:29,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:38:29,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:38:29,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:38:29,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:38:29,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:38:29,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:38:29,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:38:29,586 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:38:29,596 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:38:29,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:38:29,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:38:29,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:38:29,597 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:38:29,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:38:29,597 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:38:29,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:38:29,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:38:29,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:38:29,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:38:29,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:38:29,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:38:29,598 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:38:29,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:38:29,598 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:38:29,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:38:29,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:38:29,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:38:29,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:38:29,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:38:29,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:38:29,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:38:29,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:38:29,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:38:29,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:38:29,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:38:29,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:38:29,600 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:38:29,600 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_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/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 -> 73f223ea09ae1d01ec80d75737e558f25a1a2bd2 [2019-12-07 17:38:29,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:38:29,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:38:29,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:38:29,711 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:38:29,712 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:38:29,712 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i [2019-12-07 17:38:29,751 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/bin/uautomizer/data/741df302f/e53da6901a7440bd9d1dbf5e73ab2c49/FLAGdf88b2ed7 [2019-12-07 17:38:30,192 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:38:30,192 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i [2019-12-07 17:38:30,204 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/bin/uautomizer/data/741df302f/e53da6901a7440bd9d1dbf5e73ab2c49/FLAGdf88b2ed7 [2019-12-07 17:38:30,541 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/bin/uautomizer/data/741df302f/e53da6901a7440bd9d1dbf5e73ab2c49 [2019-12-07 17:38:30,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:38:30,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:38:30,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:38:30,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:38:30,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:38:30,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:38:30" (1/1) ... [2019-12-07 17:38:30,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296938c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30, skipping insertion in model container [2019-12-07 17:38:30,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:38:30" (1/1) ... [2019-12-07 17:38:30,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:38:30,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:38:30,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:38:30,854 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:38:30,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:38:30,938 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:38:30,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30 WrapperNode [2019-12-07 17:38:30,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:38:30,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:38:30,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:38:30,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:38:30,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30" (1/1) ... [2019-12-07 17:38:30,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30" (1/1) ... [2019-12-07 17:38:30,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:38:30,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:38:30,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:38:30,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:38:30,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30" (1/1) ... [2019-12-07 17:38:30,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30" (1/1) ... [2019-12-07 17:38:30,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30" (1/1) ... [2019-12-07 17:38:30,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30" (1/1) ... [2019-12-07 17:38:30,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30" (1/1) ... [2019-12-07 17:38:30,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30" (1/1) ... [2019-12-07 17:38:30,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30" (1/1) ... [2019-12-07 17:38:30,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:38:30,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:38:30,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:38:30,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:38:30,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/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 17:38:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:38:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:38:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:38:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:38:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:38:31,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:38:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:38:31,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:38:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:38:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:38:31,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:38:31,040 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 17:38:31,362 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:38:31,362 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:38:31,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:38:31 BoogieIcfgContainer [2019-12-07 17:38:31,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:38:31,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:38:31,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:38:31,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:38:31,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:38:30" (1/3) ... [2019-12-07 17:38:31,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c52148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:38:31, skipping insertion in model container [2019-12-07 17:38:31,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:30" (2/3) ... [2019-12-07 17:38:31,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c52148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:38:31, skipping insertion in model container [2019-12-07 17:38:31,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:38:31" (3/3) ... [2019-12-07 17:38:31,368 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_pso.oepc.i [2019-12-07 17:38:31,374 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:38:31,374 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:38:31,378 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:38:31,379 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:38:31,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,403 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,403 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,403 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,411 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,411 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:38:31,441 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:38:31,454 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:38:31,454 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:38:31,454 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:38:31,454 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:38:31,454 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:38:31,454 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:38:31,454 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:38:31,454 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:38:31,465 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-07 17:38:31,466 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 17:38:31,512 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 17:38:31,512 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:38:31,520 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 17:38:31,532 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 17:38:31,557 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 17:38:31,557 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:38:31,561 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 17:38:31,570 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:38:31,571 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:38:34,003 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 17:38:34,320 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82827 [2019-12-07 17:38:34,320 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-07 17:38:34,323 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-07 17:38:34,663 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 17:38:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 17:38:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:38:34,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:34,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:38:34,669 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:34,673 INFO L82 PathProgramCache]: Analyzing trace with hash 792296, now seen corresponding path program 1 times [2019-12-07 17:38:34,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:34,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443975488] [2019-12-07 17:38:34,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:34,812 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 17:38:34,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443975488] [2019-12-07 17:38:34,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:34,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:38:34,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90243954] [2019-12-07 17:38:34,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:38:34,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:34,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:38:34,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:38:34,828 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 17:38:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:35,011 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-07 17:38:35,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:38:35,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:38:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:35,073 INFO L225 Difference]: With dead ends: 8506 [2019-12-07 17:38:35,073 INFO L226 Difference]: Without dead ends: 7522 [2019-12-07 17:38:35,075 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 17:38:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-07 17:38:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-07 17:38:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-07 17:38:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-07 17:38:35,346 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-07 17:38:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:35,346 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-07 17:38:35,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:38:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-07 17:38:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:38:35,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:35,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:38:35,350 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:35,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash -476377294, now seen corresponding path program 1 times [2019-12-07 17:38:35,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:35,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573307659] [2019-12-07 17:38:35,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:35,443 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 17:38:35,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573307659] [2019-12-07 17:38:35,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:35,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:38:35,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436002388] [2019-12-07 17:38:35,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:38:35,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:35,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:38:35,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:38:35,445 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 4 states. [2019-12-07 17:38:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:35,720 INFO L93 Difference]: Finished difference Result 11740 states and 36692 transitions. [2019-12-07 17:38:35,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:38:35,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:38:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:35,774 INFO L225 Difference]: With dead ends: 11740 [2019-12-07 17:38:35,774 INFO L226 Difference]: Without dead ends: 11726 [2019-12-07 17:38:35,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:38:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11726 states. [2019-12-07 17:38:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11726 to 10436. [2019-12-07 17:38:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10436 states. [2019-12-07 17:38:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10436 states to 10436 states and 33285 transitions. [2019-12-07 17:38:36,037 INFO L78 Accepts]: Start accepts. Automaton has 10436 states and 33285 transitions. Word has length 11 [2019-12-07 17:38:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:36,037 INFO L462 AbstractCegarLoop]: Abstraction has 10436 states and 33285 transitions. [2019-12-07 17:38:36,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:38:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 10436 states and 33285 transitions. [2019-12-07 17:38:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:38:36,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:36,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:38:36,042 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:36,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:36,042 INFO L82 PathProgramCache]: Analyzing trace with hash 394534895, now seen corresponding path program 1 times [2019-12-07 17:38:36,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:36,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642904089] [2019-12-07 17:38:36,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:36,074 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 17:38:36,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642904089] [2019-12-07 17:38:36,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:36,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:38:36,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893976856] [2019-12-07 17:38:36,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:38:36,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:36,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:38:36,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:38:36,075 INFO L87 Difference]: Start difference. First operand 10436 states and 33285 transitions. Second operand 3 states. [2019-12-07 17:38:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:36,155 INFO L93 Difference]: Finished difference Result 15866 states and 49520 transitions. [2019-12-07 17:38:36,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:38:36,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 17:38:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:36,198 INFO L225 Difference]: With dead ends: 15866 [2019-12-07 17:38:36,198 INFO L226 Difference]: Without dead ends: 15866 [2019-12-07 17:38:36,199 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 17:38:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15866 states. [2019-12-07 17:38:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15866 to 11795. [2019-12-07 17:38:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11795 states. [2019-12-07 17:38:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11795 states to 11795 states and 37291 transitions. [2019-12-07 17:38:36,472 INFO L78 Accepts]: Start accepts. Automaton has 11795 states and 37291 transitions. Word has length 14 [2019-12-07 17:38:36,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:36,473 INFO L462 AbstractCegarLoop]: Abstraction has 11795 states and 37291 transitions. [2019-12-07 17:38:36,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:38:36,473 INFO L276 IsEmpty]: Start isEmpty. Operand 11795 states and 37291 transitions. [2019-12-07 17:38:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:38:36,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:36,475 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:38:36,475 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:36,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:36,475 INFO L82 PathProgramCache]: Analyzing trace with hash 304327747, now seen corresponding path program 1 times [2019-12-07 17:38:36,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:36,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393709880] [2019-12-07 17:38:36,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:36,519 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 17:38:36,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393709880] [2019-12-07 17:38:36,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:36,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:38:36,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036642317] [2019-12-07 17:38:36,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:38:36,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:36,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:38:36,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:38:36,521 INFO L87 Difference]: Start difference. First operand 11795 states and 37291 transitions. Second operand 4 states. [2019-12-07 17:38:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:36,695 INFO L93 Difference]: Finished difference Result 14131 states and 44142 transitions. [2019-12-07 17:38:36,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:38:36,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:38:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:36,728 INFO L225 Difference]: With dead ends: 14131 [2019-12-07 17:38:36,728 INFO L226 Difference]: Without dead ends: 14131 [2019-12-07 17:38:36,728 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 17:38:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14131 states. [2019-12-07 17:38:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14131 to 12855. [2019-12-07 17:38:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12855 states. [2019-12-07 17:38:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12855 states to 12855 states and 40501 transitions. [2019-12-07 17:38:36,936 INFO L78 Accepts]: Start accepts. Automaton has 12855 states and 40501 transitions. Word has length 14 [2019-12-07 17:38:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:36,936 INFO L462 AbstractCegarLoop]: Abstraction has 12855 states and 40501 transitions. [2019-12-07 17:38:36,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:38:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 12855 states and 40501 transitions. [2019-12-07 17:38:36,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:38:36,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:36,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:38:36,938 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:36,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:36,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1071051512, now seen corresponding path program 1 times [2019-12-07 17:38:36,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:36,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582920252] [2019-12-07 17:38:36,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:36,978 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 17:38:36,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582920252] [2019-12-07 17:38:36,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:36,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:38:36,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082935845] [2019-12-07 17:38:36,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:38:36,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:36,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:38:36,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:38:36,980 INFO L87 Difference]: Start difference. First operand 12855 states and 40501 transitions. Second operand 4 states. [2019-12-07 17:38:37,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:37,124 INFO L93 Difference]: Finished difference Result 15545 states and 48643 transitions. [2019-12-07 17:38:37,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:38:37,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:38:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:37,145 INFO L225 Difference]: With dead ends: 15545 [2019-12-07 17:38:37,145 INFO L226 Difference]: Without dead ends: 15545 [2019-12-07 17:38:37,145 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 17:38:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15545 states. [2019-12-07 17:38:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15545 to 13090. [2019-12-07 17:38:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13090 states. [2019-12-07 17:38:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13090 states to 13090 states and 41334 transitions. [2019-12-07 17:38:37,427 INFO L78 Accepts]: Start accepts. Automaton has 13090 states and 41334 transitions. Word has length 14 [2019-12-07 17:38:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:37,428 INFO L462 AbstractCegarLoop]: Abstraction has 13090 states and 41334 transitions. [2019-12-07 17:38:37,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:38:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 13090 states and 41334 transitions. [2019-12-07 17:38:37,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:38:37,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:37,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:38:37,430 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:37,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:37,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2143506472, now seen corresponding path program 1 times [2019-12-07 17:38:37,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:37,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696244810] [2019-12-07 17:38:37,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:37,476 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 17:38:37,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696244810] [2019-12-07 17:38:37,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:37,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:38:37,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083556048] [2019-12-07 17:38:37,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:38:37,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:37,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:38:37,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:38:37,477 INFO L87 Difference]: Start difference. First operand 13090 states and 41334 transitions. Second operand 3 states. [2019-12-07 17:38:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:37,515 INFO L93 Difference]: Finished difference Result 13090 states and 40732 transitions. [2019-12-07 17:38:37,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:38:37,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:38:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:37,531 INFO L225 Difference]: With dead ends: 13090 [2019-12-07 17:38:37,531 INFO L226 Difference]: Without dead ends: 13090 [2019-12-07 17:38:37,533 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 17:38:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13090 states. [2019-12-07 17:38:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13090 to 13010. [2019-12-07 17:38:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13010 states. [2019-12-07 17:38:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13010 states to 13010 states and 40500 transitions. [2019-12-07 17:38:37,731 INFO L78 Accepts]: Start accepts. Automaton has 13010 states and 40500 transitions. Word has length 16 [2019-12-07 17:38:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:37,731 INFO L462 AbstractCegarLoop]: Abstraction has 13010 states and 40500 transitions. [2019-12-07 17:38:37,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:38:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 13010 states and 40500 transitions. [2019-12-07 17:38:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:38:37,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:37,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:38:37,734 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:37,735 INFO L82 PathProgramCache]: Analyzing trace with hash 241272403, now seen corresponding path program 1 times [2019-12-07 17:38:37,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:37,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686017466] [2019-12-07 17:38:37,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:37,778 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 17:38:37,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686017466] [2019-12-07 17:38:37,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:37,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:38:37,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892608707] [2019-12-07 17:38:37,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:38:37,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:37,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:38:37,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:38:37,779 INFO L87 Difference]: Start difference. First operand 13010 states and 40500 transitions. Second operand 3 states. [2019-12-07 17:38:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:37,841 INFO L93 Difference]: Finished difference Result 22298 states and 68842 transitions. [2019-12-07 17:38:37,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:38:37,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:38:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:37,865 INFO L225 Difference]: With dead ends: 22298 [2019-12-07 17:38:37,865 INFO L226 Difference]: Without dead ends: 19870 [2019-12-07 17:38:37,865 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 17:38:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19870 states. [2019-12-07 17:38:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19870 to 18980. [2019-12-07 17:38:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18980 states. [2019-12-07 17:38:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18980 states to 18980 states and 59240 transitions. [2019-12-07 17:38:38,180 INFO L78 Accepts]: Start accepts. Automaton has 18980 states and 59240 transitions. Word has length 16 [2019-12-07 17:38:38,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:38,181 INFO L462 AbstractCegarLoop]: Abstraction has 18980 states and 59240 transitions. [2019-12-07 17:38:38,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:38:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 18980 states and 59240 transitions. [2019-12-07 17:38:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:38:38,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:38,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:38:38,185 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:38,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash -920380529, now seen corresponding path program 1 times [2019-12-07 17:38:38,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:38,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520333055] [2019-12-07 17:38:38,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:38,270 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 17:38:38,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520333055] [2019-12-07 17:38:38,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:38,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:38:38,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853440568] [2019-12-07 17:38:38,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:38:38,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:38,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:38:38,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:38:38,271 INFO L87 Difference]: Start difference. First operand 18980 states and 59240 transitions. Second operand 3 states. [2019-12-07 17:38:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:38,280 INFO L93 Difference]: Finished difference Result 2388 states and 5347 transitions. [2019-12-07 17:38:38,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:38:38,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:38:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:38,282 INFO L225 Difference]: With dead ends: 2388 [2019-12-07 17:38:38,282 INFO L226 Difference]: Without dead ends: 2388 [2019-12-07 17:38:38,282 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 17:38:38,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2019-12-07 17:38:38,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2019-12-07 17:38:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-12-07 17:38:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5347 transitions. [2019-12-07 17:38:38,301 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5347 transitions. Word has length 17 [2019-12-07 17:38:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:38,301 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5347 transitions. [2019-12-07 17:38:38,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:38:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5347 transitions. [2019-12-07 17:38:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:38:38,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:38,303 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 17:38:38,303 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:38,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:38,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1681809556, now seen corresponding path program 1 times [2019-12-07 17:38:38,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:38,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349387553] [2019-12-07 17:38:38,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:38,375 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 17:38:38,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349387553] [2019-12-07 17:38:38,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:38,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:38:38,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740710791] [2019-12-07 17:38:38,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:38:38,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:38,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:38:38,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:38:38,377 INFO L87 Difference]: Start difference. First operand 2388 states and 5347 transitions. Second operand 5 states. [2019-12-07 17:38:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:38,531 INFO L93 Difference]: Finished difference Result 2913 states and 6370 transitions. [2019-12-07 17:38:38,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:38:38,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 17:38:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:38,533 INFO L225 Difference]: With dead ends: 2913 [2019-12-07 17:38:38,534 INFO L226 Difference]: Without dead ends: 2913 [2019-12-07 17:38:38,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 17:38:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-12-07 17:38:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2438. [2019-12-07 17:38:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2438 states. [2019-12-07 17:38:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 5449 transitions. [2019-12-07 17:38:38,555 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 5449 transitions. Word has length 25 [2019-12-07 17:38:38,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:38,555 INFO L462 AbstractCegarLoop]: Abstraction has 2438 states and 5449 transitions. [2019-12-07 17:38:38,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:38:38,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 5449 transitions. [2019-12-07 17:38:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:38:38,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:38,557 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 17:38:38,557 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:38,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:38,557 INFO L82 PathProgramCache]: Analyzing trace with hash 968997935, now seen corresponding path program 1 times [2019-12-07 17:38:38,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:38,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158419911] [2019-12-07 17:38:38,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:38,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 17:38:38,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158419911] [2019-12-07 17:38:38,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:38,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:38:38,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896758345] [2019-12-07 17:38:38,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:38:38,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:38,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:38:38,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:38:38,581 INFO L87 Difference]: Start difference. First operand 2438 states and 5449 transitions. Second operand 3 states. [2019-12-07 17:38:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:38,609 INFO L93 Difference]: Finished difference Result 3081 states and 6522 transitions. [2019-12-07 17:38:38,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:38:38,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 17:38:38,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:38,611 INFO L225 Difference]: With dead ends: 3081 [2019-12-07 17:38:38,611 INFO L226 Difference]: Without dead ends: 3081 [2019-12-07 17:38:38,612 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 17:38:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2019-12-07 17:38:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2429. [2019-12-07 17:38:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2019-12-07 17:38:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 5197 transitions. [2019-12-07 17:38:38,635 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 5197 transitions. Word has length 25 [2019-12-07 17:38:38,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:38,635 INFO L462 AbstractCegarLoop]: Abstraction has 2429 states and 5197 transitions. [2019-12-07 17:38:38,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:38:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 5197 transitions. [2019-12-07 17:38:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:38:38,638 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:38,638 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 17:38:38,638 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:38,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:38,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1286104553, now seen corresponding path program 1 times [2019-12-07 17:38:38,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:38,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304547140] [2019-12-07 17:38:38,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:38,689 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 17:38:38,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304547140] [2019-12-07 17:38:38,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:38,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:38:38,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377272980] [2019-12-07 17:38:38,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:38:38,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:38,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:38:38,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:38:38,690 INFO L87 Difference]: Start difference. First operand 2429 states and 5197 transitions. Second operand 5 states. [2019-12-07 17:38:38,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:38,727 INFO L93 Difference]: Finished difference Result 2549 states and 5430 transitions. [2019-12-07 17:38:38,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:38:38,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 17:38:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:38,729 INFO L225 Difference]: With dead ends: 2549 [2019-12-07 17:38:38,729 INFO L226 Difference]: Without dead ends: 2549 [2019-12-07 17:38:38,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:38:38,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2019-12-07 17:38:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2549. [2019-12-07 17:38:38,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2549 states. [2019-12-07 17:38:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 5430 transitions. [2019-12-07 17:38:38,750 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 5430 transitions. Word has length 26 [2019-12-07 17:38:38,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:38,750 INFO L462 AbstractCegarLoop]: Abstraction has 2549 states and 5430 transitions. [2019-12-07 17:38:38,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:38:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 5430 transitions. [2019-12-07 17:38:38,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:38:38,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:38,752 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 17:38:38,752 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:38,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1627795246, now seen corresponding path program 1 times [2019-12-07 17:38:38,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:38,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726342763] [2019-12-07 17:38:38,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:38,800 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 17:38:38,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726342763] [2019-12-07 17:38:38,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:38,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:38:38,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131028133] [2019-12-07 17:38:38,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:38:38,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:38:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:38:38,802 INFO L87 Difference]: Start difference. First operand 2549 states and 5430 transitions. Second operand 5 states. [2019-12-07 17:38:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:38,965 INFO L93 Difference]: Finished difference Result 2917 states and 6120 transitions. [2019-12-07 17:38:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:38:38,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 17:38:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:38,968 INFO L225 Difference]: With dead ends: 2917 [2019-12-07 17:38:38,968 INFO L226 Difference]: Without dead ends: 2917 [2019-12-07 17:38:38,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 17:38:38,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2019-12-07 17:38:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2513. [2019-12-07 17:38:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-12-07 17:38:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 5358 transitions. [2019-12-07 17:38:38,992 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 5358 transitions. Word has length 27 [2019-12-07 17:38:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:38,993 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 5358 transitions. [2019-12-07 17:38:38,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:38:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 5358 transitions. [2019-12-07 17:38:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:38:38,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:38,995 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 17:38:38,995 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:38,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1804230119, now seen corresponding path program 1 times [2019-12-07 17:38:38,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:38,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253244337] [2019-12-07 17:38:38,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:39,021 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 17:38:39,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253244337] [2019-12-07 17:38:39,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:39,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:38:39,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525709098] [2019-12-07 17:38:39,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:38:39,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:39,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:38:39,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:38:39,023 INFO L87 Difference]: Start difference. First operand 2513 states and 5358 transitions. Second operand 4 states. [2019-12-07 17:38:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:39,034 INFO L93 Difference]: Finished difference Result 1235 states and 2606 transitions. [2019-12-07 17:38:39,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:38:39,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 17:38:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:39,035 INFO L225 Difference]: With dead ends: 1235 [2019-12-07 17:38:39,035 INFO L226 Difference]: Without dead ends: 1200 [2019-12-07 17:38:39,036 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 17:38:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-12-07 17:38:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 848. [2019-12-07 17:38:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-12-07 17:38:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1766 transitions. [2019-12-07 17:38:39,044 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1766 transitions. Word has length 28 [2019-12-07 17:38:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:39,044 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1766 transitions. [2019-12-07 17:38:39,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:38:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1766 transitions. [2019-12-07 17:38:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:38:39,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:39,045 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 17:38:39,045 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:39,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1145830791, now seen corresponding path program 1 times [2019-12-07 17:38:39,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:39,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721289055] [2019-12-07 17:38:39,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:39,108 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 17:38:39,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721289055] [2019-12-07 17:38:39,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:39,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:38:39,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665247769] [2019-12-07 17:38:39,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:38:39,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:39,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:38:39,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:38:39,109 INFO L87 Difference]: Start difference. First operand 848 states and 1766 transitions. Second operand 6 states. [2019-12-07 17:38:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:39,436 INFO L93 Difference]: Finished difference Result 1428 states and 2900 transitions. [2019-12-07 17:38:39,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:38:39,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 17:38:39,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:39,437 INFO L225 Difference]: With dead ends: 1428 [2019-12-07 17:38:39,437 INFO L226 Difference]: Without dead ends: 1428 [2019-12-07 17:38:39,438 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 17:38:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-07 17:38:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1120. [2019-12-07 17:38:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2019-12-07 17:38:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 2323 transitions. [2019-12-07 17:38:39,448 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 2323 transitions. Word has length 52 [2019-12-07 17:38:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:39,448 INFO L462 AbstractCegarLoop]: Abstraction has 1120 states and 2323 transitions. [2019-12-07 17:38:39,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:38:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 2323 transitions. [2019-12-07 17:38:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:38:39,449 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:39,449 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 17:38:39,449 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:39,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash -234851773, now seen corresponding path program 2 times [2019-12-07 17:38:39,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:39,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481532917] [2019-12-07 17:38:39,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:39,524 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 17:38:39,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481532917] [2019-12-07 17:38:39,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:39,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:38:39,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771324447] [2019-12-07 17:38:39,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:38:39,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:39,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:38:39,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:38:39,526 INFO L87 Difference]: Start difference. First operand 1120 states and 2323 transitions. Second operand 7 states. [2019-12-07 17:38:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:39,789 INFO L93 Difference]: Finished difference Result 4104 states and 8345 transitions. [2019-12-07 17:38:39,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:38:39,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 17:38:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:39,792 INFO L225 Difference]: With dead ends: 4104 [2019-12-07 17:38:39,792 INFO L226 Difference]: Without dead ends: 2725 [2019-12-07 17:38:39,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:38:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2019-12-07 17:38:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 1181. [2019-12-07 17:38:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-12-07 17:38:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 2424 transitions. [2019-12-07 17:38:39,806 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 2424 transitions. Word has length 52 [2019-12-07 17:38:39,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:39,806 INFO L462 AbstractCegarLoop]: Abstraction has 1181 states and 2424 transitions. [2019-12-07 17:38:39,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:38:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 2424 transitions. [2019-12-07 17:38:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:38:39,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:39,808 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 17:38:39,808 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:39,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:39,808 INFO L82 PathProgramCache]: Analyzing trace with hash -480319677, now seen corresponding path program 3 times [2019-12-07 17:38:39,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:39,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521908274] [2019-12-07 17:38:39,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:39,867 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 17:38:39,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521908274] [2019-12-07 17:38:39,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:39,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:38:39,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654456594] [2019-12-07 17:38:39,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:38:39,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:39,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:38:39,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:38:39,869 INFO L87 Difference]: Start difference. First operand 1181 states and 2424 transitions. Second operand 4 states. [2019-12-07 17:38:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:39,908 INFO L93 Difference]: Finished difference Result 1319 states and 2698 transitions. [2019-12-07 17:38:39,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:38:39,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 17:38:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:39,910 INFO L225 Difference]: With dead ends: 1319 [2019-12-07 17:38:39,910 INFO L226 Difference]: Without dead ends: 1319 [2019-12-07 17:38:39,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 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 17:38:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-12-07 17:38:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1040. [2019-12-07 17:38:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-12-07 17:38:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 2152 transitions. [2019-12-07 17:38:39,935 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 2152 transitions. Word has length 52 [2019-12-07 17:38:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:39,935 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 2152 transitions. [2019-12-07 17:38:39,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:38:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 2152 transitions. [2019-12-07 17:38:39,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:38:39,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:39,937 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 17:38:39,937 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:39,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:39,937 INFO L82 PathProgramCache]: Analyzing trace with hash -409769665, now seen corresponding path program 1 times [2019-12-07 17:38:39,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:39,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592858171] [2019-12-07 17:38:39,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:38:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:38:40,005 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:38:40,005 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:38:40,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~z$mem_tmp~0_25 0) (= v_~y~0_23 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_27|)) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1093~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1093~0.base_27|) |v_ULTIMATE.start_main_~#t1093~0.offset_19| 0)) |v_#memory_int_11|) (= 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) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_27| 1)) (= v_~z$w_buff0~0_252 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1093~0.base_27|) (= 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) (= |v_ULTIMATE.start_main_~#t1093~0.offset_19| 0) (= 0 v_~z$flush_delayed~0_33) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1093~0.base_27| 4)) (= |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) (= 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{ULTIMATE.start_main_~#t1093~0.offset=|v_ULTIMATE.start_main_~#t1093~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t1093~0.base=|v_ULTIMATE.start_main_~#t1093~0.base_27|, ~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, ~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, ~__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, ULTIMATE.start_main_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_22|, ~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, ULTIMATE.start_main_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_14|, ~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_#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[ULTIMATE.start_main_~#t1093~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t1093~0.base, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~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, ~__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, ULTIMATE.start_main_~#t1094~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1094~0.offset, ~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_#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 17:38:40,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= 1 ~x~0_Out830889001) (= ~z$r_buff1_thd2~0_Out830889001 ~z$r_buff0_thd2~0_In830889001) (= ~z$r_buff0_thd1~0_In830889001 ~z$r_buff1_thd1~0_Out830889001) (= ~z$r_buff1_thd0~0_Out830889001 ~z$r_buff0_thd0~0_In830889001) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In830889001 0)) (= ~z$r_buff0_thd1~0_Out830889001 1)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In830889001, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In830889001, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In830889001, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In830889001} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In830889001, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out830889001, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out830889001, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out830889001, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In830889001, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out830889001, ~x~0=~x~0_Out830889001, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In830889001} 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 17:38:40,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1094~0.base_11|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11|) |v_ULTIMATE.start_main_~#t1094~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1094~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1094~0.base_11| 4) |v_#length_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1094~0.offset_10| 0)) 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_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_11|, #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_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1094~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1094~0.offset] because there is no mapped edge [2019-12-07 17:38:40,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1993751157 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1993751157 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1993751157| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1993751157| ~z$w_buff0_used~0_In1993751157) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1993751157, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1993751157} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1993751157|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1993751157, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1993751157} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:38:40,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In478711913 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In478711913 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In478711913 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In478711913 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out478711913| ~z$w_buff1_used~0_In478711913) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out478711913|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In478711913, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In478711913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In478711913, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In478711913} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out478711913|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In478711913, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In478711913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In478711913, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In478711913} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:38:40,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= ~z$r_buff0_thd1~0_Out-690643467 ~z$r_buff0_thd1~0_In-690643467)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-690643467 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-690643467 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= ~z$r_buff0_thd1~0_Out-690643467 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-690643467, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-690643467} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-690643467, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-690643467|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-690643467} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:38:40,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd1~0_In-1428480645 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1428480645 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1428480645 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1428480645 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1428480645| ~z$r_buff1_thd1~0_In-1428480645) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1428480645|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428480645, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1428480645, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1428480645, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1428480645} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428480645, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1428480645|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1428480645, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1428480645, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1428480645} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:38:40,013 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 17:38:40,013 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 17:38:40,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In727062667 256) 0))) (or (and (= ~z$r_buff1_thd2~0_In727062667 |P1Thread1of1ForFork1_#t~ite30_Out727062667|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In727062667| |P1Thread1of1ForFork1_#t~ite29_Out727062667|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out727062667| |P1Thread1of1ForFork1_#t~ite30_Out727062667|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In727062667 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In727062667 256)) (and (= 0 (mod ~z$r_buff1_thd2~0_In727062667 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In727062667 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out727062667| ~z$r_buff1_thd2~0_In727062667)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In727062667|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In727062667, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In727062667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In727062667, ~weak$$choice2~0=~weak$$choice2~0_In727062667, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In727062667} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out727062667|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out727062667|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In727062667, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In727062667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In727062667, ~weak$$choice2~0=~weak$$choice2~0_In727062667, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In727062667} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:38:40,013 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 17:38:40,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2006943955 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-2006943955 256) 0))) (or (and (= ~z$w_buff1~0_In-2006943955 |P1Thread1of1ForFork1_#t~ite32_Out-2006943955|) (not .cse0) (not .cse1)) (and (= ~z~0_In-2006943955 |P1Thread1of1ForFork1_#t~ite32_Out-2006943955|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2006943955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2006943955, ~z$w_buff1~0=~z$w_buff1~0_In-2006943955, ~z~0=~z~0_In-2006943955} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2006943955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2006943955, ~z$w_buff1~0=~z$w_buff1~0_In-2006943955, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2006943955|, ~z~0=~z~0_In-2006943955} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:38:40,014 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 17:38:40,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1474899841 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1474899841 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1474899841| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1474899841| ~z$w_buff0_used~0_In-1474899841) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1474899841, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1474899841} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1474899841, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1474899841|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1474899841} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:38:40,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-1790878152 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1790878152 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1790878152 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1790878152 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1790878152|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1790878152 |P1Thread1of1ForFork1_#t~ite35_Out-1790878152|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1790878152, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1790878152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1790878152, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1790878152} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1790878152, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1790878152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1790878152, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1790878152|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1790878152} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:38:40,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In2006308020 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2006308020 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In2006308020 |P1Thread1of1ForFork1_#t~ite36_Out2006308020|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out2006308020| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2006308020, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2006308020} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2006308020, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2006308020, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2006308020|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:38:40,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In135684672 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In135684672 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In135684672 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In135684672 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out135684672| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In135684672 |P1Thread1of1ForFork1_#t~ite37_Out135684672|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In135684672, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In135684672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In135684672, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In135684672} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In135684672, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In135684672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In135684672, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In135684672, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out135684672|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:38:40,015 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 17:38:40,015 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 17:38:40,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1336451173 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1336451173 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite40_Out1336451173| |ULTIMATE.start_main_#t~ite41_Out1336451173|))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1336451173| ~z~0_In1336451173) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1336451173| ~z$w_buff1~0_In1336451173) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1336451173, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1336451173, ~z$w_buff1~0=~z$w_buff1~0_In1336451173, ~z~0=~z~0_In1336451173} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1336451173|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1336451173|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1336451173, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1336451173, ~z$w_buff1~0=~z$w_buff1~0_In1336451173, ~z~0=~z~0_In1336451173} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:38:40,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-931334677 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-931334677 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-931334677|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-931334677 |ULTIMATE.start_main_#t~ite42_Out-931334677|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-931334677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-931334677} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-931334677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-931334677, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-931334677|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:38:40,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-860919680 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-860919680 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-860919680 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-860919680 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-860919680 |ULTIMATE.start_main_#t~ite43_Out-860919680|)) (and (= |ULTIMATE.start_main_#t~ite43_Out-860919680| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-860919680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-860919680, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-860919680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-860919680} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-860919680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-860919680, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-860919680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-860919680, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-860919680|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:38:40,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-210981897 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-210981897 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-210981897| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-210981897 |ULTIMATE.start_main_#t~ite44_Out-210981897|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-210981897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-210981897} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-210981897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-210981897, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-210981897|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:38:40,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In354753784 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In354753784 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In354753784 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In354753784 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In354753784 |ULTIMATE.start_main_#t~ite45_Out354753784|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out354753784|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In354753784, ~z$w_buff0_used~0=~z$w_buff0_used~0_In354753784, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In354753784, ~z$w_buff1_used~0=~z$w_buff1_used~0_In354753784} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In354753784, ~z$w_buff0_used~0=~z$w_buff0_used~0_In354753784, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In354753784, ~z$w_buff1_used~0=~z$w_buff1_used~0_In354753784, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out354753784|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:38:40,017 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 17:38:40,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:38:40 BasicIcfg [2019-12-07 17:38:40,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:38:40,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:38:40,059 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:38:40,059 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:38:40,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:38:31" (3/4) ... [2019-12-07 17:38:40,061 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:38:40,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~z$mem_tmp~0_25 0) (= v_~y~0_23 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_27|)) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1093~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1093~0.base_27|) |v_ULTIMATE.start_main_~#t1093~0.offset_19| 0)) |v_#memory_int_11|) (= 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) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_27| 1)) (= v_~z$w_buff0~0_252 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1093~0.base_27|) (= 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) (= |v_ULTIMATE.start_main_~#t1093~0.offset_19| 0) (= 0 v_~z$flush_delayed~0_33) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1093~0.base_27| 4)) (= |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) (= 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{ULTIMATE.start_main_~#t1093~0.offset=|v_ULTIMATE.start_main_~#t1093~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t1093~0.base=|v_ULTIMATE.start_main_~#t1093~0.base_27|, ~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, ~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, ~__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, ULTIMATE.start_main_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_22|, ~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, ULTIMATE.start_main_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_14|, ~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_#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[ULTIMATE.start_main_~#t1093~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t1093~0.base, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~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, ~__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, ULTIMATE.start_main_~#t1094~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1094~0.offset, ~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_#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 17:38:40,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= 1 ~x~0_Out830889001) (= ~z$r_buff1_thd2~0_Out830889001 ~z$r_buff0_thd2~0_In830889001) (= ~z$r_buff0_thd1~0_In830889001 ~z$r_buff1_thd1~0_Out830889001) (= ~z$r_buff1_thd0~0_Out830889001 ~z$r_buff0_thd0~0_In830889001) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In830889001 0)) (= ~z$r_buff0_thd1~0_Out830889001 1)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In830889001, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In830889001, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In830889001, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In830889001} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In830889001, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out830889001, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out830889001, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out830889001, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In830889001, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out830889001, ~x~0=~x~0_Out830889001, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In830889001} 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 17:38:40,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1094~0.base_11|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11|) |v_ULTIMATE.start_main_~#t1094~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1094~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1094~0.base_11| 4) |v_#length_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1094~0.offset_10| 0)) 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_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_11|, #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_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1094~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1094~0.offset] because there is no mapped edge [2019-12-07 17:38:40,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1993751157 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1993751157 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1993751157| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1993751157| ~z$w_buff0_used~0_In1993751157) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1993751157, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1993751157} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1993751157|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1993751157, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1993751157} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:38:40,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In478711913 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In478711913 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In478711913 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In478711913 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out478711913| ~z$w_buff1_used~0_In478711913) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out478711913|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In478711913, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In478711913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In478711913, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In478711913} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out478711913|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In478711913, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In478711913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In478711913, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In478711913} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:38:40,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= ~z$r_buff0_thd1~0_Out-690643467 ~z$r_buff0_thd1~0_In-690643467)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-690643467 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-690643467 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= ~z$r_buff0_thd1~0_Out-690643467 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-690643467, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-690643467} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-690643467, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-690643467|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-690643467} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:38:40,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd1~0_In-1428480645 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1428480645 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1428480645 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1428480645 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1428480645| ~z$r_buff1_thd1~0_In-1428480645) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1428480645|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428480645, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1428480645, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1428480645, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1428480645} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428480645, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1428480645|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1428480645, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1428480645, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1428480645} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:38:40,065 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 17:38:40,065 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 17:38:40,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In727062667 256) 0))) (or (and (= ~z$r_buff1_thd2~0_In727062667 |P1Thread1of1ForFork1_#t~ite30_Out727062667|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In727062667| |P1Thread1of1ForFork1_#t~ite29_Out727062667|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out727062667| |P1Thread1of1ForFork1_#t~ite30_Out727062667|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In727062667 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In727062667 256)) (and (= 0 (mod ~z$r_buff1_thd2~0_In727062667 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In727062667 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out727062667| ~z$r_buff1_thd2~0_In727062667)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In727062667|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In727062667, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In727062667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In727062667, ~weak$$choice2~0=~weak$$choice2~0_In727062667, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In727062667} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out727062667|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out727062667|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In727062667, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In727062667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In727062667, ~weak$$choice2~0=~weak$$choice2~0_In727062667, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In727062667} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:38:40,066 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 17:38:40,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2006943955 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-2006943955 256) 0))) (or (and (= ~z$w_buff1~0_In-2006943955 |P1Thread1of1ForFork1_#t~ite32_Out-2006943955|) (not .cse0) (not .cse1)) (and (= ~z~0_In-2006943955 |P1Thread1of1ForFork1_#t~ite32_Out-2006943955|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2006943955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2006943955, ~z$w_buff1~0=~z$w_buff1~0_In-2006943955, ~z~0=~z~0_In-2006943955} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2006943955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2006943955, ~z$w_buff1~0=~z$w_buff1~0_In-2006943955, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2006943955|, ~z~0=~z~0_In-2006943955} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:38:40,066 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 17:38:40,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1474899841 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1474899841 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1474899841| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1474899841| ~z$w_buff0_used~0_In-1474899841) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1474899841, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1474899841} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1474899841, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1474899841|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1474899841} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:38:40,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-1790878152 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1790878152 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1790878152 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1790878152 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1790878152|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1790878152 |P1Thread1of1ForFork1_#t~ite35_Out-1790878152|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1790878152, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1790878152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1790878152, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1790878152} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1790878152, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1790878152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1790878152, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1790878152|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1790878152} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:38:40,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In2006308020 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2006308020 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In2006308020 |P1Thread1of1ForFork1_#t~ite36_Out2006308020|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out2006308020| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2006308020, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2006308020} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2006308020, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2006308020, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2006308020|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:38:40,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In135684672 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In135684672 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In135684672 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In135684672 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out135684672| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In135684672 |P1Thread1of1ForFork1_#t~ite37_Out135684672|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In135684672, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In135684672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In135684672, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In135684672} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In135684672, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In135684672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In135684672, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In135684672, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out135684672|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:38:40,067 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 17:38:40,067 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 17:38:40,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1336451173 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1336451173 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite40_Out1336451173| |ULTIMATE.start_main_#t~ite41_Out1336451173|))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1336451173| ~z~0_In1336451173) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1336451173| ~z$w_buff1~0_In1336451173) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1336451173, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1336451173, ~z$w_buff1~0=~z$w_buff1~0_In1336451173, ~z~0=~z~0_In1336451173} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1336451173|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1336451173|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1336451173, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1336451173, ~z$w_buff1~0=~z$w_buff1~0_In1336451173, ~z~0=~z~0_In1336451173} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:38:40,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-931334677 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-931334677 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-931334677|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-931334677 |ULTIMATE.start_main_#t~ite42_Out-931334677|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-931334677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-931334677} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-931334677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-931334677, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-931334677|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:38:40,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-860919680 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-860919680 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-860919680 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-860919680 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-860919680 |ULTIMATE.start_main_#t~ite43_Out-860919680|)) (and (= |ULTIMATE.start_main_#t~ite43_Out-860919680| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-860919680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-860919680, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-860919680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-860919680} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-860919680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-860919680, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-860919680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-860919680, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-860919680|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:38:40,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-210981897 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-210981897 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-210981897| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-210981897 |ULTIMATE.start_main_#t~ite44_Out-210981897|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-210981897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-210981897} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-210981897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-210981897, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-210981897|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:38:40,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In354753784 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In354753784 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In354753784 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In354753784 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In354753784 |ULTIMATE.start_main_#t~ite45_Out354753784|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out354753784|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In354753784, ~z$w_buff0_used~0=~z$w_buff0_used~0_In354753784, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In354753784, ~z$w_buff1_used~0=~z$w_buff1_used~0_In354753784} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In354753784, ~z$w_buff0_used~0=~z$w_buff0_used~0_In354753784, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In354753784, ~z$w_buff1_used~0=~z$w_buff1_used~0_In354753784, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out354753784|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:38:40,069 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 17:38:40,118 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_64b1f80f-dcf1-4dd0-9e42-9272c39eeff5/bin/uautomizer/witness.graphml [2019-12-07 17:38:40,119 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:38:40,120 INFO L168 Benchmark]: Toolchain (without parser) took 9571.75 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 615.0 MB). Free memory was 938.2 MB in the beginning and 1.4 GB in the end (delta: -508.3 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:38:40,120 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:38:40,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:38:40,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.66 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 17:38:40,121 INFO L168 Benchmark]: Boogie Preprocessor took 23.59 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 17:38:40,121 INFO L168 Benchmark]: RCFGBuilder took 365.01 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:38:40,121 INFO L168 Benchmark]: TraceAbstraction took 8694.67 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 496.0 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -429.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:38:40,121 INFO L168 Benchmark]: Witness Printer took 60.12 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:38:40,123 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 387.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.59 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 365.01 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8694.67 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 496.0 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -429.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. * Witness Printer took 60.12 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 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(&t1093, ((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(&t1094, ((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: 8.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2173 SDtfs, 1743 SDslu, 3705 SDs, 0 SdLazy, 1654 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18980occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 14076 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 63150 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...