./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/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 e927e7a5126aed7aac7859f17d61db0365ac12ee ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:18:08,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:18:08,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:18:08,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:18:08,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:18:08,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:18:08,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:18:08,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:18:08,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:18:08,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:18:08,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:18:08,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:18:08,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:18:08,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:18:08,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:18:08,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:18:08,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:18:08,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:18:08,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:18:08,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:18:08,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:18:08,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:18:08,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:18:08,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:18:08,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:18:08,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:18:08,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:18:08,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:18:08,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:18:08,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:18:08,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:18:08,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:18:08,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:18:08,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:18:08,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:18:08,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:18:08,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:18:08,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:18:08,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:18:08,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:18:08,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:18:08,946 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:18:08,956 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:18:08,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:18:08,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:18:08,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:18:08,957 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:18:08,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:18:08,957 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:18:08,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:18:08,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:18:08,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:18:08,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:18:08,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:18:08,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:18:08,958 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:18:08,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:18:08,958 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:18:08,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:18:08,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:18:08,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:18:08,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:18:08,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:18:08,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:18:08,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:18:08,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:18:08,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:18:08,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:18:08,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:18:08,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:18:08,960 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:18:08,960 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_c227a07e-a62e-4910-a116-797c75a5a26a/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 -> e927e7a5126aed7aac7859f17d61db0365ac12ee [2019-12-07 10:18:09,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:18:09,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:18:09,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:18:09,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:18:09,069 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:18:09,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc.i [2019-12-07 10:18:09,106 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/bin/uautomizer/data/474301cf1/3b96ce01757f4e289211841fd9cd2ef1/FLAG9a813ad33 [2019-12-07 10:18:09,572 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:18:09,572 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc.i [2019-12-07 10:18:09,581 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/bin/uautomizer/data/474301cf1/3b96ce01757f4e289211841fd9cd2ef1/FLAG9a813ad33 [2019-12-07 10:18:09,590 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/bin/uautomizer/data/474301cf1/3b96ce01757f4e289211841fd9cd2ef1 [2019-12-07 10:18:09,592 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:18:09,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:18:09,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:18:09,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:18:09,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:18:09,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:18:09" (1/1) ... [2019-12-07 10:18:09,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09, skipping insertion in model container [2019-12-07 10:18:09,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:18:09" (1/1) ... [2019-12-07 10:18:09,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:18:09,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:18:09,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:18:09,900 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:18:09,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:18:09,999 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:18:10,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09 WrapperNode [2019-12-07 10:18:10,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:18:10,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:18:10,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:18:10,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:18:10,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09" (1/1) ... [2019-12-07 10:18:10,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09" (1/1) ... [2019-12-07 10:18:10,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:18:10,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:18:10,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:18:10,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:18:10,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09" (1/1) ... [2019-12-07 10:18:10,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09" (1/1) ... [2019-12-07 10:18:10,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09" (1/1) ... [2019-12-07 10:18:10,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09" (1/1) ... [2019-12-07 10:18:10,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09" (1/1) ... [2019-12-07 10:18:10,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09" (1/1) ... [2019-12-07 10:18:10,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09" (1/1) ... [2019-12-07 10:18:10,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:18:10,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:18:10,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:18:10,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:18:10,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/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 10:18:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:18:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:18:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:18:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:18:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:18:10,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:18:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:18:10,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:18:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:18:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:18:10,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:18:10,105 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 10:18:10,444 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:18:10,444 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:18:10,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:18:10 BoogieIcfgContainer [2019-12-07 10:18:10,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:18:10,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:18:10,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:18:10,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:18:10,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:18:09" (1/3) ... [2019-12-07 10:18:10,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6573dc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:18:10, skipping insertion in model container [2019-12-07 10:18:10,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:18:09" (2/3) ... [2019-12-07 10:18:10,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6573dc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:18:10, skipping insertion in model container [2019-12-07 10:18:10,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:18:10" (3/3) ... [2019-12-07 10:18:10,449 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_rmo.oepc.i [2019-12-07 10:18:10,456 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:18:10,456 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:18:10,461 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:18:10,462 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:18:10,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,485 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,485 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,490 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,490 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:18:10,514 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 10:18:10,526 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:18:10,526 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:18:10,527 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:18:10,527 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:18:10,527 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:18:10,527 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:18:10,527 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:18:10,527 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:18:10,537 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-07 10:18:10,538 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 10:18:10,585 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 10:18:10,585 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:18:10,593 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 10:18:10,605 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 10:18:10,636 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 10:18:10,636 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:18:10,640 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 10:18:10,651 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 10:18:10,652 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:18:13,058 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 10:18:13,369 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82827 [2019-12-07 10:18:13,369 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-07 10:18:13,372 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-07 10:18:13,709 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 10:18:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 10:18:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:18:13,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:13,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:18:13,715 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:13,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash 792296, now seen corresponding path program 1 times [2019-12-07 10:18:13,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:13,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321899539] [2019-12-07 10:18:13,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:13,857 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 10:18:13,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321899539] [2019-12-07 10:18:13,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:13,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:18:13,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005070223] [2019-12-07 10:18:13,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:18:13,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:13,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:18:13,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:18:13,873 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 10:18:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:14,045 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-07 10:18:14,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:18:14,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:18:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:14,104 INFO L225 Difference]: With dead ends: 8506 [2019-12-07 10:18:14,105 INFO L226 Difference]: Without dead ends: 7522 [2019-12-07 10:18:14,105 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 10:18:14,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-07 10:18:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-07 10:18:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-07 10:18:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-07 10:18:14,370 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-07 10:18:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:14,371 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-07 10:18:14,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:18:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-07 10:18:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:18:14,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:14,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:14,373 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:14,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash -476377294, now seen corresponding path program 1 times [2019-12-07 10:18:14,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:14,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532307152] [2019-12-07 10:18:14,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:14,421 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 10:18:14,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532307152] [2019-12-07 10:18:14,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:14,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:18:14,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539286792] [2019-12-07 10:18:14,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:18:14,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:14,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:18:14,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:18:14,424 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 3 states. [2019-12-07 10:18:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:14,444 INFO L93 Difference]: Finished difference Result 1232 states and 2827 transitions. [2019-12-07 10:18:14,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:18:14,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 10:18:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:14,452 INFO L225 Difference]: With dead ends: 1232 [2019-12-07 10:18:14,452 INFO L226 Difference]: Without dead ends: 1232 [2019-12-07 10:18:14,453 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 10:18:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-07 10:18:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-07 10:18:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-07 10:18:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2827 transitions. [2019-12-07 10:18:14,482 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2827 transitions. Word has length 11 [2019-12-07 10:18:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:14,482 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2827 transitions. [2019-12-07 10:18:14,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:18:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2827 transitions. [2019-12-07 10:18:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:18:14,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:14,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:14,484 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:14,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:14,484 INFO L82 PathProgramCache]: Analyzing trace with hash 394534895, now seen corresponding path program 1 times [2019-12-07 10:18:14,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:14,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514684325] [2019-12-07 10:18:14,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:14,522 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 10:18:14,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514684325] [2019-12-07 10:18:14,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:14,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:18:14,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773212925] [2019-12-07 10:18:14,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:18:14,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:14,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:18:14,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:18:14,524 INFO L87 Difference]: Start difference. First operand 1232 states and 2827 transitions. Second operand 3 states. [2019-12-07 10:18:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:14,579 INFO L93 Difference]: Finished difference Result 1960 states and 4354 transitions. [2019-12-07 10:18:14,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:18:14,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 10:18:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:14,591 INFO L225 Difference]: With dead ends: 1960 [2019-12-07 10:18:14,592 INFO L226 Difference]: Without dead ends: 1960 [2019-12-07 10:18:14,592 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 10:18:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2019-12-07 10:18:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1384. [2019-12-07 10:18:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-12-07 10:18:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3137 transitions. [2019-12-07 10:18:14,631 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3137 transitions. Word has length 14 [2019-12-07 10:18:14,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:14,631 INFO L462 AbstractCegarLoop]: Abstraction has 1384 states and 3137 transitions. [2019-12-07 10:18:14,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:18:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3137 transitions. [2019-12-07 10:18:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:18:14,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:14,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:14,633 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash 304327747, now seen corresponding path program 1 times [2019-12-07 10:18:14,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:14,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919545253] [2019-12-07 10:18:14,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:14,692 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 10:18:14,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919545253] [2019-12-07 10:18:14,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:14,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:18:14,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145498590] [2019-12-07 10:18:14,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:18:14,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:14,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:18:14,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:18:14,693 INFO L87 Difference]: Start difference. First operand 1384 states and 3137 transitions. Second operand 4 states. [2019-12-07 10:18:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:14,807 INFO L93 Difference]: Finished difference Result 1706 states and 3795 transitions. [2019-12-07 10:18:14,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:18:14,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 10:18:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:14,834 INFO L225 Difference]: With dead ends: 1706 [2019-12-07 10:18:14,835 INFO L226 Difference]: Without dead ends: 1706 [2019-12-07 10:18:14,835 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 10:18:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-07 10:18:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1646. [2019-12-07 10:18:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-12-07 10:18:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3679 transitions. [2019-12-07 10:18:14,870 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3679 transitions. Word has length 14 [2019-12-07 10:18:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:14,870 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 3679 transitions. [2019-12-07 10:18:14,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:18:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3679 transitions. [2019-12-07 10:18:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:18:14,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:14,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:14,871 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:14,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:14,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1071051512, now seen corresponding path program 1 times [2019-12-07 10:18:14,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:14,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134765193] [2019-12-07 10:18:14,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:14,924 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 10:18:14,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134765193] [2019-12-07 10:18:14,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:14,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:18:14,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948374339] [2019-12-07 10:18:14,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:18:14,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:14,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:18:14,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:18:14,925 INFO L87 Difference]: Start difference. First operand 1646 states and 3679 transitions. Second operand 4 states. [2019-12-07 10:18:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:15,037 INFO L93 Difference]: Finished difference Result 2032 states and 4499 transitions. [2019-12-07 10:18:15,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:18:15,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 10:18:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:15,046 INFO L225 Difference]: With dead ends: 2032 [2019-12-07 10:18:15,046 INFO L226 Difference]: Without dead ends: 2032 [2019-12-07 10:18:15,047 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 10:18:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-12-07 10:18:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1750. [2019-12-07 10:18:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-12-07 10:18:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3922 transitions. [2019-12-07 10:18:15,072 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 3922 transitions. Word has length 14 [2019-12-07 10:18:15,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:15,072 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 3922 transitions. [2019-12-07 10:18:15,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:18:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3922 transitions. [2019-12-07 10:18:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:18:15,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:15,074 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:15,074 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:15,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:15,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1681809556, now seen corresponding path program 1 times [2019-12-07 10:18:15,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:15,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666787324] [2019-12-07 10:18:15,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:15,133 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 10:18:15,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666787324] [2019-12-07 10:18:15,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:15,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:18:15,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252603950] [2019-12-07 10:18:15,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:18:15,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:18:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:18:15,135 INFO L87 Difference]: Start difference. First operand 1750 states and 3922 transitions. Second operand 5 states. [2019-12-07 10:18:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:15,290 INFO L93 Difference]: Finished difference Result 2284 states and 4985 transitions. [2019-12-07 10:18:15,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:18:15,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 10:18:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:15,300 INFO L225 Difference]: With dead ends: 2284 [2019-12-07 10:18:15,300 INFO L226 Difference]: Without dead ends: 2284 [2019-12-07 10:18:15,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:18:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-12-07 10:18:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2035. [2019-12-07 10:18:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-07 10:18:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4506 transitions. [2019-12-07 10:18:15,342 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4506 transitions. Word has length 25 [2019-12-07 10:18:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:15,342 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4506 transitions. [2019-12-07 10:18:15,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:18:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4506 transitions. [2019-12-07 10:18:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:18:15,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:15,345 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 10:18:15,345 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:15,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:15,346 INFO L82 PathProgramCache]: Analyzing trace with hash 968997935, now seen corresponding path program 1 times [2019-12-07 10:18:15,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:15,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027648205] [2019-12-07 10:18:15,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:15,381 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 10:18:15,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027648205] [2019-12-07 10:18:15,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:15,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:18:15,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321527639] [2019-12-07 10:18:15,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:18:15,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:15,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:18:15,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:18:15,382 INFO L87 Difference]: Start difference. First operand 2035 states and 4506 transitions. Second operand 3 states. [2019-12-07 10:18:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:15,424 INFO L93 Difference]: Finished difference Result 2578 states and 5509 transitions. [2019-12-07 10:18:15,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:18:15,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 10:18:15,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:15,430 INFO L225 Difference]: With dead ends: 2578 [2019-12-07 10:18:15,430 INFO L226 Difference]: Without dead ends: 2578 [2019-12-07 10:18:15,430 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 10:18:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-07 10:18:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1993. [2019-12-07 10:18:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-07 10:18:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4274 transitions. [2019-12-07 10:18:15,460 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4274 transitions. Word has length 25 [2019-12-07 10:18:15,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:15,460 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 4274 transitions. [2019-12-07 10:18:15,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:18:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4274 transitions. [2019-12-07 10:18:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:18:15,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:15,462 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 10:18:15,462 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:15,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:15,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1274554926, now seen corresponding path program 1 times [2019-12-07 10:18:15,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:15,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567372017] [2019-12-07 10:18:15,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:15,514 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 10:18:15,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567372017] [2019-12-07 10:18:15,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:15,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:18:15,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894856697] [2019-12-07 10:18:15,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:18:15,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:15,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:18:15,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:18:15,516 INFO L87 Difference]: Start difference. First operand 1993 states and 4274 transitions. Second operand 5 states. [2019-12-07 10:18:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:15,819 INFO L93 Difference]: Finished difference Result 2878 states and 6078 transitions. [2019-12-07 10:18:15,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:18:15,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 10:18:15,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:15,825 INFO L225 Difference]: With dead ends: 2878 [2019-12-07 10:18:15,825 INFO L226 Difference]: Without dead ends: 2878 [2019-12-07 10:18:15,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:18:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2019-12-07 10:18:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2455. [2019-12-07 10:18:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2455 states. [2019-12-07 10:18:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 5239 transitions. [2019-12-07 10:18:15,866 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 5239 transitions. Word has length 26 [2019-12-07 10:18:15,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:15,866 INFO L462 AbstractCegarLoop]: Abstraction has 2455 states and 5239 transitions. [2019-12-07 10:18:15,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:18:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 5239 transitions. [2019-12-07 10:18:15,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:18:15,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:15,869 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 10:18:15,869 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1286104553, now seen corresponding path program 1 times [2019-12-07 10:18:15,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:15,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198734394] [2019-12-07 10:18:15,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:15,920 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 10:18:15,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198734394] [2019-12-07 10:18:15,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:15,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:18:15,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272821196] [2019-12-07 10:18:15,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:18:15,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:15,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:18:15,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:18:15,921 INFO L87 Difference]: Start difference. First operand 2455 states and 5239 transitions. Second operand 5 states. [2019-12-07 10:18:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:16,071 INFO L93 Difference]: Finished difference Result 2934 states and 6185 transitions. [2019-12-07 10:18:16,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:18:16,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 10:18:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:16,076 INFO L225 Difference]: With dead ends: 2934 [2019-12-07 10:18:16,076 INFO L226 Difference]: Without dead ends: 2934 [2019-12-07 10:18:16,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:18:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2019-12-07 10:18:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2422. [2019-12-07 10:18:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2422 states. [2019-12-07 10:18:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 5163 transitions. [2019-12-07 10:18:16,115 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 5163 transitions. Word has length 26 [2019-12-07 10:18:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:16,115 INFO L462 AbstractCegarLoop]: Abstraction has 2422 states and 5163 transitions. [2019-12-07 10:18:16,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:18:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 5163 transitions. [2019-12-07 10:18:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:18:16,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:16,117 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 10:18:16,117 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:16,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1537408145, now seen corresponding path program 1 times [2019-12-07 10:18:16,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:16,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503953511] [2019-12-07 10:18:16,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:18:16,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503953511] [2019-12-07 10:18:16,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:16,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:18:16,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539433127] [2019-12-07 10:18:16,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:18:16,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:16,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:18:16,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:18:16,167 INFO L87 Difference]: Start difference. First operand 2422 states and 5163 transitions. Second operand 4 states. [2019-12-07 10:18:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:16,189 INFO L93 Difference]: Finished difference Result 4221 states and 9049 transitions. [2019-12-07 10:18:16,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:18:16,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 10:18:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:16,194 INFO L225 Difference]: With dead ends: 4221 [2019-12-07 10:18:16,194 INFO L226 Difference]: Without dead ends: 3506 [2019-12-07 10:18:16,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 10:18:16,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2019-12-07 10:18:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3490. [2019-12-07 10:18:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-12-07 10:18:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 7474 transitions. [2019-12-07 10:18:16,243 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 7474 transitions. Word has length 27 [2019-12-07 10:18:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:16,243 INFO L462 AbstractCegarLoop]: Abstraction has 3490 states and 7474 transitions. [2019-12-07 10:18:16,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:18:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 7474 transitions. [2019-12-07 10:18:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:18:16,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:16,247 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 10:18:16,248 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1804230119, now seen corresponding path program 1 times [2019-12-07 10:18:16,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:16,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449259154] [2019-12-07 10:18:16,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:18:16,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449259154] [2019-12-07 10:18:16,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:16,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:18:16,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027736421] [2019-12-07 10:18:16,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:18:16,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:16,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:18:16,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:18:16,284 INFO L87 Difference]: Start difference. First operand 3490 states and 7474 transitions. Second operand 4 states. [2019-12-07 10:18:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:16,301 INFO L93 Difference]: Finished difference Result 2022 states and 4139 transitions. [2019-12-07 10:18:16,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:18:16,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 10:18:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:16,324 INFO L225 Difference]: With dead ends: 2022 [2019-12-07 10:18:16,324 INFO L226 Difference]: Without dead ends: 1979 [2019-12-07 10:18:16,324 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 10:18:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-12-07 10:18:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1221. [2019-12-07 10:18:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-12-07 10:18:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 2510 transitions. [2019-12-07 10:18:16,345 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 2510 transitions. Word has length 28 [2019-12-07 10:18:16,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:16,346 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 2510 transitions. [2019-12-07 10:18:16,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:18:16,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 2510 transitions. [2019-12-07 10:18:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 10:18:16,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:16,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:16,348 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:16,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:16,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1370475912, now seen corresponding path program 1 times [2019-12-07 10:18:16,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:16,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756109582] [2019-12-07 10:18:16,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:16,413 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 10:18:16,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756109582] [2019-12-07 10:18:16,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:16,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:18:16,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885524613] [2019-12-07 10:18:16,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:18:16,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:16,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:18:16,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:18:16,415 INFO L87 Difference]: Start difference. First operand 1221 states and 2510 transitions. Second operand 6 states. [2019-12-07 10:18:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:16,829 INFO L93 Difference]: Finished difference Result 1600 states and 3225 transitions. [2019-12-07 10:18:16,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:18:16,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-07 10:18:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:16,831 INFO L225 Difference]: With dead ends: 1600 [2019-12-07 10:18:16,831 INFO L226 Difference]: Without dead ends: 1600 [2019-12-07 10:18:16,831 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 10:18:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2019-12-07 10:18:16,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1284. [2019-12-07 10:18:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-07 10:18:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2634 transitions. [2019-12-07 10:18:16,848 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2634 transitions. Word has length 51 [2019-12-07 10:18:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:16,848 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2634 transitions. [2019-12-07 10:18:16,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:18:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2634 transitions. [2019-12-07 10:18:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 10:18:16,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:16,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:16,850 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:16,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:16,850 INFO L82 PathProgramCache]: Analyzing trace with hash -678347650, now seen corresponding path program 2 times [2019-12-07 10:18:16,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:16,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37189356] [2019-12-07 10:18:16,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:16,903 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 10:18:16,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37189356] [2019-12-07 10:18:16,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:16,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:18:16,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489824689] [2019-12-07 10:18:16,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:18:16,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:16,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:18:16,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:18:16,904 INFO L87 Difference]: Start difference. First operand 1284 states and 2634 transitions. Second operand 5 states. [2019-12-07 10:18:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:17,053 INFO L93 Difference]: Finished difference Result 1413 states and 2867 transitions. [2019-12-07 10:18:17,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:18:17,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 10:18:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:17,056 INFO L225 Difference]: With dead ends: 1413 [2019-12-07 10:18:17,056 INFO L226 Difference]: Without dead ends: 1413 [2019-12-07 10:18:17,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:18:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-12-07 10:18:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1292. [2019-12-07 10:18:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-12-07 10:18:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2651 transitions. [2019-12-07 10:18:17,070 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2651 transitions. Word has length 51 [2019-12-07 10:18:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:17,070 INFO L462 AbstractCegarLoop]: Abstraction has 1292 states and 2651 transitions. [2019-12-07 10:18:17,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:18:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2651 transitions. [2019-12-07 10:18:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 10:18:17,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:17,072 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:18:17,072 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:17,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1065259256, now seen corresponding path program 3 times [2019-12-07 10:18:17,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:17,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165445305] [2019-12-07 10:18:17,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:17,135 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 10:18:17,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165445305] [2019-12-07 10:18:17,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:17,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:18:17,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549835914] [2019-12-07 10:18:17,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:18:17,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:17,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:18:17,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:18:17,136 INFO L87 Difference]: Start difference. First operand 1292 states and 2651 transitions. Second operand 3 states. [2019-12-07 10:18:17,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:17,146 INFO L93 Difference]: Finished difference Result 1292 states and 2650 transitions. [2019-12-07 10:18:17,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:18:17,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 10:18:17,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:17,149 INFO L225 Difference]: With dead ends: 1292 [2019-12-07 10:18:17,149 INFO L226 Difference]: Without dead ends: 1292 [2019-12-07 10:18:17,149 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 10:18:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-07 10:18:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1069. [2019-12-07 10:18:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-12-07 10:18:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2232 transitions. [2019-12-07 10:18:17,165 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2232 transitions. Word has length 51 [2019-12-07 10:18:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:17,165 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 2232 transitions. [2019-12-07 10:18:17,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:18:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2232 transitions. [2019-12-07 10:18:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 10:18:17,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:17,167 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 10:18:17,167 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:17,168 INFO L82 PathProgramCache]: Analyzing trace with hash -234851773, now seen corresponding path program 1 times [2019-12-07 10:18:17,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:17,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954725018] [2019-12-07 10:18:17,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:17,217 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 10:18:17,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954725018] [2019-12-07 10:18:17,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:17,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:18:17,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589869743] [2019-12-07 10:18:17,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:18:17,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:17,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:18:17,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:18:17,219 INFO L87 Difference]: Start difference. First operand 1069 states and 2232 transitions. Second operand 3 states. [2019-12-07 10:18:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:17,258 INFO L93 Difference]: Finished difference Result 1262 states and 2633 transitions. [2019-12-07 10:18:17,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:18:17,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 10:18:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:17,260 INFO L225 Difference]: With dead ends: 1262 [2019-12-07 10:18:17,260 INFO L226 Difference]: Without dead ends: 1262 [2019-12-07 10:18:17,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:18:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-12-07 10:18:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 967. [2019-12-07 10:18:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2019-12-07 10:18:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 2040 transitions. [2019-12-07 10:18:17,271 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 2040 transitions. Word has length 52 [2019-12-07 10:18:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:17,272 INFO L462 AbstractCegarLoop]: Abstraction has 967 states and 2040 transitions. [2019-12-07 10:18:17,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:18:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 2040 transitions. [2019-12-07 10:18:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 10:18:17,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:17,273 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 10:18:17,273 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:17,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:17,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1478308957, now seen corresponding path program 1 times [2019-12-07 10:18:17,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:17,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673538876] [2019-12-07 10:18:17,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:18:17,345 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 10:18:17,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673538876] [2019-12-07 10:18:17,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:18:17,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:18:17,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967715148] [2019-12-07 10:18:17,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:18:17,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:18:17,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:18:17,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:18:17,347 INFO L87 Difference]: Start difference. First operand 967 states and 2040 transitions. Second operand 7 states. [2019-12-07 10:18:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:18:17,627 INFO L93 Difference]: Finished difference Result 3601 states and 7436 transitions. [2019-12-07 10:18:17,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:18:17,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 10:18:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:18:17,630 INFO L225 Difference]: With dead ends: 3601 [2019-12-07 10:18:17,630 INFO L226 Difference]: Without dead ends: 2426 [2019-12-07 10:18:17,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:18:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2019-12-07 10:18:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 1024. [2019-12-07 10:18:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2019-12-07 10:18:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2144 transitions. [2019-12-07 10:18:17,646 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2144 transitions. Word has length 53 [2019-12-07 10:18:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:18:17,646 INFO L462 AbstractCegarLoop]: Abstraction has 1024 states and 2144 transitions. [2019-12-07 10:18:17,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:18:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2144 transitions. [2019-12-07 10:18:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 10:18:17,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:18:17,648 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 10:18:17,648 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:18:17,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:18:17,648 INFO L82 PathProgramCache]: Analyzing trace with hash -409769665, now seen corresponding path program 2 times [2019-12-07 10:18:17,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:18:17,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189573254] [2019-12-07 10:18:17,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:18:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:18:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:18:17,739 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:18:17,739 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:18:17,741 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) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_27| 1)) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1097~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1097~0.base_27|) |v_ULTIMATE.start_main_~#t1097~0.offset_19| 0)) |v_#memory_int_11|) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$r_buff0_thd1~0_174 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_27|)) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_45) (= v_~z$w_buff0~0_252 0) (= v_~z~0_120 0) (= v_~z$r_buff0_thd0~0_134 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~main$tmp_guard0~0_20 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_33) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1097~0.base_27|) (= |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_ULTIMATE.start_main_~#t1097~0.offset_19| 0) (= v_~z$w_buff1_used~0_306 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1097~0.base_27| 4)) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$r_buff0_thd2~0_279 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_160, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~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, ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_606, ~z$w_buff0~0=v_~z$w_buff0~0_252, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_306, ~z$flush_delayed~0=v_~z$flush_delayed~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_~#t1097~0.base=|v_ULTIMATE.start_main_~#t1097~0.base_27|, #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|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~0.base_22|, ~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, ULTIMATE.start_main_~#t1097~0.offset=|v_ULTIMATE.start_main_~#t1097~0.offset_19|, ~x~0=v_~x~0_98} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~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, ULTIMATE.start_main_~#t1098~0.offset, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1097~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t1098~0.base, ~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, ULTIMATE.start_main_~#t1097~0.offset, ~x~0] because there is no mapped edge [2019-12-07 10:18:17,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~z$r_buff1_thd2~0_Out-1091220198 ~z$r_buff0_thd2~0_In-1091220198) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1091220198)) (= ~z$r_buff0_thd1~0_In-1091220198 ~z$r_buff1_thd1~0_Out-1091220198) (= 1 ~x~0_Out-1091220198) (= ~z$r_buff0_thd0~0_In-1091220198 ~z$r_buff1_thd0~0_Out-1091220198) (= 1 ~z$r_buff0_thd1~0_Out-1091220198)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1091220198, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1091220198, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1091220198, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1091220198} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1091220198, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1091220198, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1091220198, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1091220198, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1091220198, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1091220198, ~x~0=~x~0_Out-1091220198, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1091220198} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 10:18:17,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1098~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1098~0.base_11| 0)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11|) |v_ULTIMATE.start_main_~#t1098~0.offset_10| 1)) |v_#memory_int_5|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1098~0.base_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1098~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1098~0.offset, ULTIMATE.start_main_~#t1098~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 10:18:17,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2121363527 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2121363527 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2121363527| ~z$w_buff0_used~0_In2121363527)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2121363527| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2121363527, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121363527} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2121363527|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2121363527, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121363527} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 10:18:17,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-921525876 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-921525876 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-921525876 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-921525876 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-921525876 |P0Thread1of1ForFork0_#t~ite6_Out-921525876|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-921525876| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-921525876, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-921525876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-921525876, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-921525876} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-921525876|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-921525876, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-921525876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-921525876, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-921525876} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 10:18:17,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-629745605 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-629745605 256))) (.cse2 (= ~z$r_buff0_thd1~0_Out-629745605 ~z$r_buff0_thd1~0_In-629745605))) (or (and (= ~z$r_buff0_thd1~0_Out-629745605 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-629745605, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-629745605} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-629745605, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-629745605|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-629745605} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:18:17,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In2105048073 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2105048073 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In2105048073 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In2105048073 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out2105048073| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out2105048073| ~z$r_buff1_thd1~0_In2105048073)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2105048073, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2105048073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2105048073, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2105048073} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2105048073, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2105048073|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2105048073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2105048073, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2105048073} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 10:18:17,747 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 10:18:17,747 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 10:18:17,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-454154949 256)))) (or (and (= ~z$r_buff1_thd2~0_In-454154949 |P1Thread1of1ForFork1_#t~ite29_Out-454154949|) (= |P1Thread1of1ForFork1_#t~ite30_Out-454154949| |P1Thread1of1ForFork1_#t~ite29_Out-454154949|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-454154949 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-454154949 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In-454154949 256) 0)) (= (mod ~z$w_buff0_used~0_In-454154949 256) 0)))) (and (= |P1Thread1of1ForFork1_#t~ite29_In-454154949| |P1Thread1of1ForFork1_#t~ite29_Out-454154949|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-454154949| ~z$r_buff1_thd2~0_In-454154949)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-454154949|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-454154949, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-454154949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-454154949, ~weak$$choice2~0=~weak$$choice2~0_In-454154949, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-454154949} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-454154949|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-454154949|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-454154949, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-454154949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-454154949, ~weak$$choice2~0=~weak$$choice2~0_In-454154949, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-454154949} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 10:18:17,748 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 10:18:17,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1816745652 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1816745652 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1816745652| ~z$w_buff1~0_In1816745652) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1816745652| ~z~0_In1816745652)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1816745652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816745652, ~z$w_buff1~0=~z$w_buff1~0_In1816745652, ~z~0=~z~0_In1816745652} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1816745652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816745652, ~z$w_buff1~0=~z$w_buff1~0_In1816745652, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1816745652|, ~z~0=~z~0_In1816745652} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 10:18:17,748 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 10:18:17,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-661797671 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-661797671 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-661797671|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-661797671 |P1Thread1of1ForFork1_#t~ite34_Out-661797671|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-661797671, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-661797671} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-661797671, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-661797671|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-661797671} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 10:18:17,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In654265737 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In654265737 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In654265737 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In654265737 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out654265737| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out654265737| ~z$w_buff1_used~0_In654265737) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In654265737, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In654265737, ~z$w_buff1_used~0=~z$w_buff1_used~0_In654265737, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In654265737} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In654265737, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In654265737, ~z$w_buff1_used~0=~z$w_buff1_used~0_In654265737, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out654265737|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In654265737} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 10:18:17,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-715104310 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-715104310 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-715104310|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-715104310 |P1Thread1of1ForFork1_#t~ite36_Out-715104310|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-715104310, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-715104310} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-715104310, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-715104310, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-715104310|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 10:18:17,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-946427230 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-946427230 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-946427230 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-946427230 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-946427230 |P1Thread1of1ForFork1_#t~ite37_Out-946427230|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-946427230|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-946427230, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-946427230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-946427230, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-946427230} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-946427230, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-946427230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-946427230, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-946427230, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-946427230|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 10:18:17,749 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 10:18:17,749 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 10:18:17,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-152873049 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite40_Out-152873049| |ULTIMATE.start_main_#t~ite41_Out-152873049|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-152873049 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-152873049| ~z~0_In-152873049) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-152873049| ~z$w_buff1~0_In-152873049) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-152873049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-152873049, ~z$w_buff1~0=~z$w_buff1~0_In-152873049, ~z~0=~z~0_In-152873049} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-152873049|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-152873049|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-152873049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-152873049, ~z$w_buff1~0=~z$w_buff1~0_In-152873049, ~z~0=~z~0_In-152873049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 10:18:17,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2114624376 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2114624376 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2114624376 |ULTIMATE.start_main_#t~ite42_Out-2114624376|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-2114624376|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2114624376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2114624376} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2114624376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2114624376, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2114624376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 10:18:17,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1811484376 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1811484376 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1811484376 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1811484376 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1811484376| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1811484376| ~z$w_buff1_used~0_In-1811484376) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1811484376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1811484376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1811484376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1811484376} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1811484376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1811484376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1811484376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1811484376, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1811484376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 10:18:17,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In197766721 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In197766721 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out197766721|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In197766721 |ULTIMATE.start_main_#t~ite44_Out197766721|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In197766721, ~z$w_buff0_used~0=~z$w_buff0_used~0_In197766721} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In197766721, ~z$w_buff0_used~0=~z$w_buff0_used~0_In197766721, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out197766721|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:18:17,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-746861885 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-746861885 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-746861885 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-746861885 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-746861885| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out-746861885| ~z$r_buff1_thd0~0_In-746861885) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-746861885, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746861885, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-746861885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-746861885} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-746861885, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746861885, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-746861885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-746861885, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-746861885|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:18:17,751 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 10:18:17,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:18:17 BasicIcfg [2019-12-07 10:18:17,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:18:17,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:18:17,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:18:17,805 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:18:17,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:18:10" (3/4) ... [2019-12-07 10:18:17,807 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:18:17,808 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) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_27| 1)) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1097~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1097~0.base_27|) |v_ULTIMATE.start_main_~#t1097~0.offset_19| 0)) |v_#memory_int_11|) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$r_buff0_thd1~0_174 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_27|)) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_45) (= v_~z$w_buff0~0_252 0) (= v_~z~0_120 0) (= v_~z$r_buff0_thd0~0_134 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~main$tmp_guard0~0_20 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_33) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1097~0.base_27|) (= |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_ULTIMATE.start_main_~#t1097~0.offset_19| 0) (= v_~z$w_buff1_used~0_306 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1097~0.base_27| 4)) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$r_buff0_thd2~0_279 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_160, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~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, ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_606, ~z$w_buff0~0=v_~z$w_buff0~0_252, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_306, ~z$flush_delayed~0=v_~z$flush_delayed~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_~#t1097~0.base=|v_ULTIMATE.start_main_~#t1097~0.base_27|, #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|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~0.base_22|, ~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, ULTIMATE.start_main_~#t1097~0.offset=|v_ULTIMATE.start_main_~#t1097~0.offset_19|, ~x~0=v_~x~0_98} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~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, ULTIMATE.start_main_~#t1098~0.offset, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1097~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t1098~0.base, ~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, ULTIMATE.start_main_~#t1097~0.offset, ~x~0] because there is no mapped edge [2019-12-07 10:18:17,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~z$r_buff1_thd2~0_Out-1091220198 ~z$r_buff0_thd2~0_In-1091220198) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1091220198)) (= ~z$r_buff0_thd1~0_In-1091220198 ~z$r_buff1_thd1~0_Out-1091220198) (= 1 ~x~0_Out-1091220198) (= ~z$r_buff0_thd0~0_In-1091220198 ~z$r_buff1_thd0~0_Out-1091220198) (= 1 ~z$r_buff0_thd1~0_Out-1091220198)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1091220198, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1091220198, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1091220198, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1091220198} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1091220198, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1091220198, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1091220198, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1091220198, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1091220198, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1091220198, ~x~0=~x~0_Out-1091220198, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1091220198} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 10:18:17,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1098~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1098~0.base_11| 0)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11|) |v_ULTIMATE.start_main_~#t1098~0.offset_10| 1)) |v_#memory_int_5|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1098~0.base_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1098~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1098~0.offset, ULTIMATE.start_main_~#t1098~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 10:18:17,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2121363527 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2121363527 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2121363527| ~z$w_buff0_used~0_In2121363527)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2121363527| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2121363527, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121363527} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2121363527|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2121363527, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121363527} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 10:18:17,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-921525876 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-921525876 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-921525876 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-921525876 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-921525876 |P0Thread1of1ForFork0_#t~ite6_Out-921525876|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-921525876| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-921525876, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-921525876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-921525876, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-921525876} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-921525876|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-921525876, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-921525876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-921525876, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-921525876} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 10:18:17,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-629745605 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-629745605 256))) (.cse2 (= ~z$r_buff0_thd1~0_Out-629745605 ~z$r_buff0_thd1~0_In-629745605))) (or (and (= ~z$r_buff0_thd1~0_Out-629745605 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-629745605, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-629745605} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-629745605, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-629745605|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-629745605} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:18:17,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In2105048073 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2105048073 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In2105048073 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In2105048073 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out2105048073| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out2105048073| ~z$r_buff1_thd1~0_In2105048073)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2105048073, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2105048073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2105048073, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2105048073} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2105048073, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2105048073|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2105048073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2105048073, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2105048073} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 10:18:17,814 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 10:18:17,815 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 10:18:17,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-454154949 256)))) (or (and (= ~z$r_buff1_thd2~0_In-454154949 |P1Thread1of1ForFork1_#t~ite29_Out-454154949|) (= |P1Thread1of1ForFork1_#t~ite30_Out-454154949| |P1Thread1of1ForFork1_#t~ite29_Out-454154949|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-454154949 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-454154949 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In-454154949 256) 0)) (= (mod ~z$w_buff0_used~0_In-454154949 256) 0)))) (and (= |P1Thread1of1ForFork1_#t~ite29_In-454154949| |P1Thread1of1ForFork1_#t~ite29_Out-454154949|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-454154949| ~z$r_buff1_thd2~0_In-454154949)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-454154949|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-454154949, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-454154949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-454154949, ~weak$$choice2~0=~weak$$choice2~0_In-454154949, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-454154949} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-454154949|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-454154949|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-454154949, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-454154949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-454154949, ~weak$$choice2~0=~weak$$choice2~0_In-454154949, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-454154949} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 10:18:17,815 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 10:18:17,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1816745652 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1816745652 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1816745652| ~z$w_buff1~0_In1816745652) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1816745652| ~z~0_In1816745652)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1816745652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816745652, ~z$w_buff1~0=~z$w_buff1~0_In1816745652, ~z~0=~z~0_In1816745652} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1816745652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816745652, ~z$w_buff1~0=~z$w_buff1~0_In1816745652, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1816745652|, ~z~0=~z~0_In1816745652} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 10:18:17,816 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 10:18:17,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-661797671 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-661797671 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-661797671|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-661797671 |P1Thread1of1ForFork1_#t~ite34_Out-661797671|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-661797671, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-661797671} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-661797671, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-661797671|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-661797671} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 10:18:17,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In654265737 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In654265737 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In654265737 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In654265737 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out654265737| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out654265737| ~z$w_buff1_used~0_In654265737) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In654265737, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In654265737, ~z$w_buff1_used~0=~z$w_buff1_used~0_In654265737, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In654265737} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In654265737, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In654265737, ~z$w_buff1_used~0=~z$w_buff1_used~0_In654265737, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out654265737|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In654265737} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 10:18:17,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-715104310 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-715104310 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-715104310|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-715104310 |P1Thread1of1ForFork1_#t~ite36_Out-715104310|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-715104310, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-715104310} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-715104310, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-715104310, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-715104310|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 10:18:17,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-946427230 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-946427230 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-946427230 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-946427230 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-946427230 |P1Thread1of1ForFork1_#t~ite37_Out-946427230|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-946427230|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-946427230, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-946427230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-946427230, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-946427230} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-946427230, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-946427230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-946427230, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-946427230, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-946427230|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 10:18:17,817 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 10:18:17,817 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 10:18:17,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-152873049 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite40_Out-152873049| |ULTIMATE.start_main_#t~ite41_Out-152873049|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-152873049 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-152873049| ~z~0_In-152873049) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-152873049| ~z$w_buff1~0_In-152873049) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-152873049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-152873049, ~z$w_buff1~0=~z$w_buff1~0_In-152873049, ~z~0=~z~0_In-152873049} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-152873049|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-152873049|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-152873049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-152873049, ~z$w_buff1~0=~z$w_buff1~0_In-152873049, ~z~0=~z~0_In-152873049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 10:18:17,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2114624376 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2114624376 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2114624376 |ULTIMATE.start_main_#t~ite42_Out-2114624376|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-2114624376|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2114624376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2114624376} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2114624376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2114624376, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2114624376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 10:18:17,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1811484376 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1811484376 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1811484376 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1811484376 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1811484376| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1811484376| ~z$w_buff1_used~0_In-1811484376) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1811484376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1811484376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1811484376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1811484376} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1811484376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1811484376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1811484376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1811484376, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1811484376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 10:18:17,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In197766721 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In197766721 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out197766721|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In197766721 |ULTIMATE.start_main_#t~ite44_Out197766721|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In197766721, ~z$w_buff0_used~0=~z$w_buff0_used~0_In197766721} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In197766721, ~z$w_buff0_used~0=~z$w_buff0_used~0_In197766721, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out197766721|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:18:17,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-746861885 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-746861885 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-746861885 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-746861885 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-746861885| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out-746861885| ~z$r_buff1_thd0~0_In-746861885) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-746861885, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746861885, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-746861885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-746861885} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-746861885, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746861885, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-746861885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-746861885, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-746861885|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:18:17,818 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 10:18:17,886 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c227a07e-a62e-4910-a116-797c75a5a26a/bin/uautomizer/witness.graphml [2019-12-07 10:18:17,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:18:17,888 INFO L168 Benchmark]: Toolchain (without parser) took 8294.82 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.4 MB). Free memory was 934.4 MB in the beginning and 1.3 GB in the end (delta: -383.2 MB). Peak memory consumption was 374.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:18:17,888 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:18:17,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -118.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:18:17,889 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.08 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:18:17,889 INFO L168 Benchmark]: Boogie Preprocessor took 24.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:18:17,889 INFO L168 Benchmark]: RCFGBuilder took 382.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 996.5 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:18:17,889 INFO L168 Benchmark]: TraceAbstraction took 7358.88 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 996.5 MB in the beginning and 786.6 MB in the end (delta: 209.9 MB). Peak memory consumption was 340.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:18:17,889 INFO L168 Benchmark]: Witness Printer took 82.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 127.9 MB). Free memory was 786.6 MB in the beginning and 1.3 GB in the end (delta: -531.0 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:18:17,891 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -118.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.08 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 382.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 996.5 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7358.88 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 996.5 MB in the beginning and 786.6 MB in the end (delta: 209.9 MB). Peak memory consumption was 340.4 MB. Max. memory is 11.5 GB. * Witness Printer took 82.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 127.9 MB). Free memory was 786.6 MB in the beginning and 1.3 GB in the end (delta: -531.0 MB). Peak memory consumption was 11.4 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(&t1097, ((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(&t1098, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.2s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2244 SDtfs, 1508 SDslu, 4021 SDs, 0 SdLazy, 2023 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 5818 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 101355 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...