./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_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_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/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 6b55418eaa2ec3212dd6ecf5ad533b8a46d5e088 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 16:36:15,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:36:15,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:36:15,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:36:15,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:36:15,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:36:15,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:36:15,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:36:15,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:36:15,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:36:15,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:36:15,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:36:15,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:36:15,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:36:15,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:36:15,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:36:15,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:36:15,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:36:15,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:36:15,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:36:15,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:36:15,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:36:15,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:36:15,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:36:15,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:36:15,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:36:15,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:36:15,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:36:15,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:36:15,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:36:15,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:36:15,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:36:15,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:36:15,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:36:15,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:36:15,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:36:15,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:36:15,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:36:15,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:36:15,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:36:15,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:36:15,999 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:36:16,008 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:36:16,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:36:16,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:36:16,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:36:16,009 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:36:16,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:36:16,009 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:36:16,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:36:16,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:36:16,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:36:16,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:36:16,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:36:16,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:36:16,010 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:36:16,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:36:16,010 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:36:16,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:36:16,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:36:16,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:36:16,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:36:16,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:36:16,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:36:16,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:36:16,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:36:16,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:36:16,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:36:16,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:36:16,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:36:16,012 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:36:16,012 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_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/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 -> 6b55418eaa2ec3212dd6ecf5ad533b8a46d5e088 [2019-12-07 16:36:16,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:36:16,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:36:16,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:36:16,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:36:16,121 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:36:16,122 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i [2019-12-07 16:36:16,159 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/bin/uautomizer/data/7aca8199d/7f7b66e2c53240eeb9f3bbf29ca6b1d6/FLAGb494a49ba [2019-12-07 16:36:16,537 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:36:16,538 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i [2019-12-07 16:36:16,550 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/bin/uautomizer/data/7aca8199d/7f7b66e2c53240eeb9f3bbf29ca6b1d6/FLAGb494a49ba [2019-12-07 16:36:16,560 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/bin/uautomizer/data/7aca8199d/7f7b66e2c53240eeb9f3bbf29ca6b1d6 [2019-12-07 16:36:16,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:36:16,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:36:16,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:36:16,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:36:16,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:36:16,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:36:16" (1/1) ... [2019-12-07 16:36:16,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16, skipping insertion in model container [2019-12-07 16:36:16,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:36:16" (1/1) ... [2019-12-07 16:36:16,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:36:16,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:36:16,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:36:16,841 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:36:16,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:36:16,926 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:36:16,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16 WrapperNode [2019-12-07 16:36:16,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:36:16,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:36:16,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:36:16,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:36:16,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16" (1/1) ... [2019-12-07 16:36:16,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16" (1/1) ... [2019-12-07 16:36:16,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:36:16,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:36:16,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:36:16,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:36:16,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16" (1/1) ... [2019-12-07 16:36:16,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16" (1/1) ... [2019-12-07 16:36:16,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16" (1/1) ... [2019-12-07 16:36:16,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16" (1/1) ... [2019-12-07 16:36:16,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16" (1/1) ... [2019-12-07 16:36:16,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16" (1/1) ... [2019-12-07 16:36:16,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16" (1/1) ... [2019-12-07 16:36:16,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:36:16,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:36:16,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:36:16,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:36:16,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/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 16:36:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:36:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:36:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:36:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:36:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:36:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:36:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:36:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:36:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:36:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:36:17,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:36:17,036 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 16:36:17,347 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:36:17,348 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:36:17,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:36:17 BoogieIcfgContainer [2019-12-07 16:36:17,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:36:17,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:36:17,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:36:17,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:36:17,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:36:16" (1/3) ... [2019-12-07 16:36:17,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e684f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:36:17, skipping insertion in model container [2019-12-07 16:36:17,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:36:16" (2/3) ... [2019-12-07 16:36:17,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e684f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:36:17, skipping insertion in model container [2019-12-07 16:36:17,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:36:17" (3/3) ... [2019-12-07 16:36:17,355 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.oepc.i [2019-12-07 16:36:17,363 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:36:17,363 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:36:17,367 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:36:17,368 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:36:17,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,391 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,391 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:36:17,420 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 16:36:17,432 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:36:17,432 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:36:17,432 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:36:17,432 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:36:17,432 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:36:17,432 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:36:17,432 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:36:17,432 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:36:17,442 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-07 16:36:17,444 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-07 16:36:17,487 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-07 16:36:17,487 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:36:17,494 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 16:36:17,505 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-07 16:36:17,529 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-07 16:36:17,529 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:36:17,533 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 16:36:17,542 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 16:36:17,543 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:36:20,014 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 16:36:20,103 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-12-07 16:36:20,103 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-07 16:36:20,105 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-12-07 16:36:20,327 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-12-07 16:36:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-12-07 16:36:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 16:36:20,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:20,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 16:36:20,333 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:20,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-12-07 16:36:20,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:20,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491938336] [2019-12-07 16:36:20,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:20,481 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 16:36:20,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491938336] [2019-12-07 16:36:20,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:20,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:36:20,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720335030] [2019-12-07 16:36:20,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:36:20,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:20,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:36:20,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:36:20,497 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-12-07 16:36:20,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:20,693 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-12-07 16:36:20,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:36:20,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 16:36:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:20,755 INFO L225 Difference]: With dead ends: 5990 [2019-12-07 16:36:20,755 INFO L226 Difference]: Without dead ends: 5642 [2019-12-07 16:36:20,756 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 16:36:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-12-07 16:36:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-12-07 16:36:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-12-07 16:36:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-12-07 16:36:20,962 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-12-07 16:36:20,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:20,963 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-12-07 16:36:20,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:36:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-12-07 16:36:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:36:20,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:20,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:36:20,966 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-12-07 16:36:20,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:20,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096023776] [2019-12-07 16:36:20,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:21,022 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 16:36:21,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096023776] [2019-12-07 16:36:21,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:21,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:36:21,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580877828] [2019-12-07 16:36:21,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:36:21,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:21,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:36:21,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:36:21,024 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 4 states. [2019-12-07 16:36:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:21,249 INFO L93 Difference]: Finished difference Result 8500 states and 27431 transitions. [2019-12-07 16:36:21,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:36:21,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 16:36:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:21,299 INFO L225 Difference]: With dead ends: 8500 [2019-12-07 16:36:21,299 INFO L226 Difference]: Without dead ends: 8487 [2019-12-07 16:36:21,300 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 16:36:21,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-12-07 16:36:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 7476. [2019-12-07 16:36:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7476 states. [2019-12-07 16:36:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24583 transitions. [2019-12-07 16:36:21,485 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24583 transitions. Word has length 11 [2019-12-07 16:36:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:21,485 INFO L462 AbstractCegarLoop]: Abstraction has 7476 states and 24583 transitions. [2019-12-07 16:36:21,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:36:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24583 transitions. [2019-12-07 16:36:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:36:21,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:21,489 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:36:21,489 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-12-07 16:36:21,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:21,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557828997] [2019-12-07 16:36:21,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:21,520 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 16:36:21,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557828997] [2019-12-07 16:36:21,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:21,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:36:21,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363133253] [2019-12-07 16:36:21,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:36:21,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:21,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:36:21,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:36:21,521 INFO L87 Difference]: Start difference. First operand 7476 states and 24583 transitions. Second operand 3 states. [2019-12-07 16:36:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:21,602 INFO L93 Difference]: Finished difference Result 10006 states and 32837 transitions. [2019-12-07 16:36:21,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:36:21,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 16:36:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:21,644 INFO L225 Difference]: With dead ends: 10006 [2019-12-07 16:36:21,644 INFO L226 Difference]: Without dead ends: 10006 [2019-12-07 16:36:21,644 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 16:36:21,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10006 states. [2019-12-07 16:36:21,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10006 to 8662. [2019-12-07 16:36:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8662 states. [2019-12-07 16:36:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 28605 transitions. [2019-12-07 16:36:21,870 INFO L78 Accepts]: Start accepts. Automaton has 8662 states and 28605 transitions. Word has length 14 [2019-12-07 16:36:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:21,871 INFO L462 AbstractCegarLoop]: Abstraction has 8662 states and 28605 transitions. [2019-12-07 16:36:21,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:36:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 8662 states and 28605 transitions. [2019-12-07 16:36:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:36:21,873 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:21,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:36:21,874 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:21,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:21,874 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-12-07 16:36:21,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:21,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681781261] [2019-12-07 16:36:21,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:21,926 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 16:36:21,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681781261] [2019-12-07 16:36:21,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:21,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:36:21,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902029615] [2019-12-07 16:36:21,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:36:21,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:21,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:36:21,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:36:21,928 INFO L87 Difference]: Start difference. First operand 8662 states and 28605 transitions. Second operand 4 states. [2019-12-07 16:36:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:22,063 INFO L93 Difference]: Finished difference Result 10925 states and 35253 transitions. [2019-12-07 16:36:22,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:36:22,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 16:36:22,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:22,087 INFO L225 Difference]: With dead ends: 10925 [2019-12-07 16:36:22,087 INFO L226 Difference]: Without dead ends: 10913 [2019-12-07 16:36:22,088 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 16:36:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10913 states. [2019-12-07 16:36:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10913 to 9512. [2019-12-07 16:36:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9512 states. [2019-12-07 16:36:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9512 states to 9512 states and 31144 transitions. [2019-12-07 16:36:22,272 INFO L78 Accepts]: Start accepts. Automaton has 9512 states and 31144 transitions. Word has length 14 [2019-12-07 16:36:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:22,273 INFO L462 AbstractCegarLoop]: Abstraction has 9512 states and 31144 transitions. [2019-12-07 16:36:22,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:36:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 9512 states and 31144 transitions. [2019-12-07 16:36:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:36:22,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:22,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:36:22,275 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:22,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:22,275 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-12-07 16:36:22,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:22,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964991070] [2019-12-07 16:36:22,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:22,316 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 16:36:22,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964991070] [2019-12-07 16:36:22,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:22,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:36:22,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911948881] [2019-12-07 16:36:22,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:36:22,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:22,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:36:22,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:36:22,317 INFO L87 Difference]: Start difference. First operand 9512 states and 31144 transitions. Second operand 4 states. [2019-12-07 16:36:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:22,442 INFO L93 Difference]: Finished difference Result 11905 states and 38437 transitions. [2019-12-07 16:36:22,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:36:22,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 16:36:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:22,469 INFO L225 Difference]: With dead ends: 11905 [2019-12-07 16:36:22,469 INFO L226 Difference]: Without dead ends: 11891 [2019-12-07 16:36:22,469 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 16:36:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2019-12-07 16:36:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 9738. [2019-12-07 16:36:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9738 states. [2019-12-07 16:36:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9738 states to 9738 states and 31931 transitions. [2019-12-07 16:36:22,685 INFO L78 Accepts]: Start accepts. Automaton has 9738 states and 31931 transitions. Word has length 14 [2019-12-07 16:36:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:22,685 INFO L462 AbstractCegarLoop]: Abstraction has 9738 states and 31931 transitions. [2019-12-07 16:36:22,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:36:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 9738 states and 31931 transitions. [2019-12-07 16:36:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:36:22,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:22,688 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:36:22,688 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:22,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2043144141, now seen corresponding path program 1 times [2019-12-07 16:36:22,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:22,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308916541] [2019-12-07 16:36:22,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:22,739 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 16:36:22,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308916541] [2019-12-07 16:36:22,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:22,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:36:22,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524453640] [2019-12-07 16:36:22,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:36:22,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:22,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:36:22,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:36:22,741 INFO L87 Difference]: Start difference. First operand 9738 states and 31931 transitions. Second operand 3 states. [2019-12-07 16:36:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:22,795 INFO L93 Difference]: Finished difference Result 16550 states and 54111 transitions. [2019-12-07 16:36:22,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:36:22,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 16:36:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:22,817 INFO L225 Difference]: With dead ends: 16550 [2019-12-07 16:36:22,818 INFO L226 Difference]: Without dead ends: 15886 [2019-12-07 16:36:22,818 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 16:36:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15886 states. [2019-12-07 16:36:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15886 to 15319. [2019-12-07 16:36:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15319 states. [2019-12-07 16:36:23,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15319 states to 15319 states and 50702 transitions. [2019-12-07 16:36:23,053 INFO L78 Accepts]: Start accepts. Automaton has 15319 states and 50702 transitions. Word has length 16 [2019-12-07 16:36:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:23,054 INFO L462 AbstractCegarLoop]: Abstraction has 15319 states and 50702 transitions. [2019-12-07 16:36:23,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:36:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 15319 states and 50702 transitions. [2019-12-07 16:36:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:36:23,058 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:23,058 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:36:23,059 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:23,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:23,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1927848057, now seen corresponding path program 1 times [2019-12-07 16:36:23,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:23,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248984019] [2019-12-07 16:36:23,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:23,129 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 16:36:23,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248984019] [2019-12-07 16:36:23,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:23,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:36:23,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165095137] [2019-12-07 16:36:23,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:36:23,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:23,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:36:23,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:36:23,131 INFO L87 Difference]: Start difference. First operand 15319 states and 50702 transitions. Second operand 4 states. [2019-12-07 16:36:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:23,182 INFO L93 Difference]: Finished difference Result 15168 states and 50237 transitions. [2019-12-07 16:36:23,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:36:23,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 16:36:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:23,201 INFO L225 Difference]: With dead ends: 15168 [2019-12-07 16:36:23,201 INFO L226 Difference]: Without dead ends: 15052 [2019-12-07 16:36:23,201 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 16:36:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15052 states. [2019-12-07 16:36:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15052 to 15052. [2019-12-07 16:36:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15052 states. [2019-12-07 16:36:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15052 states to 15052 states and 49867 transitions. [2019-12-07 16:36:23,449 INFO L78 Accepts]: Start accepts. Automaton has 15052 states and 49867 transitions. Word has length 17 [2019-12-07 16:36:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:23,450 INFO L462 AbstractCegarLoop]: Abstraction has 15052 states and 49867 transitions. [2019-12-07 16:36:23,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:36:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 15052 states and 49867 transitions. [2019-12-07 16:36:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:36:23,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:23,455 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:36:23,455 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:23,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1452760467, now seen corresponding path program 1 times [2019-12-07 16:36:23,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:23,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801625799] [2019-12-07 16:36:23,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:23,499 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 16:36:23,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801625799] [2019-12-07 16:36:23,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:23,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:36:23,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893449989] [2019-12-07 16:36:23,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:36:23,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:23,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:36:23,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:36:23,500 INFO L87 Difference]: Start difference. First operand 15052 states and 49867 transitions. Second operand 3 states. [2019-12-07 16:36:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:23,544 INFO L93 Difference]: Finished difference Result 14244 states and 46381 transitions. [2019-12-07 16:36:23,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:36:23,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:36:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:23,562 INFO L225 Difference]: With dead ends: 14244 [2019-12-07 16:36:23,562 INFO L226 Difference]: Without dead ends: 14244 [2019-12-07 16:36:23,562 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 16:36:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14244 states. [2019-12-07 16:36:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14244 to 14084. [2019-12-07 16:36:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14084 states. [2019-12-07 16:36:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14084 states to 14084 states and 45897 transitions. [2019-12-07 16:36:23,759 INFO L78 Accepts]: Start accepts. Automaton has 14084 states and 45897 transitions. Word has length 18 [2019-12-07 16:36:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:23,760 INFO L462 AbstractCegarLoop]: Abstraction has 14084 states and 45897 transitions. [2019-12-07 16:36:23,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:36:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 14084 states and 45897 transitions. [2019-12-07 16:36:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:36:23,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:23,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:36:23,765 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:23,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2069901673, now seen corresponding path program 1 times [2019-12-07 16:36:23,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:23,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866773711] [2019-12-07 16:36:23,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:23,791 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 16:36:23,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866773711] [2019-12-07 16:36:23,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:23,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:36:23,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421759741] [2019-12-07 16:36:23,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:36:23,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:23,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:36:23,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:36:23,792 INFO L87 Difference]: Start difference. First operand 14084 states and 45897 transitions. Second operand 3 states. [2019-12-07 16:36:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:23,801 INFO L93 Difference]: Finished difference Result 1973 states and 4784 transitions. [2019-12-07 16:36:23,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:36:23,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 16:36:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:23,803 INFO L225 Difference]: With dead ends: 1973 [2019-12-07 16:36:23,803 INFO L226 Difference]: Without dead ends: 1973 [2019-12-07 16:36:23,803 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 16:36:23,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2019-12-07 16:36:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1973. [2019-12-07 16:36:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1973 states. [2019-12-07 16:36:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 4784 transitions. [2019-12-07 16:36:23,821 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 4784 transitions. Word has length 19 [2019-12-07 16:36:23,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:23,821 INFO L462 AbstractCegarLoop]: Abstraction has 1973 states and 4784 transitions. [2019-12-07 16:36:23,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:36:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 4784 transitions. [2019-12-07 16:36:23,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:36:23,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:23,823 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 16:36:23,823 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:23,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:23,823 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-12-07 16:36:23,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:23,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543653157] [2019-12-07 16:36:23,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:23,858 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 16:36:23,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543653157] [2019-12-07 16:36:23,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:23,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:36:23,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335042176] [2019-12-07 16:36:23,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:36:23,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:23,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:36:23,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:36:23,860 INFO L87 Difference]: Start difference. First operand 1973 states and 4784 transitions. Second operand 5 states. [2019-12-07 16:36:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:23,973 INFO L93 Difference]: Finished difference Result 2552 states and 6074 transitions. [2019-12-07 16:36:23,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:36:23,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 16:36:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:23,976 INFO L225 Difference]: With dead ends: 2552 [2019-12-07 16:36:23,976 INFO L226 Difference]: Without dead ends: 2516 [2019-12-07 16:36:23,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 16:36:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-12-07 16:36:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2056. [2019-12-07 16:36:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-12-07 16:36:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 4961 transitions. [2019-12-07 16:36:23,998 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 4961 transitions. Word has length 26 [2019-12-07 16:36:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:23,999 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 4961 transitions. [2019-12-07 16:36:23,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:36:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 4961 transitions. [2019-12-07 16:36:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:36:24,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:24,000 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 16:36:24,000 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:24,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:24,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1381829350, now seen corresponding path program 1 times [2019-12-07 16:36:24,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:24,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884112901] [2019-12-07 16:36:24,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:24,066 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 16:36:24,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884112901] [2019-12-07 16:36:24,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:24,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:36:24,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399082520] [2019-12-07 16:36:24,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:36:24,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:24,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:36:24,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:36:24,068 INFO L87 Difference]: Start difference. First operand 2056 states and 4961 transitions. Second operand 5 states. [2019-12-07 16:36:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:24,175 INFO L93 Difference]: Finished difference Result 2314 states and 5527 transitions. [2019-12-07 16:36:24,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:36:24,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 16:36:24,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:24,178 INFO L225 Difference]: With dead ends: 2314 [2019-12-07 16:36:24,178 INFO L226 Difference]: Without dead ends: 2314 [2019-12-07 16:36:24,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:36:24,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-12-07 16:36:24,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2115. [2019-12-07 16:36:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2019-12-07 16:36:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 5071 transitions. [2019-12-07 16:36:24,202 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 5071 transitions. Word has length 27 [2019-12-07 16:36:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:24,203 INFO L462 AbstractCegarLoop]: Abstraction has 2115 states and 5071 transitions. [2019-12-07 16:36:24,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:36:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 5071 transitions. [2019-12-07 16:36:24,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:36:24,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:24,205 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 16:36:24,205 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:24,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2043230427, now seen corresponding path program 1 times [2019-12-07 16:36:24,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:24,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788840997] [2019-12-07 16:36:24,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:24,257 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 16:36:24,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788840997] [2019-12-07 16:36:24,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:24,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:36:24,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622527571] [2019-12-07 16:36:24,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:36:24,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:24,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:36:24,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:36:24,258 INFO L87 Difference]: Start difference. First operand 2115 states and 5071 transitions. Second operand 5 states. [2019-12-07 16:36:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:24,414 INFO L93 Difference]: Finished difference Result 2498 states and 5944 transitions. [2019-12-07 16:36:24,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:36:24,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 16:36:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:24,416 INFO L225 Difference]: With dead ends: 2498 [2019-12-07 16:36:24,416 INFO L226 Difference]: Without dead ends: 2462 [2019-12-07 16:36:24,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:36:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2019-12-07 16:36:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2055. [2019-12-07 16:36:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-12-07 16:36:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 4955 transitions. [2019-12-07 16:36:24,435 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 4955 transitions. Word has length 27 [2019-12-07 16:36:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:24,435 INFO L462 AbstractCegarLoop]: Abstraction has 2055 states and 4955 transitions. [2019-12-07 16:36:24,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:36:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 4955 transitions. [2019-12-07 16:36:24,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 16:36:24,437 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:24,437 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 16:36:24,437 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1601520558, now seen corresponding path program 1 times [2019-12-07 16:36:24,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:24,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514879645] [2019-12-07 16:36:24,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:24,466 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 16:36:24,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514879645] [2019-12-07 16:36:24,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:24,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:36:24,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851498375] [2019-12-07 16:36:24,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:36:24,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:24,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:36:24,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:36:24,467 INFO L87 Difference]: Start difference. First operand 2055 states and 4955 transitions. Second operand 4 states. [2019-12-07 16:36:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:24,481 INFO L93 Difference]: Finished difference Result 966 states and 2264 transitions. [2019-12-07 16:36:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:36:24,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 16:36:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:24,482 INFO L225 Difference]: With dead ends: 966 [2019-12-07 16:36:24,482 INFO L226 Difference]: Without dead ends: 966 [2019-12-07 16:36:24,482 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 16:36:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-12-07 16:36:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 658. [2019-12-07 16:36:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-12-07 16:36:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1494 transitions. [2019-12-07 16:36:24,489 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1494 transitions. Word has length 28 [2019-12-07 16:36:24,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:24,489 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 1494 transitions. [2019-12-07 16:36:24,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:36:24,489 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1494 transitions. [2019-12-07 16:36:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 16:36:24,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:24,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:36:24,490 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:24,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:24,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1254925043, now seen corresponding path program 1 times [2019-12-07 16:36:24,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:24,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862881055] [2019-12-07 16:36:24,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:24,545 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 16:36:24,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862881055] [2019-12-07 16:36:24,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:24,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:36:24,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473770725] [2019-12-07 16:36:24,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:36:24,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:24,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:36:24,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:36:24,546 INFO L87 Difference]: Start difference. First operand 658 states and 1494 transitions. Second operand 4 states. [2019-12-07 16:36:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:24,561 INFO L93 Difference]: Finished difference Result 1032 states and 2385 transitions. [2019-12-07 16:36:24,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:36:24,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 16:36:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:24,562 INFO L225 Difference]: With dead ends: 1032 [2019-12-07 16:36:24,562 INFO L226 Difference]: Without dead ends: 393 [2019-12-07 16:36:24,562 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 16:36:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-12-07 16:36:24,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2019-12-07 16:36:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-12-07 16:36:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 922 transitions. [2019-12-07 16:36:24,565 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 922 transitions. Word has length 42 [2019-12-07 16:36:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:24,566 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 922 transitions. [2019-12-07 16:36:24,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:36:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 922 transitions. [2019-12-07 16:36:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 16:36:24,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:24,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:36:24,567 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:24,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1753934669, now seen corresponding path program 2 times [2019-12-07 16:36:24,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:24,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009882455] [2019-12-07 16:36:24,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:36:24,626 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 16:36:24,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009882455] [2019-12-07 16:36:24,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:36:24,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:36:24,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581313915] [2019-12-07 16:36:24,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:36:24,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:36:24,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:36:24,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:36:24,628 INFO L87 Difference]: Start difference. First operand 393 states and 922 transitions. Second operand 6 states. [2019-12-07 16:36:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:36:24,721 INFO L93 Difference]: Finished difference Result 750 states and 1713 transitions. [2019-12-07 16:36:24,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:36:24,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 16:36:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:36:24,722 INFO L225 Difference]: With dead ends: 750 [2019-12-07 16:36:24,722 INFO L226 Difference]: Without dead ends: 496 [2019-12-07 16:36:24,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:36:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-12-07 16:36:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 422. [2019-12-07 16:36:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-07 16:36:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 969 transitions. [2019-12-07 16:36:24,726 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 969 transitions. Word has length 42 [2019-12-07 16:36:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:36:24,726 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 969 transitions. [2019-12-07 16:36:24,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:36:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 969 transitions. [2019-12-07 16:36:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 16:36:24,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:36:24,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:36:24,727 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:36:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:36:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 3 times [2019-12-07 16:36:24,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:36:24,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116253576] [2019-12-07 16:36:24,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:36:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:36:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:36:24,807 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:36:24,807 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:36:24,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1641~0.base_35| 4)) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1641~0.base_35|)) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1641~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1641~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1641~0.base_35|) |v_ULTIMATE.start_main_~#t1641~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1641~0.base_35| 1) |v_#valid_59|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_ULTIMATE.start_main_~#t1641~0.offset_24| 0) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ULTIMATE.start_main_~#t1641~0.offset=|v_ULTIMATE.start_main_~#t1641~0.offset_24|, ULTIMATE.start_main_~#t1642~0.base=|v_ULTIMATE.start_main_~#t1642~0.base_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_~#t1641~0.base=|v_ULTIMATE.start_main_~#t1641~0.base_35|, ULTIMATE.start_main_~#t1642~0.offset=|v_ULTIMATE.start_main_~#t1642~0.offset_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1641~0.offset, ULTIMATE.start_main_~#t1642~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1641~0.base, ULTIMATE.start_main_~#t1642~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 16:36:24,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1642~0.base_10| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t1642~0.base_10| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1642~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1642~0.base_10|) |v_ULTIMATE.start_main_~#t1642~0.offset_9| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1642~0.base_10| 1)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1642~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1642~0.base_10|) (= |v_ULTIMATE.start_main_~#t1642~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1642~0.offset=|v_ULTIMATE.start_main_~#t1642~0.offset_9|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1642~0.base=|v_ULTIMATE.start_main_~#t1642~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1642~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1642~0.base] because there is no mapped edge [2019-12-07 16:36:24,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In76307220 0)) (= ~x$r_buff0_thd1~0_In76307220 ~x$r_buff1_thd1~0_Out76307220) (= ~y~0_Out76307220 1) (= ~x$r_buff0_thd2~0_Out76307220 1) (= ~x$r_buff0_thd0~0_In76307220 ~x$r_buff1_thd0~0_Out76307220) (= ~y~0_Out76307220 ~__unbuffered_p1_EBX~0_Out76307220) (= ~x$r_buff1_thd2~0_Out76307220 ~x$r_buff0_thd2~0_In76307220) (= ~y~0_Out76307220 ~__unbuffered_p1_EAX~0_Out76307220)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In76307220, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In76307220, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In76307220, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In76307220} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In76307220, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In76307220, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out76307220, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In76307220, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out76307220, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out76307220, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out76307220, ~y~0=~y~0_Out76307220, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out76307220, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out76307220} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 16:36:24,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 16:36:24,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1806449244 256)))) (or (let ((.cse1 (not (= 0 (mod ~x$r_buff0_thd1~0_In1806449244 256))))) (and (= |P0Thread1of1ForFork1_#t~ite23_Out1806449244| |P0Thread1of1ForFork1_#t~ite24_Out1806449244|) .cse0 (= |P0Thread1of1ForFork1_#t~ite23_Out1806449244| |P0Thread1of1ForFork1_#t~ite22_Out1806449244|) (= 0 |P0Thread1of1ForFork1_#t~ite22_Out1806449244|) (or (not (= (mod ~x$w_buff1_used~0_In1806449244 256) 0)) .cse1) (not (= (mod ~x$w_buff0_used~0_In1806449244 256) 0)) (or .cse1 (not (= (mod ~x$r_buff1_thd1~0_In1806449244 256) 0))))) (and (= |P0Thread1of1ForFork1_#t~ite23_In1806449244| |P0Thread1of1ForFork1_#t~ite23_Out1806449244|) (= |P0Thread1of1ForFork1_#t~ite24_Out1806449244| ~x$r_buff1_thd1~0_In1806449244) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite22_In1806449244| |P0Thread1of1ForFork1_#t~ite22_Out1806449244|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1806449244, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1806449244, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1806449244, ~weak$$choice2~0=~weak$$choice2~0_In1806449244, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In1806449244|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1806449244, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In1806449244|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1806449244, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1806449244, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1806449244, ~weak$$choice2~0=~weak$$choice2~0_In1806449244, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out1806449244|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out1806449244|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out1806449244|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1806449244} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 16:36:24,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 16:36:24,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1508613192 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1508613192 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1508613192| ~x$w_buff0_used~0_In-1508613192) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1508613192| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1508613192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1508613192} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1508613192, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1508613192|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1508613192} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 16:36:24,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-815334021 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-815334021 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-815334021 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-815334021 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-815334021|)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-815334021| ~x$w_buff1_used~0_In-815334021) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-815334021, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-815334021, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-815334021, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-815334021} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-815334021, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-815334021, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-815334021, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-815334021|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-815334021} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 16:36:24,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-288958291 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out-288958291 ~x$r_buff0_thd2~0_In-288958291)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-288958291 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-288958291 0) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-288958291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-288958291} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-288958291|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-288958291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-288958291} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 16:36:24,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1135717170 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1135717170 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1135717170 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1135717170 256) 0))) (or (and (= ~x$r_buff1_thd2~0_In-1135717170 |P1Thread1of1ForFork0_#t~ite31_Out-1135717170|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1135717170|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1135717170, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1135717170, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1135717170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135717170} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1135717170|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1135717170, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1135717170, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1135717170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135717170} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 16:36:24,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 16:36:24,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:36:24,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In263869957 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In263869957 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out263869957| ~x$w_buff1~0_In263869957)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out263869957| ~x~0_In263869957)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In263869957, ~x$w_buff1_used~0=~x$w_buff1_used~0_In263869957, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In263869957, ~x~0=~x~0_In263869957} OutVars{~x$w_buff1~0=~x$w_buff1~0_In263869957, ~x$w_buff1_used~0=~x$w_buff1_used~0_In263869957, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In263869957, ~x~0=~x~0_In263869957, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out263869957|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 16:36:24,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 16:36:24,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-689736631 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-689736631 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-689736631| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-689736631| ~x$w_buff0_used~0_In-689736631) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-689736631, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-689736631} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-689736631, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-689736631|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-689736631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 16:36:24,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In2058222326 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In2058222326 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2058222326 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In2058222326 256)))) (or (and (= ~x$w_buff1_used~0_In2058222326 |ULTIMATE.start_main_#t~ite37_Out2058222326|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite37_Out2058222326| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2058222326, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2058222326, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2058222326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2058222326} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2058222326, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2058222326, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2058222326|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2058222326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2058222326} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 16:36:24,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In390851156 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In390851156 256)))) (or (and (= ~x$r_buff0_thd0~0_In390851156 |ULTIMATE.start_main_#t~ite38_Out390851156|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out390851156|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In390851156, ~x$w_buff0_used~0=~x$w_buff0_used~0_In390851156} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In390851156, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out390851156|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In390851156} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:36:24,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In782840964 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In782840964 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In782840964 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In782840964 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In782840964 |ULTIMATE.start_main_#t~ite39_Out782840964|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite39_Out782840964|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In782840964, ~x$w_buff1_used~0=~x$w_buff1_used~0_In782840964, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In782840964, ~x$w_buff0_used~0=~x$w_buff0_used~0_In782840964} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In782840964, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out782840964|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In782840964, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In782840964, ~x$w_buff0_used~0=~x$w_buff0_used~0_In782840964} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:36:24,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:36:24,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:36:24 BasicIcfg [2019-12-07 16:36:24,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:36:24,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:36:24,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:36:24,868 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:36:24,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:36:17" (3/4) ... [2019-12-07 16:36:24,870 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:36:24,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1641~0.base_35| 4)) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1641~0.base_35|)) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1641~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1641~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1641~0.base_35|) |v_ULTIMATE.start_main_~#t1641~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1641~0.base_35| 1) |v_#valid_59|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_ULTIMATE.start_main_~#t1641~0.offset_24| 0) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ULTIMATE.start_main_~#t1641~0.offset=|v_ULTIMATE.start_main_~#t1641~0.offset_24|, ULTIMATE.start_main_~#t1642~0.base=|v_ULTIMATE.start_main_~#t1642~0.base_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_~#t1641~0.base=|v_ULTIMATE.start_main_~#t1641~0.base_35|, ULTIMATE.start_main_~#t1642~0.offset=|v_ULTIMATE.start_main_~#t1642~0.offset_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1641~0.offset, ULTIMATE.start_main_~#t1642~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1641~0.base, ULTIMATE.start_main_~#t1642~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 16:36:24,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1642~0.base_10| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t1642~0.base_10| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1642~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1642~0.base_10|) |v_ULTIMATE.start_main_~#t1642~0.offset_9| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1642~0.base_10| 1)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1642~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1642~0.base_10|) (= |v_ULTIMATE.start_main_~#t1642~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1642~0.offset=|v_ULTIMATE.start_main_~#t1642~0.offset_9|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1642~0.base=|v_ULTIMATE.start_main_~#t1642~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1642~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1642~0.base] because there is no mapped edge [2019-12-07 16:36:24,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In76307220 0)) (= ~x$r_buff0_thd1~0_In76307220 ~x$r_buff1_thd1~0_Out76307220) (= ~y~0_Out76307220 1) (= ~x$r_buff0_thd2~0_Out76307220 1) (= ~x$r_buff0_thd0~0_In76307220 ~x$r_buff1_thd0~0_Out76307220) (= ~y~0_Out76307220 ~__unbuffered_p1_EBX~0_Out76307220) (= ~x$r_buff1_thd2~0_Out76307220 ~x$r_buff0_thd2~0_In76307220) (= ~y~0_Out76307220 ~__unbuffered_p1_EAX~0_Out76307220)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In76307220, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In76307220, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In76307220, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In76307220} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In76307220, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In76307220, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out76307220, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In76307220, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out76307220, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out76307220, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out76307220, ~y~0=~y~0_Out76307220, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out76307220, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out76307220} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 16:36:24,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 16:36:24,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1806449244 256)))) (or (let ((.cse1 (not (= 0 (mod ~x$r_buff0_thd1~0_In1806449244 256))))) (and (= |P0Thread1of1ForFork1_#t~ite23_Out1806449244| |P0Thread1of1ForFork1_#t~ite24_Out1806449244|) .cse0 (= |P0Thread1of1ForFork1_#t~ite23_Out1806449244| |P0Thread1of1ForFork1_#t~ite22_Out1806449244|) (= 0 |P0Thread1of1ForFork1_#t~ite22_Out1806449244|) (or (not (= (mod ~x$w_buff1_used~0_In1806449244 256) 0)) .cse1) (not (= (mod ~x$w_buff0_used~0_In1806449244 256) 0)) (or .cse1 (not (= (mod ~x$r_buff1_thd1~0_In1806449244 256) 0))))) (and (= |P0Thread1of1ForFork1_#t~ite23_In1806449244| |P0Thread1of1ForFork1_#t~ite23_Out1806449244|) (= |P0Thread1of1ForFork1_#t~ite24_Out1806449244| ~x$r_buff1_thd1~0_In1806449244) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite22_In1806449244| |P0Thread1of1ForFork1_#t~ite22_Out1806449244|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1806449244, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1806449244, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1806449244, ~weak$$choice2~0=~weak$$choice2~0_In1806449244, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In1806449244|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1806449244, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In1806449244|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1806449244, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1806449244, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1806449244, ~weak$$choice2~0=~weak$$choice2~0_In1806449244, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out1806449244|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out1806449244|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out1806449244|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1806449244} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 16:36:24,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 16:36:24,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1508613192 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1508613192 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1508613192| ~x$w_buff0_used~0_In-1508613192) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1508613192| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1508613192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1508613192} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1508613192, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1508613192|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1508613192} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 16:36:24,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-815334021 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-815334021 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-815334021 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-815334021 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-815334021|)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-815334021| ~x$w_buff1_used~0_In-815334021) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-815334021, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-815334021, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-815334021, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-815334021} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-815334021, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-815334021, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-815334021, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-815334021|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-815334021} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 16:36:24,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-288958291 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out-288958291 ~x$r_buff0_thd2~0_In-288958291)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-288958291 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-288958291 0) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-288958291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-288958291} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-288958291|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-288958291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-288958291} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 16:36:24,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1135717170 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1135717170 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1135717170 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1135717170 256) 0))) (or (and (= ~x$r_buff1_thd2~0_In-1135717170 |P1Thread1of1ForFork0_#t~ite31_Out-1135717170|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1135717170|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1135717170, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1135717170, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1135717170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135717170} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1135717170|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1135717170, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1135717170, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1135717170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135717170} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 16:36:24,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 16:36:24,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:36:24,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In263869957 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In263869957 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out263869957| ~x$w_buff1~0_In263869957)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out263869957| ~x~0_In263869957)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In263869957, ~x$w_buff1_used~0=~x$w_buff1_used~0_In263869957, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In263869957, ~x~0=~x~0_In263869957} OutVars{~x$w_buff1~0=~x$w_buff1~0_In263869957, ~x$w_buff1_used~0=~x$w_buff1_used~0_In263869957, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In263869957, ~x~0=~x~0_In263869957, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out263869957|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 16:36:24,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 16:36:24,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-689736631 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-689736631 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-689736631| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-689736631| ~x$w_buff0_used~0_In-689736631) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-689736631, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-689736631} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-689736631, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-689736631|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-689736631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 16:36:24,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In2058222326 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In2058222326 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2058222326 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In2058222326 256)))) (or (and (= ~x$w_buff1_used~0_In2058222326 |ULTIMATE.start_main_#t~ite37_Out2058222326|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite37_Out2058222326| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2058222326, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2058222326, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2058222326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2058222326} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2058222326, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2058222326, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2058222326|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2058222326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2058222326} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 16:36:24,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In390851156 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In390851156 256)))) (or (and (= ~x$r_buff0_thd0~0_In390851156 |ULTIMATE.start_main_#t~ite38_Out390851156|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out390851156|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In390851156, ~x$w_buff0_used~0=~x$w_buff0_used~0_In390851156} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In390851156, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out390851156|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In390851156} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:36:24,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In782840964 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In782840964 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In782840964 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In782840964 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In782840964 |ULTIMATE.start_main_#t~ite39_Out782840964|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite39_Out782840964|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In782840964, ~x$w_buff1_used~0=~x$w_buff1_used~0_In782840964, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In782840964, ~x$w_buff0_used~0=~x$w_buff0_used~0_In782840964} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In782840964, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out782840964|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In782840964, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In782840964, ~x$w_buff0_used~0=~x$w_buff0_used~0_In782840964} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:36:24,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:36:24,942 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_12d2bb4b-ad7f-46d4-a5a6-2e1df96954b0/bin/uautomizer/witness.graphml [2019-12-07 16:36:24,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:36:24,944 INFO L168 Benchmark]: Toolchain (without parser) took 8381.47 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.7 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -251.6 MB). Peak memory consumption was 174.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:36:24,944 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:36:24,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:36:24,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:36:24,945 INFO L168 Benchmark]: Boogie Preprocessor took 24.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:36:24,946 INFO L168 Benchmark]: RCFGBuilder took 357.20 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:36:24,946 INFO L168 Benchmark]: TraceAbstraction took 7517.85 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 319.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -187.5 MB). Peak memory consumption was 132.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:36:24,946 INFO L168 Benchmark]: Witness Printer took 74.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:36:24,948 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 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 357.20 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7517.85 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 319.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -187.5 MB). Peak memory consumption was 132.4 MB. Max. memory is 11.5 GB. * Witness Printer took 74.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1641, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1642, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1454 SDtfs, 1144 SDslu, 1994 SDs, 0 SdLazy, 954 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15319occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 8084 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 35805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...