./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe029_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe029_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 b6f84a75f7e7e2b60206e8ca033ac378ee639ae0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-11-28 18:32:25,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:32:25,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:32:25,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:32:25,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:32:25,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:32:25,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:32:25,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:32:25,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:32:25,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:32:25,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:32:25,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:32:25,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:32:25,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:32:25,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:32:25,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:32:25,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:32:25,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:32:25,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:32:25,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:32:25,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:32:25,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:32:25,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:32:25,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:32:26,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:32:26,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:32:26,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:32:26,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:32:26,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:32:26,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:32:26,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:32:26,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:32:26,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:32:26,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:32:26,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:32:26,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:32:26,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:32:26,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:32:26,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:32:26,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:32:26,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:32:26,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:32:26,047 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:32:26,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:32:26,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:32:26,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:32:26,058 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:32:26,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:32:26,059 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:32:26,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:32:26,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:32:26,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:32:26,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:32:26,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:32:26,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:32:26,062 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:32:26,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:32:26,062 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:32:26,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:32:26,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:32:26,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:32:26,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:32:26,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:32:26,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:32:26,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:32:26,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:32:26,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:32:26,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:32:26,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:32:26,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:32:26,067 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:32:26,067 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> b6f84a75f7e7e2b60206e8ca033ac378ee639ae0 [2019-11-28 18:32:26,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:32:26,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:32:26,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:32:26,414 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:32:26,415 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:32:26,416 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.oepc.i [2019-11-28 18:32:26,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440acbfcb/6205f6c041ab4574b1d7a31d2134599b/FLAG1879abb08 [2019-11-28 18:32:27,071 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:32:27,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.oepc.i [2019-11-28 18:32:27,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440acbfcb/6205f6c041ab4574b1d7a31d2134599b/FLAG1879abb08 [2019-11-28 18:32:27,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440acbfcb/6205f6c041ab4574b1d7a31d2134599b [2019-11-28 18:32:27,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:32:27,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:32:27,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:32:27,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:32:27,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:32:27,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:32:27" (1/1) ... [2019-11-28 18:32:27,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778b5d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:27, skipping insertion in model container [2019-11-28 18:32:27,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:32:27" (1/1) ... [2019-11-28 18:32:27,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:32:27,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:32:28,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:32:28,056 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:32:28,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:32:28,224 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:32:28,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:28 WrapperNode [2019-11-28 18:32:28,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:32:28,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:32:28,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:32:28,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:32:28,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:28" (1/1) ... [2019-11-28 18:32:28,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:28" (1/1) ... [2019-11-28 18:32:28,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:32:28,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:32:28,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:32:28,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:32:28,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:28" (1/1) ... [2019-11-28 18:32:28,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:28" (1/1) ... [2019-11-28 18:32:28,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:28" (1/1) ... [2019-11-28 18:32:28,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:28" (1/1) ... [2019-11-28 18:32:28,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:28" (1/1) ... [2019-11-28 18:32:28,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:28" (1/1) ... [2019-11-28 18:32:28,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:28" (1/1) ... [2019-11-28 18:32:28,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:32:28,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:32:28,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:32:28,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:32:28,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:32:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:32:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:32:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:32:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:32:28,415 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:32:28,415 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:32:28,415 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:32:28,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:32:28,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:32:28,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:32:28,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:32:28,419 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:32:29,065 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:32:29,066 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:32:29,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:32:29 BoogieIcfgContainer [2019-11-28 18:32:29,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:32:29,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:32:29,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:32:29,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:32:29,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:32:27" (1/3) ... [2019-11-28 18:32:29,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0d5d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:32:29, skipping insertion in model container [2019-11-28 18:32:29,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:28" (2/3) ... [2019-11-28 18:32:29,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0d5d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:32:29, skipping insertion in model container [2019-11-28 18:32:29,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:32:29" (3/3) ... [2019-11-28 18:32:29,077 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2019-11-28 18:32:29,088 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:32:29,088 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:32:29,096 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:32:29,098 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:32:29,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,134 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,134 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:29,173 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:32:29,196 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:32:29,196 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:32:29,197 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:32:29,197 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:32:29,197 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:32:29,197 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:32:29,198 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:32:29,198 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:32:29,216 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-11-28 18:32:29,219 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-11-28 18:32:29,303 INFO L134 PetriNetUnfolder]: 41/177 cut-off events. [2019-11-28 18:32:29,303 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:32:29,318 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 466 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:32:29,337 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-11-28 18:32:29,381 INFO L134 PetriNetUnfolder]: 41/177 cut-off events. [2019-11-28 18:32:29,382 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:32:29,388 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 466 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:32:29,403 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-11-28 18:32:29,404 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:32:33,894 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-11-28 18:32:34,007 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-28 18:32:34,048 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46212 [2019-11-28 18:32:34,048 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-11-28 18:32:34,052 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-11-28 18:32:34,746 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8458 states. [2019-11-28 18:32:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states. [2019-11-28 18:32:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:32:34,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:34,758 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:32:34,759 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:34,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:34,769 INFO L82 PathProgramCache]: Analyzing trace with hash 717058, now seen corresponding path program 1 times [2019-11-28 18:32:34,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:34,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112108349] [2019-11-28 18:32:34,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:35,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112108349] [2019-11-28 18:32:35,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:35,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:32:35,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411498937] [2019-11-28 18:32:35,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:32:35,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:35,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:32:35,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:32:35,162 INFO L87 Difference]: Start difference. First operand 8458 states. Second operand 3 states. [2019-11-28 18:32:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:35,486 INFO L93 Difference]: Finished difference Result 8394 states and 27476 transitions. [2019-11-28 18:32:35,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:32:35,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:32:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:35,606 INFO L225 Difference]: With dead ends: 8394 [2019-11-28 18:32:35,606 INFO L226 Difference]: Without dead ends: 8226 [2019-11-28 18:32:35,608 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-11-28 18:32:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-11-28 18:32:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8226. [2019-11-28 18:32:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-11-28 18:32:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 26958 transitions. [2019-11-28 18:32:36,053 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 26958 transitions. Word has length 3 [2019-11-28 18:32:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:36,053 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 26958 transitions. [2019-11-28 18:32:36,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:32:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 26958 transitions. [2019-11-28 18:32:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:32:36,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:36,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:32:36,057 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:36,058 INFO L82 PathProgramCache]: Analyzing trace with hash 651590314, now seen corresponding path program 1 times [2019-11-28 18:32:36,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:36,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368696889] [2019-11-28 18:32:36,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:36,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368696889] [2019-11-28 18:32:36,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:36,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:32:36,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206309701] [2019-11-28 18:32:36,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:32:36,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:36,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:32:36,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:32:36,211 INFO L87 Difference]: Start difference. First operand 8226 states and 26958 transitions. Second operand 4 states. [2019-11-28 18:32:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:36,649 INFO L93 Difference]: Finished difference Result 12778 states and 40134 transitions. [2019-11-28 18:32:36,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:32:36,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:32:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:36,740 INFO L225 Difference]: With dead ends: 12778 [2019-11-28 18:32:36,740 INFO L226 Difference]: Without dead ends: 12771 [2019-11-28 18:32:36,741 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-11-28 18:32:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2019-11-28 18:32:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 11467. [2019-11-28 18:32:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11467 states. [2019-11-28 18:32:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11467 states to 11467 states and 36507 transitions. [2019-11-28 18:32:37,256 INFO L78 Accepts]: Start accepts. Automaton has 11467 states and 36507 transitions. Word has length 11 [2019-11-28 18:32:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:37,257 INFO L462 AbstractCegarLoop]: Abstraction has 11467 states and 36507 transitions. [2019-11-28 18:32:37,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:32:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 11467 states and 36507 transitions. [2019-11-28 18:32:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:32:37,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:37,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:32:37,260 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:37,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:37,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1968692504, now seen corresponding path program 1 times [2019-11-28 18:32:37,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:37,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779121923] [2019-11-28 18:32:37,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:37,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779121923] [2019-11-28 18:32:37,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:37,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:32:37,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344707208] [2019-11-28 18:32:37,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:32:37,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:37,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:32:37,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:32:37,534 INFO L87 Difference]: Start difference. First operand 11467 states and 36507 transitions. Second operand 4 states. [2019-11-28 18:32:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:37,583 INFO L93 Difference]: Finished difference Result 1910 states and 4431 transitions. [2019-11-28 18:32:37,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:32:37,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:32:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:37,590 INFO L225 Difference]: With dead ends: 1910 [2019-11-28 18:32:37,591 INFO L226 Difference]: Without dead ends: 1633 [2019-11-28 18:32:37,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:32:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2019-11-28 18:32:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2019-11-28 18:32:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1633 states. [2019-11-28 18:32:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 3665 transitions. [2019-11-28 18:32:37,634 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 3665 transitions. Word has length 11 [2019-11-28 18:32:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:37,634 INFO L462 AbstractCegarLoop]: Abstraction has 1633 states and 3665 transitions. [2019-11-28 18:32:37,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:32:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 3665 transitions. [2019-11-28 18:32:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 18:32:37,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:37,642 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] [2019-11-28 18:32:37,642 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:37,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:37,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1924498971, now seen corresponding path program 1 times [2019-11-28 18:32:37,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:37,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642627316] [2019-11-28 18:32:37,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:37,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642627316] [2019-11-28 18:32:37,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:37,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:32:37,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561723039] [2019-11-28 18:32:37,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:32:37,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:37,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:32:37,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:32:37,794 INFO L87 Difference]: Start difference. First operand 1633 states and 3665 transitions. Second operand 5 states. [2019-11-28 18:32:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:37,844 INFO L93 Difference]: Finished difference Result 392 states and 732 transitions. [2019-11-28 18:32:37,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:32:37,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-28 18:32:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:37,849 INFO L225 Difference]: With dead ends: 392 [2019-11-28 18:32:37,849 INFO L226 Difference]: Without dead ends: 347 [2019-11-28 18:32:37,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:32:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-11-28 18:32:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 319. [2019-11-28 18:32:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-28 18:32:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 592 transitions. [2019-11-28 18:32:37,858 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 592 transitions. Word has length 23 [2019-11-28 18:32:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:37,859 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 592 transitions. [2019-11-28 18:32:37,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:32:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 592 transitions. [2019-11-28 18:32:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:32:37,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:37,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:32:37,862 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:37,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:37,862 INFO L82 PathProgramCache]: Analyzing trace with hash -955543376, now seen corresponding path program 1 times [2019-11-28 18:32:37,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:37,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215508713] [2019-11-28 18:32:37,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:37,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215508713] [2019-11-28 18:32:37,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:37,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:32:37,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347423059] [2019-11-28 18:32:37,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:32:37,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:37,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:32:37,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:32:37,957 INFO L87 Difference]: Start difference. First operand 319 states and 592 transitions. Second operand 3 states. [2019-11-28 18:32:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:38,005 INFO L93 Difference]: Finished difference Result 329 states and 602 transitions. [2019-11-28 18:32:38,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:32:38,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:32:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:38,007 INFO L225 Difference]: With dead ends: 329 [2019-11-28 18:32:38,007 INFO L226 Difference]: Without dead ends: 329 [2019-11-28 18:32:38,007 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-11-28 18:32:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-28 18:32:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 325. [2019-11-28 18:32:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-11-28 18:32:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 598 transitions. [2019-11-28 18:32:38,015 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 598 transitions. Word has length 52 [2019-11-28 18:32:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:38,017 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 598 transitions. [2019-11-28 18:32:38,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:32:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 598 transitions. [2019-11-28 18:32:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:32:38,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:38,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:32:38,019 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:38,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:38,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1093435048, now seen corresponding path program 1 times [2019-11-28 18:32:38,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:38,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454111710] [2019-11-28 18:32:38,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:38,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454111710] [2019-11-28 18:32:38,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:38,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:32:38,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3935801] [2019-11-28 18:32:38,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:32:38,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:38,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:32:38,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:32:38,203 INFO L87 Difference]: Start difference. First operand 325 states and 598 transitions. Second operand 3 states. [2019-11-28 18:32:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:38,223 INFO L93 Difference]: Finished difference Result 313 states and 562 transitions. [2019-11-28 18:32:38,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:32:38,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:32:38,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:38,224 INFO L225 Difference]: With dead ends: 313 [2019-11-28 18:32:38,224 INFO L226 Difference]: Without dead ends: 313 [2019-11-28 18:32:38,225 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-11-28 18:32:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-28 18:32:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2019-11-28 18:32:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-28 18:32:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 562 transitions. [2019-11-28 18:32:38,232 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 562 transitions. Word has length 52 [2019-11-28 18:32:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:38,233 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 562 transitions. [2019-11-28 18:32:38,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:32:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 562 transitions. [2019-11-28 18:32:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:32:38,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:38,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:32:38,235 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash 456891136, now seen corresponding path program 1 times [2019-11-28 18:32:38,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:38,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074188706] [2019-11-28 18:32:38,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:38,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074188706] [2019-11-28 18:32:38,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:38,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:32:38,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621558155] [2019-11-28 18:32:38,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:32:38,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:38,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:32:38,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:32:38,350 INFO L87 Difference]: Start difference. First operand 313 states and 562 transitions. Second operand 5 states. [2019-11-28 18:32:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:38,543 INFO L93 Difference]: Finished difference Result 469 states and 844 transitions. [2019-11-28 18:32:38,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:32:38,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-28 18:32:38,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:38,545 INFO L225 Difference]: With dead ends: 469 [2019-11-28 18:32:38,545 INFO L226 Difference]: Without dead ends: 469 [2019-11-28 18:32:38,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:32:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-11-28 18:32:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 361. [2019-11-28 18:32:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-28 18:32:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 655 transitions. [2019-11-28 18:32:38,554 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 655 transitions. Word has length 53 [2019-11-28 18:32:38,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:38,555 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 655 transitions. [2019-11-28 18:32:38,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:32:38,555 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 655 transitions. [2019-11-28 18:32:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:32:38,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:38,557 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 18:32:38,557 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:38,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:38,558 INFO L82 PathProgramCache]: Analyzing trace with hash 923557156, now seen corresponding path program 2 times [2019-11-28 18:32:38,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:38,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292633300] [2019-11-28 18:32:38,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:38,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292633300] [2019-11-28 18:32:38,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:38,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:32:38,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480036917] [2019-11-28 18:32:38,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:32:38,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:38,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:32:38,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:32:38,750 INFO L87 Difference]: Start difference. First operand 361 states and 655 transitions. Second operand 6 states. [2019-11-28 18:32:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:38,838 INFO L93 Difference]: Finished difference Result 648 states and 1166 transitions. [2019-11-28 18:32:38,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:32:38,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-28 18:32:38,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:38,841 INFO L225 Difference]: With dead ends: 648 [2019-11-28 18:32:38,841 INFO L226 Difference]: Without dead ends: 338 [2019-11-28 18:32:38,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:32:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-28 18:32:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 308. [2019-11-28 18:32:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-28 18:32:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 551 transitions. [2019-11-28 18:32:38,849 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 551 transitions. Word has length 53 [2019-11-28 18:32:38,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:38,850 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 551 transitions. [2019-11-28 18:32:38,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:32:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 551 transitions. [2019-11-28 18:32:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:32:38,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:38,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:32:38,851 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:38,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:38,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2062591520, now seen corresponding path program 3 times [2019-11-28 18:32:38,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:38,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300324717] [2019-11-28 18:32:38,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:38,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300324717] [2019-11-28 18:32:38,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:38,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:32:38,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71681154] [2019-11-28 18:32:38,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:32:38,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:38,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:32:38,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:32:38,923 INFO L87 Difference]: Start difference. First operand 308 states and 551 transitions. Second operand 3 states. [2019-11-28 18:32:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:38,963 INFO L93 Difference]: Finished difference Result 307 states and 549 transitions. [2019-11-28 18:32:38,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:32:38,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-28 18:32:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:38,965 INFO L225 Difference]: With dead ends: 307 [2019-11-28 18:32:38,965 INFO L226 Difference]: Without dead ends: 307 [2019-11-28 18:32:38,965 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-11-28 18:32:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-28 18:32:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 219. [2019-11-28 18:32:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-28 18:32:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 389 transitions. [2019-11-28 18:32:38,976 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 389 transitions. Word has length 53 [2019-11-28 18:32:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:38,977 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 389 transitions. [2019-11-28 18:32:38,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:32:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 389 transitions. [2019-11-28 18:32:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 18:32:38,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:38,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:32:38,979 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash 133727006, now seen corresponding path program 1 times [2019-11-28 18:32:38,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:38,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061309559] [2019-11-28 18:32:38,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:39,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061309559] [2019-11-28 18:32:39,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:39,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 18:32:39,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244815790] [2019-11-28 18:32:39,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 18:32:39,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:39,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 18:32:39,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-28 18:32:39,362 INFO L87 Difference]: Start difference. First operand 219 states and 389 transitions. Second operand 15 states. [2019-11-28 18:32:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:40,023 INFO L93 Difference]: Finished difference Result 384 states and 661 transitions. [2019-11-28 18:32:40,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 18:32:40,027 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-11-28 18:32:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:40,028 INFO L225 Difference]: With dead ends: 384 [2019-11-28 18:32:40,028 INFO L226 Difference]: Without dead ends: 353 [2019-11-28 18:32:40,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2019-11-28 18:32:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-11-28 18:32:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 319. [2019-11-28 18:32:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-28 18:32:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 560 transitions. [2019-11-28 18:32:40,035 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 560 transitions. Word has length 54 [2019-11-28 18:32:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:40,036 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 560 transitions. [2019-11-28 18:32:40,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 18:32:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 560 transitions. [2019-11-28 18:32:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 18:32:40,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:40,037 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:32:40,037 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash 815200260, now seen corresponding path program 2 times [2019-11-28 18:32:40,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:40,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724305509] [2019-11-28 18:32:40,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:40,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724305509] [2019-11-28 18:32:40,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:40,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:32:40,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061695166] [2019-11-28 18:32:40,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 18:32:40,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:40,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 18:32:40,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:32:40,387 INFO L87 Difference]: Start difference. First operand 319 states and 560 transitions. Second operand 14 states. [2019-11-28 18:32:40,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:40,897 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-11-28 18:32:40,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 18:32:40,898 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-11-28 18:32:40,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:40,899 INFO L225 Difference]: With dead ends: 420 [2019-11-28 18:32:40,900 INFO L226 Difference]: Without dead ends: 389 [2019-11-28 18:32:40,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2019-11-28 18:32:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-11-28 18:32:40,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 327. [2019-11-28 18:32:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-11-28 18:32:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 574 transitions. [2019-11-28 18:32:40,908 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 574 transitions. Word has length 54 [2019-11-28 18:32:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:40,908 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 574 transitions. [2019-11-28 18:32:40,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 18:32:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 574 transitions. [2019-11-28 18:32:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 18:32:40,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:40,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:32:40,910 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:40,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2067211286, now seen corresponding path program 3 times [2019-11-28 18:32:40,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:40,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117111108] [2019-11-28 18:32:40,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:32:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:32:41,098 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:32:41,098 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:32:41,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2473~0.base_19|) (= 0 v_~__unbuffered_cnt~0_61) (= v_~weak$$choice2~0_132 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_444 0) (= v_~y$r_buff1_thd0~0_304 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19|) 0) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff0_thd0~0_394 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19| 1)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19|) |v_ULTIMATE.start_main_~#t2473~0.offset_16| 0))) (= 0 v_~y$w_buff0~0_376) (= 0 |v_#NULL.base_6|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| 4)) (= v_~y$r_buff1_thd1~0_220 0) (= v_~y~0_141 0) (= v_~y$r_buff0_thd1~0_301 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~y$flush_delayed~0_48) (= 0 v_~y$r_buff0_thd2~0_175) (= v_~y$w_buff1~0_254 0) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff0_used~0_753 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_205) (= 0 |v_ULTIMATE.start_main_~#t2473~0.offset_16|) (= 0 v_~x~0_168) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ULTIMATE.start_main_~#t2473~0.base=|v_ULTIMATE.start_main_~#t2473~0.base_19|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_32|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_56|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_301, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_45|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t2473~0.offset=|v_ULTIMATE.start_main_~#t2473~0.offset_16|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ~x~0=v_~x~0_168, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_753, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_28|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_39|, ~y$w_buff0~0=v_~y$w_buff0~0_376, ~y~0=v_~y~0_141, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_30|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_44|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_26|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_37|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_28|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_394, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_13|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2473~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2474~0.offset, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2473~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:32:41,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L777-1-->L779: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11|) |v_ULTIMATE.start_main_~#t2474~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t2474~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2474~0.base_11|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2474~0.offset] because there is no mapped edge [2019-11-28 18:32:41,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= 2 v_~y$w_buff0~0_172) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_79 0)) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_290 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_162 256))))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_77|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_79 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_77|) (= v_~y$w_buff0_used~0_290 1) (= v_P0Thread1of1ForFork0_~arg.offset_77 |v_P0Thread1of1ForFork0_#in~arg.offset_79|) (= v_P0Thread1of1ForFork0_~arg.base_77 |v_P0Thread1of1ForFork0_#in~arg.base_79|) (= v_~y$w_buff0_used~0_291 v_~y$w_buff1_used~0_162) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_173)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff0~0=v_~y$w_buff0~0_173, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_290, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_79, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_77, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_77|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_162} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:32:41,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In374756854 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In374756854 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out374756854| ~y$w_buff0_used~0_In374756854) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out374756854| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In374756854, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In374756854} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out374756854|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In374756854, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In374756854} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:32:41,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-25471497 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-25471497 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-25471497| ~y$w_buff1~0_In-25471497) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-25471497| ~y~0_In-25471497) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-25471497, ~y$w_buff1~0=~y$w_buff1~0_In-25471497, ~y~0=~y~0_In-25471497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-25471497} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-25471497, ~y$w_buff1~0=~y$w_buff1~0_In-25471497, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-25471497|, ~y~0=~y~0_In-25471497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-25471497} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-11-28 18:32:41,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= v_~y~0_50 |v_P1Thread1of1ForFork1_#t~ite9_12|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_12|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_11|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_13|, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-11-28 18:32:41,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2023369114 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2023369114 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out2023369114| ~y$w_buff0_used~0_In2023369114) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out2023369114| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2023369114, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2023369114} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2023369114, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2023369114, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2023369114|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-11-28 18:32:41,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-347209698 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-347209698 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-347209698 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-347209698 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-347209698|)) (and (= ~y$w_buff1_used~0_In-347209698 |P0Thread1of1ForFork0_#t~ite6_Out-347209698|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-347209698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-347209698, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-347209698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-347209698} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-347209698|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-347209698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-347209698, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-347209698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-347209698} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:32:41,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2130534469 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-2130534469 256) 0)) (.cse1 (= ~y$r_buff0_thd1~0_In-2130534469 ~y$r_buff0_thd1~0_Out-2130534469))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out-2130534469) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2130534469, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2130534469} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2130534469, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2130534469|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2130534469} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:32:41,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-714233375 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-714233375 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-714233375 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-714233375 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-714233375| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-714233375 |P1Thread1of1ForFork1_#t~ite12_Out-714233375|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-714233375, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-714233375, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-714233375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-714233375} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-714233375, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-714233375, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-714233375, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-714233375|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-714233375} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:32:41,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1004460044 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1004460044 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1004460044|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1004460044| ~y$r_buff0_thd2~0_In-1004460044) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1004460044, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1004460044} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1004460044, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1004460044, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1004460044|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-11-28 18:32:41,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1987902948 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1987902948 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1987902948 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1987902948 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1987902948| ~y$r_buff1_thd2~0_In1987902948) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1987902948|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1987902948, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1987902948, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1987902948, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1987902948} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1987902948, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1987902948, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1987902948, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1987902948|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1987902948} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:32:41,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= |v_P1Thread1of1ForFork1_#t~ite14_32| v_~y$r_buff1_thd2~0_85)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_85, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:32:41,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In879251795 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In879251795 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In879251795 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In879251795 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out879251795|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In879251795 |P0Thread1of1ForFork0_#t~ite8_Out879251795|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In879251795, ~y$w_buff0_used~0=~y$w_buff0_used~0_In879251795, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In879251795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In879251795} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In879251795, ~y$w_buff0_used~0=~y$w_buff0_used~0_In879251795, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out879251795|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In879251795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In879251795} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:32:41,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L738-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:32:41,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_159 256) 0) (= (mod v_~y$r_buff0_thd0~0_61 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:32:41,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-532270082 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-532270082 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out-532270082| ~y$w_buff1~0_In-532270082) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-532270082 |ULTIMATE.start_main_#t~ite17_Out-532270082|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-532270082, ~y~0=~y~0_In-532270082, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-532270082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-532270082} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-532270082|, ~y$w_buff1~0=~y$w_buff1~0_In-532270082, ~y~0=~y~0_In-532270082, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-532270082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-532270082} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-11-28 18:32:41,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-11-28 18:32:41,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-136284691 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-136284691 256) 0))) (or (and (= ~y$w_buff0_used~0_In-136284691 |ULTIMATE.start_main_#t~ite19_Out-136284691|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite19_Out-136284691|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-136284691, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-136284691} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-136284691, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-136284691|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-136284691} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-11-28 18:32:41,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1345988767 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1345988767 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1345988767 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1345988767 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out-1345988767| ~y$w_buff1_used~0_In-1345988767)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite20_Out-1345988767| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1345988767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1345988767, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1345988767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1345988767} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1345988767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1345988767, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1345988767|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1345988767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1345988767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-11-28 18:32:41,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1696016814 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1696016814 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-1696016814 |ULTIMATE.start_main_#t~ite21_Out-1696016814|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1696016814|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1696016814, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1696016814} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1696016814, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1696016814, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1696016814|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-11-28 18:32:41,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In2109244064 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In2109244064 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2109244064 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2109244064 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out2109244064| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite22_Out2109244064| ~y$r_buff1_thd0~0_In2109244064) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2109244064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2109244064, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2109244064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2109244064} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2109244064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2109244064, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2109244064, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out2109244064|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2109244064} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-11-28 18:32:41,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L799-->L799-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In285482631 256)))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out285482631| ~y$w_buff0_used~0_In285482631) (= |ULTIMATE.start_main_#t~ite35_Out285482631| |ULTIMATE.start_main_#t~ite34_Out285482631|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In285482631 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In285482631 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In285482631 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In285482631 256))))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out285482631| ~y$w_buff0_used~0_In285482631) (= |ULTIMATE.start_main_#t~ite34_In285482631| |ULTIMATE.start_main_#t~ite34_Out285482631|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In285482631, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In285482631, ~weak$$choice2~0=~weak$$choice2~0_In285482631, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In285482631, ~y$w_buff1_used~0=~y$w_buff1_used~0_In285482631, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In285482631|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In285482631, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In285482631, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out285482631|, ~weak$$choice2~0=~weak$$choice2~0_In285482631, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In285482631, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out285482631|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In285482631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:32:41,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (= v_~y$r_buff0_thd0~0_72 v_~y$r_buff0_thd0~0_71) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-11-28 18:32:41,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L804-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_21) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (not (= 0 (mod v_~y$flush_delayed~0_36 256))) (= 0 v_~y$flush_delayed~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_99, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:32:41,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:32:41,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:32:41 BasicIcfg [2019-11-28 18:32:41,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:32:41,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:32:41,198 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:32:41,199 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:32:41,199 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:32:29" (3/4) ... [2019-11-28 18:32:41,202 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:32:41,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2473~0.base_19|) (= 0 v_~__unbuffered_cnt~0_61) (= v_~weak$$choice2~0_132 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_444 0) (= v_~y$r_buff1_thd0~0_304 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19|) 0) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff0_thd0~0_394 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19| 1)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19|) |v_ULTIMATE.start_main_~#t2473~0.offset_16| 0))) (= 0 v_~y$w_buff0~0_376) (= 0 |v_#NULL.base_6|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| 4)) (= v_~y$r_buff1_thd1~0_220 0) (= v_~y~0_141 0) (= v_~y$r_buff0_thd1~0_301 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~y$flush_delayed~0_48) (= 0 v_~y$r_buff0_thd2~0_175) (= v_~y$w_buff1~0_254 0) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff0_used~0_753 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_205) (= 0 |v_ULTIMATE.start_main_~#t2473~0.offset_16|) (= 0 v_~x~0_168) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ULTIMATE.start_main_~#t2473~0.base=|v_ULTIMATE.start_main_~#t2473~0.base_19|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_32|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_56|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_301, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_45|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t2473~0.offset=|v_ULTIMATE.start_main_~#t2473~0.offset_16|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ~x~0=v_~x~0_168, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_753, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_28|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_39|, ~y$w_buff0~0=v_~y$w_buff0~0_376, ~y~0=v_~y~0_141, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_30|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_44|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_26|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_37|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_28|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_394, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_13|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2473~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2474~0.offset, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2473~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:32:41,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L777-1-->L779: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11|) |v_ULTIMATE.start_main_~#t2474~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t2474~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2474~0.base_11|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2474~0.offset] because there is no mapped edge [2019-11-28 18:32:41,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= 2 v_~y$w_buff0~0_172) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_79 0)) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_290 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_162 256))))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_77|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_79 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_77|) (= v_~y$w_buff0_used~0_290 1) (= v_P0Thread1of1ForFork0_~arg.offset_77 |v_P0Thread1of1ForFork0_#in~arg.offset_79|) (= v_P0Thread1of1ForFork0_~arg.base_77 |v_P0Thread1of1ForFork0_#in~arg.base_79|) (= v_~y$w_buff0_used~0_291 v_~y$w_buff1_used~0_162) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_173)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff0~0=v_~y$w_buff0~0_173, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_290, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_79, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_77, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_77|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_162} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:32:41,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In374756854 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In374756854 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out374756854| ~y$w_buff0_used~0_In374756854) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out374756854| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In374756854, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In374756854} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out374756854|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In374756854, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In374756854} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:32:41,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-25471497 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-25471497 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-25471497| ~y$w_buff1~0_In-25471497) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-25471497| ~y~0_In-25471497) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-25471497, ~y$w_buff1~0=~y$w_buff1~0_In-25471497, ~y~0=~y~0_In-25471497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-25471497} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-25471497, ~y$w_buff1~0=~y$w_buff1~0_In-25471497, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-25471497|, ~y~0=~y~0_In-25471497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-25471497} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-11-28 18:32:41,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= v_~y~0_50 |v_P1Thread1of1ForFork1_#t~ite9_12|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_12|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_11|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_13|, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-11-28 18:32:41,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2023369114 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2023369114 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out2023369114| ~y$w_buff0_used~0_In2023369114) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out2023369114| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2023369114, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2023369114} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2023369114, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2023369114, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2023369114|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-11-28 18:32:41,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-347209698 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-347209698 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-347209698 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-347209698 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-347209698|)) (and (= ~y$w_buff1_used~0_In-347209698 |P0Thread1of1ForFork0_#t~ite6_Out-347209698|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-347209698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-347209698, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-347209698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-347209698} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-347209698|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-347209698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-347209698, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-347209698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-347209698} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:32:41,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2130534469 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-2130534469 256) 0)) (.cse1 (= ~y$r_buff0_thd1~0_In-2130534469 ~y$r_buff0_thd1~0_Out-2130534469))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out-2130534469) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2130534469, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2130534469} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2130534469, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2130534469|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2130534469} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:32:41,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-714233375 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-714233375 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-714233375 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-714233375 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-714233375| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-714233375 |P1Thread1of1ForFork1_#t~ite12_Out-714233375|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-714233375, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-714233375, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-714233375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-714233375} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-714233375, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-714233375, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-714233375, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-714233375|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-714233375} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:32:41,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1004460044 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1004460044 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1004460044|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1004460044| ~y$r_buff0_thd2~0_In-1004460044) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1004460044, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1004460044} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1004460044, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1004460044, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1004460044|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-11-28 18:32:41,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1987902948 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1987902948 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1987902948 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1987902948 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1987902948| ~y$r_buff1_thd2~0_In1987902948) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1987902948|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1987902948, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1987902948, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1987902948, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1987902948} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1987902948, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1987902948, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1987902948, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1987902948|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1987902948} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:32:41,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= |v_P1Thread1of1ForFork1_#t~ite14_32| v_~y$r_buff1_thd2~0_85)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_85, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:32:41,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In879251795 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In879251795 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In879251795 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In879251795 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out879251795|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In879251795 |P0Thread1of1ForFork0_#t~ite8_Out879251795|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In879251795, ~y$w_buff0_used~0=~y$w_buff0_used~0_In879251795, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In879251795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In879251795} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In879251795, ~y$w_buff0_used~0=~y$w_buff0_used~0_In879251795, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out879251795|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In879251795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In879251795} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:32:41,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L738-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:32:41,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_159 256) 0) (= (mod v_~y$r_buff0_thd0~0_61 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:32:41,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-532270082 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-532270082 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out-532270082| ~y$w_buff1~0_In-532270082) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-532270082 |ULTIMATE.start_main_#t~ite17_Out-532270082|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-532270082, ~y~0=~y~0_In-532270082, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-532270082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-532270082} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-532270082|, ~y$w_buff1~0=~y$w_buff1~0_In-532270082, ~y~0=~y~0_In-532270082, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-532270082, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-532270082} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-11-28 18:32:41,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-11-28 18:32:41,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-136284691 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-136284691 256) 0))) (or (and (= ~y$w_buff0_used~0_In-136284691 |ULTIMATE.start_main_#t~ite19_Out-136284691|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite19_Out-136284691|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-136284691, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-136284691} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-136284691, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-136284691|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-136284691} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-11-28 18:32:41,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1345988767 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1345988767 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1345988767 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1345988767 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out-1345988767| ~y$w_buff1_used~0_In-1345988767)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite20_Out-1345988767| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1345988767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1345988767, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1345988767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1345988767} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1345988767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1345988767, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1345988767|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1345988767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1345988767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-11-28 18:32:41,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1696016814 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1696016814 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-1696016814 |ULTIMATE.start_main_#t~ite21_Out-1696016814|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1696016814|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1696016814, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1696016814} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1696016814, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1696016814, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1696016814|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-11-28 18:32:41,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In2109244064 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In2109244064 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2109244064 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2109244064 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out2109244064| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite22_Out2109244064| ~y$r_buff1_thd0~0_In2109244064) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2109244064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2109244064, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2109244064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2109244064} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2109244064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2109244064, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2109244064, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out2109244064|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2109244064} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-11-28 18:32:41,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L799-->L799-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In285482631 256)))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out285482631| ~y$w_buff0_used~0_In285482631) (= |ULTIMATE.start_main_#t~ite35_Out285482631| |ULTIMATE.start_main_#t~ite34_Out285482631|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In285482631 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In285482631 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In285482631 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In285482631 256))))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out285482631| ~y$w_buff0_used~0_In285482631) (= |ULTIMATE.start_main_#t~ite34_In285482631| |ULTIMATE.start_main_#t~ite34_Out285482631|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In285482631, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In285482631, ~weak$$choice2~0=~weak$$choice2~0_In285482631, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In285482631, ~y$w_buff1_used~0=~y$w_buff1_used~0_In285482631, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In285482631|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In285482631, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In285482631, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out285482631|, ~weak$$choice2~0=~weak$$choice2~0_In285482631, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In285482631, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out285482631|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In285482631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:32:41,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (= v_~y$r_buff0_thd0~0_72 v_~y$r_buff0_thd0~0_71) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-11-28 18:32:41,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L804-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_21) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (not (= 0 (mod v_~y$flush_delayed~0_36 256))) (= 0 v_~y$flush_delayed~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_99, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:32:41,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:32:41,333 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:32:41,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:32:41,338 INFO L168 Benchmark]: Toolchain (without parser) took 13990.34 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 498.1 MB). Free memory was 957.7 MB in the beginning and 1.4 GB in the end (delta: -433.1 MB). Peak memory consumption was 65.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:32:41,338 INFO L168 Benchmark]: CDTParser took 0.91 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:32:41,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 872.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -114.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:32:41,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.86 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-11-28 18:32:41,340 INFO L168 Benchmark]: Boogie Preprocessor took 39.40 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:32:41,341 INFO L168 Benchmark]: RCFGBuilder took 728.93 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.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:32:41,342 INFO L168 Benchmark]: TraceAbstraction took 12128.52 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 392.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -384.4 MB). Peak memory consumption was 485.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:32:41,342 INFO L168 Benchmark]: Witness Printer took 137.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:32:41,346 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.91 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 872.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -114.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.86 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. * Boogie Preprocessor took 39.40 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 728.93 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.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12128.52 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 392.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -384.4 MB). Peak memory consumption was 485.0 MB. Max. memory is 11.5 GB. * Witness Printer took 137.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 145 ProgramPointsBefore, 78 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3579 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 46212 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1008 SDtfs, 958 SDslu, 2443 SDs, 0 SdLazy, 1235 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11467occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1658 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 82047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...