./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe034_rmo.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/safe034_rmo.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 6502699b0636f14dc84962f4c9a7dd4684a89e27 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:33:49,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:33:49,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:33:49,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:33:49,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:33:49,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:33:49,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:33:49,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:33:49,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:33:49,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:33:49,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:33:49,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:33:49,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:33:49,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:33:49,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:33:49,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:33:49,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:33:49,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:33:49,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:33:49,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:33:49,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:33:49,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:33:49,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:33:49,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:33:49,950 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:33:49,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:33:49,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:33:49,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:33:49,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:33:49,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:33:49,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:33:49,954 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:33:49,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:33:49,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:33:49,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:33:49,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:33:49,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:33:49,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:33:49,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:33:49,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:33:49,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:33:49,961 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:33:49,975 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:33:49,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:33:49,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:33:49,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:33:49,977 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:33:49,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:33:49,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:33:49,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:33:49,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:33:49,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:33:49,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:33:49,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:33:49,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:33:49,979 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:33:49,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:33:49,980 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:33:49,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:33:49,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:33:49,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:33:49,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:33:49,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:33:49,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:33:49,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:33:49,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:33:49,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:33:49,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:33:49,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:33:49,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:33:49,984 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:33:49,984 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 -> 6502699b0636f14dc84962f4c9a7dd4684a89e27 [2019-11-28 18:33:50,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:33:50,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:33:50,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:33:50,295 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:33:50,296 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:33:50,297 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe034_rmo.oepc.i [2019-11-28 18:33:50,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d253ddcef/7dda2aee3d354d1188753fe19c2a1bea/FLAGe64fbf3c8 [2019-11-28 18:33:50,908 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:33:50,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe034_rmo.oepc.i [2019-11-28 18:33:50,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d253ddcef/7dda2aee3d354d1188753fe19c2a1bea/FLAGe64fbf3c8 [2019-11-28 18:33:51,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d253ddcef/7dda2aee3d354d1188753fe19c2a1bea [2019-11-28 18:33:51,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:33:51,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:33:51,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:33:51,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:33:51,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:33:51,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:33:51" (1/1) ... [2019-11-28 18:33:51,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8d6d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:51, skipping insertion in model container [2019-11-28 18:33:51,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:33:51" (1/1) ... [2019-11-28 18:33:51,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:33:51,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:33:51,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:33:51,882 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:33:51,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:33:52,034 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:33:52,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:52 WrapperNode [2019-11-28 18:33:52,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:33:52,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:33:52,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:33:52,036 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:33:52,045 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:33:52" (1/1) ... [2019-11-28 18:33:52,065 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:33:52" (1/1) ... [2019-11-28 18:33:52,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:33:52,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:33:52,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:33:52,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:33:52,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:52" (1/1) ... [2019-11-28 18:33:52,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:52" (1/1) ... [2019-11-28 18:33:52,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:52" (1/1) ... [2019-11-28 18:33:52,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:52" (1/1) ... [2019-11-28 18:33:52,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:52" (1/1) ... [2019-11-28 18:33:52,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:52" (1/1) ... [2019-11-28 18:33:52,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:52" (1/1) ... [2019-11-28 18:33:52,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:33:52,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:33:52,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:33:52,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:33:52,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:52" (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:33:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:33:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:33:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:33:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:33:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:33:52,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:33:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:33:52,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:33:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:33:52,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:33:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:33:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:33:52,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:33:52,219 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:33:52,921 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:33:52,922 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:33:52,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:52 BoogieIcfgContainer [2019-11-28 18:33:52,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:33:52,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:33:52,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:33:52,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:33:52,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:33:51" (1/3) ... [2019-11-28 18:33:52,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7de51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:33:52, skipping insertion in model container [2019-11-28 18:33:52,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:52" (2/3) ... [2019-11-28 18:33:52,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7de51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:33:52, skipping insertion in model container [2019-11-28 18:33:52,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:52" (3/3) ... [2019-11-28 18:33:52,932 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_rmo.oepc.i [2019-11-28 18:33:52,941 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:33:52,941 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:33:52,948 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:33:52,949 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:33:52,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:52,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,010 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,010 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:53,032 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:33:53,051 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:33:53,051 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:33:53,052 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:33:53,052 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:33:53,052 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:33:53,052 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:33:53,052 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:33:53,052 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:33:53,069 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-11-28 18:33:53,071 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-11-28 18:33:53,180 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-11-28 18:33:53,180 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:33:53,195 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:33:53,216 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-11-28 18:33:53,260 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-11-28 18:33:53,260 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:33:53,267 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:33:53,283 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:33:53,285 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:33:57,720 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-28 18:33:57,889 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 18:33:58,090 INFO L206 etLargeBlockEncoding]: Checked pairs total: 63936 [2019-11-28 18:33:58,091 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-11-28 18:33:58,095 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-11-28 18:33:59,132 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14042 states. [2019-11-28 18:33:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states. [2019-11-28 18:33:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:33:59,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:59,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:59,141 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:59,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1097508166, now seen corresponding path program 1 times [2019-11-28 18:33:59,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:59,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098958506] [2019-11-28 18:33:59,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:59,379 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:33:59,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098958506] [2019-11-28 18:33:59,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:59,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:33:59,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510069193] [2019-11-28 18:33:59,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:59,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:59,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:59,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:59,406 INFO L87 Difference]: Start difference. First operand 14042 states. Second operand 3 states. [2019-11-28 18:33:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:59,703 INFO L93 Difference]: Finished difference Result 13722 states and 52554 transitions. [2019-11-28 18:33:59,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:59,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:33:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:59,847 INFO L225 Difference]: With dead ends: 13722 [2019-11-28 18:33:59,847 INFO L226 Difference]: Without dead ends: 12214 [2019-11-28 18:33:59,849 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:34:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-11-28 18:34:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12214. [2019-11-28 18:34:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2019-11-28 18:34:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 46640 transitions. [2019-11-28 18:34:00,633 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 46640 transitions. Word has length 7 [2019-11-28 18:34:00,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:00,635 INFO L462 AbstractCegarLoop]: Abstraction has 12214 states and 46640 transitions. [2019-11-28 18:34:00,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:34:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 46640 transitions. [2019-11-28 18:34:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:34:00,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:00,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:00,641 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1356084764, now seen corresponding path program 1 times [2019-11-28 18:34:00,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:00,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489932519] [2019-11-28 18:34:00,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:00,745 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:34:00,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489932519] [2019-11-28 18:34:00,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:00,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:34:00,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488332298] [2019-11-28 18:34:00,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:34:00,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:00,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:34:00,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:34:00,749 INFO L87 Difference]: Start difference. First operand 12214 states and 46640 transitions. Second operand 4 states. [2019-11-28 18:34:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:01,109 INFO L93 Difference]: Finished difference Result 18446 states and 67942 transitions. [2019-11-28 18:34:01,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:34:01,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:34:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:01,206 INFO L225 Difference]: With dead ends: 18446 [2019-11-28 18:34:01,207 INFO L226 Difference]: Without dead ends: 18390 [2019-11-28 18:34:01,208 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:34:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18390 states. [2019-11-28 18:34:01,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18390 to 16710. [2019-11-28 18:34:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-11-28 18:34:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 62402 transitions. [2019-11-28 18:34:01,837 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 62402 transitions. Word has length 13 [2019-11-28 18:34:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:01,837 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 62402 transitions. [2019-11-28 18:34:01,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:34:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 62402 transitions. [2019-11-28 18:34:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:34:02,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:02,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:02,104 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:02,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash -280168635, now seen corresponding path program 1 times [2019-11-28 18:34:02,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:02,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334766814] [2019-11-28 18:34:02,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:02,241 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:34:02,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334766814] [2019-11-28 18:34:02,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:02,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:02,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375396941] [2019-11-28 18:34:02,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:34:02,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:02,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:34:02,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:34:02,243 INFO L87 Difference]: Start difference. First operand 16710 states and 62402 transitions. Second operand 5 states. [2019-11-28 18:34:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:02,558 INFO L93 Difference]: Finished difference Result 24000 states and 87901 transitions. [2019-11-28 18:34:02,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:34:02,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 18:34:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:02,654 INFO L225 Difference]: With dead ends: 24000 [2019-11-28 18:34:02,654 INFO L226 Difference]: Without dead ends: 23924 [2019-11-28 18:34:02,655 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:34:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-11-28 18:34:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 20292. [2019-11-28 18:34:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20292 states. [2019-11-28 18:34:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20292 states to 20292 states and 75385 transitions. [2019-11-28 18:34:03,336 INFO L78 Accepts]: Start accepts. Automaton has 20292 states and 75385 transitions. Word has length 16 [2019-11-28 18:34:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:03,336 INFO L462 AbstractCegarLoop]: Abstraction has 20292 states and 75385 transitions. [2019-11-28 18:34:03,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:34:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20292 states and 75385 transitions. [2019-11-28 18:34:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:34:03,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:03,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:03,345 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:03,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:03,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1749985236, now seen corresponding path program 1 times [2019-11-28 18:34:03,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:03,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949943834] [2019-11-28 18:34:03,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:03,437 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:34:03,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949943834] [2019-11-28 18:34:03,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:03,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:34:03,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852647994] [2019-11-28 18:34:03,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:34:03,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:03,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:34:03,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:34:03,439 INFO L87 Difference]: Start difference. First operand 20292 states and 75385 transitions. Second operand 3 states. [2019-11-28 18:34:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:03,566 INFO L93 Difference]: Finished difference Result 19280 states and 70741 transitions. [2019-11-28 18:34:03,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:34:03,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:34:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:03,634 INFO L225 Difference]: With dead ends: 19280 [2019-11-28 18:34:03,635 INFO L226 Difference]: Without dead ends: 19280 [2019-11-28 18:34:03,635 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:34:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19280 states. [2019-11-28 18:34:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19280 to 19016. [2019-11-28 18:34:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19016 states. [2019-11-28 18:34:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19016 states to 19016 states and 69841 transitions. [2019-11-28 18:34:04,552 INFO L78 Accepts]: Start accepts. Automaton has 19016 states and 69841 transitions. Word has length 18 [2019-11-28 18:34:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:04,552 INFO L462 AbstractCegarLoop]: Abstraction has 19016 states and 69841 transitions. [2019-11-28 18:34:04,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:34:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 19016 states and 69841 transitions. [2019-11-28 18:34:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:34:04,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:04,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:04,561 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:04,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2086322840, now seen corresponding path program 1 times [2019-11-28 18:34:04,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:04,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096469635] [2019-11-28 18:34:04,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:04,685 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:34:04,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096469635] [2019-11-28 18:34:04,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:04,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:04,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894547521] [2019-11-28 18:34:04,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:34:04,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:04,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:34:04,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:34:04,687 INFO L87 Difference]: Start difference. First operand 19016 states and 69841 transitions. Second operand 4 states. [2019-11-28 18:34:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:04,772 INFO L93 Difference]: Finished difference Result 11974 states and 38351 transitions. [2019-11-28 18:34:04,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:34:04,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 18:34:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:04,804 INFO L225 Difference]: With dead ends: 11974 [2019-11-28 18:34:04,804 INFO L226 Difference]: Without dead ends: 10908 [2019-11-28 18:34:04,806 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:34:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10908 states. [2019-11-28 18:34:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10908 to 10908. [2019-11-28 18:34:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10908 states. [2019-11-28 18:34:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10908 states to 10908 states and 34891 transitions. [2019-11-28 18:34:05,092 INFO L78 Accepts]: Start accepts. Automaton has 10908 states and 34891 transitions. Word has length 18 [2019-11-28 18:34:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:05,092 INFO L462 AbstractCegarLoop]: Abstraction has 10908 states and 34891 transitions. [2019-11-28 18:34:05,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:34:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 10908 states and 34891 transitions. [2019-11-28 18:34:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:34:05,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:05,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:05,097 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:05,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:05,101 INFO L82 PathProgramCache]: Analyzing trace with hash 44045431, now seen corresponding path program 1 times [2019-11-28 18:34:05,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:05,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107918179] [2019-11-28 18:34:05,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:05,202 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:34:05,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107918179] [2019-11-28 18:34:05,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:05,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:34:05,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519746652] [2019-11-28 18:34:05,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:34:05,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:05,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:34:05,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:34:05,206 INFO L87 Difference]: Start difference. First operand 10908 states and 34891 transitions. Second operand 5 states. [2019-11-28 18:34:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:05,280 INFO L93 Difference]: Finished difference Result 2615 states and 7252 transitions. [2019-11-28 18:34:05,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:34:05,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 18:34:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:05,285 INFO L225 Difference]: With dead ends: 2615 [2019-11-28 18:34:05,286 INFO L226 Difference]: Without dead ends: 2014 [2019-11-28 18:34:05,287 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:34:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2019-11-28 18:34:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2014. [2019-11-28 18:34:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-11-28 18:34:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 5324 transitions. [2019-11-28 18:34:05,322 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 5324 transitions. Word has length 19 [2019-11-28 18:34:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:05,323 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 5324 transitions. [2019-11-28 18:34:05,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:34:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 5324 transitions. [2019-11-28 18:34:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:34:05,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:05,328 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] [2019-11-28 18:34:05,328 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:05,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:05,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1434647427, now seen corresponding path program 1 times [2019-11-28 18:34:05,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:05,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159088055] [2019-11-28 18:34:05,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:05,410 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:34:05,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159088055] [2019-11-28 18:34:05,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:05,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:05,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347353460] [2019-11-28 18:34:05,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:34:05,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:05,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:34:05,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:34:05,413 INFO L87 Difference]: Start difference. First operand 2014 states and 5324 transitions. Second operand 3 states. [2019-11-28 18:34:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:05,466 INFO L93 Difference]: Finished difference Result 2850 states and 7274 transitions. [2019-11-28 18:34:05,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:34:05,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 18:34:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:05,472 INFO L225 Difference]: With dead ends: 2850 [2019-11-28 18:34:05,472 INFO L226 Difference]: Without dead ends: 2850 [2019-11-28 18:34:05,473 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:34:05,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2019-11-28 18:34:05,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2110. [2019-11-28 18:34:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-11-28 18:34:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 5466 transitions. [2019-11-28 18:34:05,512 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 5466 transitions. Word has length 29 [2019-11-28 18:34:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:05,513 INFO L462 AbstractCegarLoop]: Abstraction has 2110 states and 5466 transitions. [2019-11-28 18:34:05,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:34:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 5466 transitions. [2019-11-28 18:34:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:34:05,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:05,519 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] [2019-11-28 18:34:05,519 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:05,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:05,519 INFO L82 PathProgramCache]: Analyzing trace with hash 364652847, now seen corresponding path program 1 times [2019-11-28 18:34:05,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:05,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177579278] [2019-11-28 18:34:05,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:05,633 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:34:05,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177579278] [2019-11-28 18:34:05,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:05,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:34:05,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100405868] [2019-11-28 18:34:05,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:34:05,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:05,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:34:05,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:34:05,635 INFO L87 Difference]: Start difference. First operand 2110 states and 5466 transitions. Second operand 6 states. [2019-11-28 18:34:05,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:05,916 INFO L93 Difference]: Finished difference Result 3354 states and 8440 transitions. [2019-11-28 18:34:05,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:34:05,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-28 18:34:05,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:05,922 INFO L225 Difference]: With dead ends: 3354 [2019-11-28 18:34:05,922 INFO L226 Difference]: Without dead ends: 3346 [2019-11-28 18:34:05,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:34:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-11-28 18:34:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2160. [2019-11-28 18:34:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2019-11-28 18:34:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 5592 transitions. [2019-11-28 18:34:05,960 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 5592 transitions. Word has length 29 [2019-11-28 18:34:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:05,960 INFO L462 AbstractCegarLoop]: Abstraction has 2160 states and 5592 transitions. [2019-11-28 18:34:05,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:34:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 5592 transitions. [2019-11-28 18:34:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:34:05,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:05,964 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] [2019-11-28 18:34:05,965 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:05,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:05,965 INFO L82 PathProgramCache]: Analyzing trace with hash 804701306, now seen corresponding path program 1 times [2019-11-28 18:34:05,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:05,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121875418] [2019-11-28 18:34:05,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:06,065 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:34:06,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121875418] [2019-11-28 18:34:06,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:06,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:34:06,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706671860] [2019-11-28 18:34:06,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:34:06,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:06,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:34:06,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:34:06,075 INFO L87 Difference]: Start difference. First operand 2160 states and 5592 transitions. Second operand 3 states. [2019-11-28 18:34:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:06,102 INFO L93 Difference]: Finished difference Result 3490 states and 8719 transitions. [2019-11-28 18:34:06,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:34:06,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 18:34:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:06,109 INFO L225 Difference]: With dead ends: 3490 [2019-11-28 18:34:06,109 INFO L226 Difference]: Without dead ends: 3128 [2019-11-28 18:34:06,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:34:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2019-11-28 18:34:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 3100. [2019-11-28 18:34:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3100 states. [2019-11-28 18:34:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 7742 transitions. [2019-11-28 18:34:06,174 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 7742 transitions. Word has length 30 [2019-11-28 18:34:06,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:06,177 INFO L462 AbstractCegarLoop]: Abstraction has 3100 states and 7742 transitions. [2019-11-28 18:34:06,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:34:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 7742 transitions. [2019-11-28 18:34:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:34:06,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:06,188 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] [2019-11-28 18:34:06,188 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:06,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:06,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1852558596, now seen corresponding path program 2 times [2019-11-28 18:34:06,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:06,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033164833] [2019-11-28 18:34:06,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:06,307 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:34:06,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033164833] [2019-11-28 18:34:06,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:06,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:34:06,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307707331] [2019-11-28 18:34:06,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:34:06,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:06,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:34:06,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:34:06,309 INFO L87 Difference]: Start difference. First operand 3100 states and 7742 transitions. Second operand 6 states. [2019-11-28 18:34:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:06,381 INFO L93 Difference]: Finished difference Result 1877 states and 4852 transitions. [2019-11-28 18:34:06,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:34:06,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-28 18:34:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:06,384 INFO L225 Difference]: With dead ends: 1877 [2019-11-28 18:34:06,384 INFO L226 Difference]: Without dead ends: 1747 [2019-11-28 18:34:06,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:34:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2019-11-28 18:34:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1256. [2019-11-28 18:34:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-11-28 18:34:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 3372 transitions. [2019-11-28 18:34:06,407 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 3372 transitions. Word has length 30 [2019-11-28 18:34:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:06,408 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 3372 transitions. [2019-11-28 18:34:06,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:34:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 3372 transitions. [2019-11-28 18:34:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:06,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:06,413 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] [2019-11-28 18:34:06,413 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:06,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:06,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1812124980, now seen corresponding path program 1 times [2019-11-28 18:34:06,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:06,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896117631] [2019-11-28 18:34:06,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:06,691 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:34:06,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896117631] [2019-11-28 18:34:06,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:06,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:06,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967406524] [2019-11-28 18:34:06,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:34:06,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:06,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:34:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:34:06,694 INFO L87 Difference]: Start difference. First operand 1256 states and 3372 transitions. Second operand 3 states. [2019-11-28 18:34:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:06,735 INFO L93 Difference]: Finished difference Result 1456 states and 3760 transitions. [2019-11-28 18:34:06,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:34:06,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-28 18:34:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:06,738 INFO L225 Difference]: With dead ends: 1456 [2019-11-28 18:34:06,738 INFO L226 Difference]: Without dead ends: 1456 [2019-11-28 18:34:06,738 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:34:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-11-28 18:34:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1308. [2019-11-28 18:34:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-11-28 18:34:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 3424 transitions. [2019-11-28 18:34:06,764 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 3424 transitions. Word has length 45 [2019-11-28 18:34:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:06,766 INFO L462 AbstractCegarLoop]: Abstraction has 1308 states and 3424 transitions. [2019-11-28 18:34:06,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:34:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 3424 transitions. [2019-11-28 18:34:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:06,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:06,770 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] [2019-11-28 18:34:06,771 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:06,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:06,771 INFO L82 PathProgramCache]: Analyzing trace with hash -24959066, now seen corresponding path program 1 times [2019-11-28 18:34:06,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:06,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417639281] [2019-11-28 18:34:06,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:07,139 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:34:07,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417639281] [2019-11-28 18:34:07,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:07,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:34:07,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936998681] [2019-11-28 18:34:07,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:34:07,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:07,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:34:07,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:34:07,142 INFO L87 Difference]: Start difference. First operand 1308 states and 3424 transitions. Second operand 12 states. [2019-11-28 18:34:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:09,467 INFO L93 Difference]: Finished difference Result 4472 states and 11009 transitions. [2019-11-28 18:34:09,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 18:34:09,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-11-28 18:34:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:09,473 INFO L225 Difference]: With dead ends: 4472 [2019-11-28 18:34:09,473 INFO L226 Difference]: Without dead ends: 4328 [2019-11-28 18:34:09,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2019-11-28 18:34:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2019-11-28 18:34:09,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 1921. [2019-11-28 18:34:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2019-11-28 18:34:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 5069 transitions. [2019-11-28 18:34:09,503 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 5069 transitions. Word has length 45 [2019-11-28 18:34:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:09,504 INFO L462 AbstractCegarLoop]: Abstraction has 1921 states and 5069 transitions. [2019-11-28 18:34:09,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:34:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 5069 transitions. [2019-11-28 18:34:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:09,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:09,508 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] [2019-11-28 18:34:09,508 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:09,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:09,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1408267876, now seen corresponding path program 2 times [2019-11-28 18:34:09,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:09,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920683545] [2019-11-28 18:34:09,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:09,834 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:34:09,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920683545] [2019-11-28 18:34:09,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:09,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:34:09,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228414119] [2019-11-28 18:34:09,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:34:09,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:09,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:34:09,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:34:09,836 INFO L87 Difference]: Start difference. First operand 1921 states and 5069 transitions. Second operand 12 states. [2019-11-28 18:34:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:12,254 INFO L93 Difference]: Finished difference Result 5047 states and 12244 transitions. [2019-11-28 18:34:12,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-28 18:34:12,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-11-28 18:34:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:12,261 INFO L225 Difference]: With dead ends: 5047 [2019-11-28 18:34:12,261 INFO L226 Difference]: Without dead ends: 4527 [2019-11-28 18:34:12,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 18:34:12,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2019-11-28 18:34:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 1958. [2019-11-28 18:34:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1958 states. [2019-11-28 18:34:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 5090 transitions. [2019-11-28 18:34:12,307 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 5090 transitions. Word has length 45 [2019-11-28 18:34:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:12,307 INFO L462 AbstractCegarLoop]: Abstraction has 1958 states and 5090 transitions. [2019-11-28 18:34:12,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:34:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 5090 transitions. [2019-11-28 18:34:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:12,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:12,312 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] [2019-11-28 18:34:12,312 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:12,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:12,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1317309266, now seen corresponding path program 3 times [2019-11-28 18:34:12,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:12,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080021316] [2019-11-28 18:34:12,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:34:12,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080021316] [2019-11-28 18:34:12,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:12,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:34:12,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422551877] [2019-11-28 18:34:12,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:34:12,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:12,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:34:12,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:34:12,445 INFO L87 Difference]: Start difference. First operand 1958 states and 5090 transitions. Second operand 7 states. [2019-11-28 18:34:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:12,814 INFO L93 Difference]: Finished difference Result 5530 states and 13519 transitions. [2019-11-28 18:34:12,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:34:12,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-28 18:34:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:12,821 INFO L225 Difference]: With dead ends: 5530 [2019-11-28 18:34:12,821 INFO L226 Difference]: Without dead ends: 4283 [2019-11-28 18:34:12,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:34:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4283 states. [2019-11-28 18:34:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4283 to 2085. [2019-11-28 18:34:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2019-11-28 18:34:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 5258 transitions. [2019-11-28 18:34:12,877 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 5258 transitions. Word has length 45 [2019-11-28 18:34:12,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:12,877 INFO L462 AbstractCegarLoop]: Abstraction has 2085 states and 5258 transitions. [2019-11-28 18:34:12,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:34:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 5258 transitions. [2019-11-28 18:34:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:12,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:12,882 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] [2019-11-28 18:34:12,882 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:12,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:12,882 INFO L82 PathProgramCache]: Analyzing trace with hash 93365094, now seen corresponding path program 4 times [2019-11-28 18:34:12,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:12,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890780262] [2019-11-28 18:34:12,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:12,970 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:34:12,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890780262] [2019-11-28 18:34:12,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:12,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:12,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136110096] [2019-11-28 18:34:12,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:34:12,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:12,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:34:12,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:34:12,972 INFO L87 Difference]: Start difference. First operand 2085 states and 5258 transitions. Second operand 4 states. [2019-11-28 18:34:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:13,012 INFO L93 Difference]: Finished difference Result 2657 states and 6476 transitions. [2019-11-28 18:34:13,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:34:13,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:34:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:13,016 INFO L225 Difference]: With dead ends: 2657 [2019-11-28 18:34:13,016 INFO L226 Difference]: Without dead ends: 1832 [2019-11-28 18:34:13,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:34:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2019-11-28 18:34:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1832. [2019-11-28 18:34:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1832 states. [2019-11-28 18:34:13,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 4609 transitions. [2019-11-28 18:34:13,052 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 4609 transitions. Word has length 45 [2019-11-28 18:34:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:13,052 INFO L462 AbstractCegarLoop]: Abstraction has 1832 states and 4609 transitions. [2019-11-28 18:34:13,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:34:13,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 4609 transitions. [2019-11-28 18:34:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:13,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:13,057 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] [2019-11-28 18:34:13,057 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:13,058 INFO L82 PathProgramCache]: Analyzing trace with hash -228434578, now seen corresponding path program 5 times [2019-11-28 18:34:13,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:13,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202273813] [2019-11-28 18:34:13,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:13,161 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:34:13,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202273813] [2019-11-28 18:34:13,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:13,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:13,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747107576] [2019-11-28 18:34:13,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:34:13,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:13,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:34:13,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:34:13,167 INFO L87 Difference]: Start difference. First operand 1832 states and 4609 transitions. Second operand 4 states. [2019-11-28 18:34:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:13,209 INFO L93 Difference]: Finished difference Result 2355 states and 5770 transitions. [2019-11-28 18:34:13,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:34:13,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:34:13,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:13,213 INFO L225 Difference]: With dead ends: 2355 [2019-11-28 18:34:13,213 INFO L226 Difference]: Without dead ends: 1774 [2019-11-28 18:34:13,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:34:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2019-11-28 18:34:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1371. [2019-11-28 18:34:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2019-11-28 18:34:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 3502 transitions. [2019-11-28 18:34:13,242 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 3502 transitions. Word has length 45 [2019-11-28 18:34:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:13,244 INFO L462 AbstractCegarLoop]: Abstraction has 1371 states and 3502 transitions. [2019-11-28 18:34:13,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:34:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 3502 transitions. [2019-11-28 18:34:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:13,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:13,248 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] [2019-11-28 18:34:13,248 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:13,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1267873360, now seen corresponding path program 6 times [2019-11-28 18:34:13,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:13,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471031036] [2019-11-28 18:34:13,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:34:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:34:13,398 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:34:13,398 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:34:13,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t2589~0.offset_22|) (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2589~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2589~0.base_31|) |v_ULTIMATE.start_main_~#t2589~0.offset_22| 0))) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2589~0.base_31|)) (= |v_#NULL.offset_6| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2589~0.base_31| 4)) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2589~0.base_31|) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t2589~0.base_31| 1) |v_#valid_66|) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t2589~0.base=|v_ULTIMATE.start_main_~#t2589~0.base_31|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ULTIMATE.start_main_~#t2590~0.base=|v_ULTIMATE.start_main_~#t2590~0.base_31|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t2591~0.base=|v_ULTIMATE.start_main_~#t2591~0.base_23|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t2589~0.offset=|v_ULTIMATE.start_main_~#t2589~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ULTIMATE.start_main_~#t2591~0.offset=|v_ULTIMATE.start_main_~#t2591~0.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2590~0.offset=|v_ULTIMATE.start_main_~#t2590~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2591~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2589~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2589~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2591~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2590~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2590~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:34:13,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2590~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2590~0.base_10|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2590~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t2590~0.offset_9| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2590~0.base_10| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t2590~0.base_10| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2590~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2590~0.base_10|) |v_ULTIMATE.start_main_~#t2590~0.offset_9| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2590~0.offset=|v_ULTIMATE.start_main_~#t2590~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2590~0.base=|v_ULTIMATE.start_main_~#t2590~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2590~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2590~0.base] because there is no mapped edge [2019-11-28 18:34:13,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2591~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2591~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2591~0.base_11|) |v_ULTIMATE.start_main_~#t2591~0.offset_10| 2))) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2591~0.base_11|)) (= |v_ULTIMATE.start_main_~#t2591~0.offset_10| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2591~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2591~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2591~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2591~0.base=|v_ULTIMATE.start_main_~#t2591~0.base_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2591~0.offset=|v_ULTIMATE.start_main_~#t2591~0.offset_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2591~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2591~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:34:13,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:34:13,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:34:13,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1191515578 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In-1191515578| |P1Thread1of1ForFork1_#t~ite8_Out-1191515578|) (= |P1Thread1of1ForFork1_#t~ite9_Out-1191515578| ~y$w_buff0~0_In-1191515578)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1191515578| |P1Thread1of1ForFork1_#t~ite8_Out-1191515578|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1191515578 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1191515578 256) 0)) (= (mod ~y$w_buff0_used~0_In-1191515578 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1191515578 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite8_Out-1191515578| ~y$w_buff0~0_In-1191515578)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1191515578, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1191515578, ~y$w_buff0~0=~y$w_buff0~0_In-1191515578, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1191515578, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-1191515578|, ~weak$$choice2~0=~weak$$choice2~0_In-1191515578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1191515578} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1191515578, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1191515578, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1191515578|, ~y$w_buff0~0=~y$w_buff0~0_In-1191515578, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1191515578, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-1191515578|, ~weak$$choice2~0=~weak$$choice2~0_In-1191515578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1191515578} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:34:13,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2058170109 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-2058170109| ~y$w_buff0_used~0_In-2058170109) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2058170109 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-2058170109 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-2058170109 256))) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-2058170109 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out-2058170109| |P1Thread1of1ForFork1_#t~ite14_Out-2058170109|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In-2058170109| |P1Thread1of1ForFork1_#t~ite14_Out-2058170109|) (= |P1Thread1of1ForFork1_#t~ite15_Out-2058170109| ~y$w_buff0_used~0_In-2058170109)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2058170109, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058170109, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2058170109, ~weak$$choice2~0=~weak$$choice2~0_In-2058170109, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-2058170109|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2058170109} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2058170109, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058170109, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2058170109, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-2058170109|, ~weak$$choice2~0=~weak$$choice2~0_In-2058170109, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2058170109|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2058170109} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:34:13,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:34:13,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In282779099 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In282779099 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out282779099|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In282779099 |P2Thread1of1ForFork2_#t~ite28_Out282779099|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In282779099, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In282779099} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In282779099, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In282779099, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out282779099|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:34:13,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:34:13,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-429540871 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-429540871 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-429540871 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-429540871 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-429540871|)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite29_Out-429540871| ~y$w_buff1_used~0_In-429540871) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-429540871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-429540871, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-429540871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-429540871} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-429540871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-429540871, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-429540871, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-429540871|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-429540871} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:34:13,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1062392638 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1062392638 256) 0)) (.cse1 (= ~y$r_buff0_thd3~0_Out1062392638 ~y$r_buff0_thd3~0_In1062392638))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= ~y$r_buff0_thd3~0_Out1062392638 0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1062392638, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1062392638} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1062392638, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1062392638|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1062392638} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:34:13,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1264100461 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1264100461 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1264100461 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1264100461 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In1264100461 |P2Thread1of1ForFork2_#t~ite31_Out1264100461|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1264100461|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1264100461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1264100461, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1264100461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1264100461} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1264100461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1264100461, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1264100461|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1264100461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1264100461} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:34:13,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:34:13,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:34:13,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-572520395 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-572520395 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out-572520395| ~y$w_buff1~0_In-572520395) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite35_Out-572520395| ~y~0_In-572520395) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-572520395, ~y~0=~y~0_In-572520395, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-572520395, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572520395} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-572520395, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-572520395|, ~y~0=~y~0_In-572520395, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-572520395, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572520395} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:34:13,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:34:13,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1962104431 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1962104431 256) 0))) (or (and (= ~y$w_buff0_used~0_In1962104431 |ULTIMATE.start_main_#t~ite37_Out1962104431|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out1962104431|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1962104431, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1962104431} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1962104431, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1962104431, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1962104431|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:34:13,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1939844252 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1939844252 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1939844252 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1939844252 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1939844252| ~y$w_buff1_used~0_In-1939844252) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite38_Out-1939844252| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1939844252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1939844252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1939844252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1939844252} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1939844252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1939844252, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1939844252|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1939844252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1939844252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:34:13,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1130650705 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1130650705 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1130650705 |ULTIMATE.start_main_#t~ite39_Out-1130650705|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1130650705|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1130650705, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1130650705} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1130650705, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1130650705|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1130650705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:34:13,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In855000438 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In855000438 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In855000438 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In855000438 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out855000438| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite40_Out855000438| ~y$r_buff1_thd0~0_In855000438)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In855000438, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In855000438, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In855000438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In855000438} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out855000438|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In855000438, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In855000438, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In855000438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In855000438} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:34:13,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:34:13,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:34:13 BasicIcfg [2019-11-28 18:34:13,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:34:13,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:34:13,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:34:13,575 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:34:13,575 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:52" (3/4) ... [2019-11-28 18:34:13,582 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:34:13,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t2589~0.offset_22|) (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2589~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2589~0.base_31|) |v_ULTIMATE.start_main_~#t2589~0.offset_22| 0))) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2589~0.base_31|)) (= |v_#NULL.offset_6| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2589~0.base_31| 4)) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2589~0.base_31|) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t2589~0.base_31| 1) |v_#valid_66|) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t2589~0.base=|v_ULTIMATE.start_main_~#t2589~0.base_31|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ULTIMATE.start_main_~#t2590~0.base=|v_ULTIMATE.start_main_~#t2590~0.base_31|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t2591~0.base=|v_ULTIMATE.start_main_~#t2591~0.base_23|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t2589~0.offset=|v_ULTIMATE.start_main_~#t2589~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ULTIMATE.start_main_~#t2591~0.offset=|v_ULTIMATE.start_main_~#t2591~0.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2590~0.offset=|v_ULTIMATE.start_main_~#t2590~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2591~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2589~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2589~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2591~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2590~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2590~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:34:13,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2590~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2590~0.base_10|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2590~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t2590~0.offset_9| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2590~0.base_10| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t2590~0.base_10| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2590~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2590~0.base_10|) |v_ULTIMATE.start_main_~#t2590~0.offset_9| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2590~0.offset=|v_ULTIMATE.start_main_~#t2590~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2590~0.base=|v_ULTIMATE.start_main_~#t2590~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2590~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2590~0.base] because there is no mapped edge [2019-11-28 18:34:13,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2591~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2591~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2591~0.base_11|) |v_ULTIMATE.start_main_~#t2591~0.offset_10| 2))) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2591~0.base_11|)) (= |v_ULTIMATE.start_main_~#t2591~0.offset_10| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2591~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2591~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2591~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2591~0.base=|v_ULTIMATE.start_main_~#t2591~0.base_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2591~0.offset=|v_ULTIMATE.start_main_~#t2591~0.offset_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2591~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2591~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:34:13,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:34:13,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:34:13,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1191515578 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In-1191515578| |P1Thread1of1ForFork1_#t~ite8_Out-1191515578|) (= |P1Thread1of1ForFork1_#t~ite9_Out-1191515578| ~y$w_buff0~0_In-1191515578)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1191515578| |P1Thread1of1ForFork1_#t~ite8_Out-1191515578|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1191515578 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1191515578 256) 0)) (= (mod ~y$w_buff0_used~0_In-1191515578 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1191515578 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite8_Out-1191515578| ~y$w_buff0~0_In-1191515578)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1191515578, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1191515578, ~y$w_buff0~0=~y$w_buff0~0_In-1191515578, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1191515578, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-1191515578|, ~weak$$choice2~0=~weak$$choice2~0_In-1191515578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1191515578} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1191515578, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1191515578, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1191515578|, ~y$w_buff0~0=~y$w_buff0~0_In-1191515578, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1191515578, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-1191515578|, ~weak$$choice2~0=~weak$$choice2~0_In-1191515578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1191515578} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:34:13,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2058170109 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-2058170109| ~y$w_buff0_used~0_In-2058170109) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2058170109 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-2058170109 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-2058170109 256))) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-2058170109 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out-2058170109| |P1Thread1of1ForFork1_#t~ite14_Out-2058170109|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In-2058170109| |P1Thread1of1ForFork1_#t~ite14_Out-2058170109|) (= |P1Thread1of1ForFork1_#t~ite15_Out-2058170109| ~y$w_buff0_used~0_In-2058170109)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2058170109, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058170109, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2058170109, ~weak$$choice2~0=~weak$$choice2~0_In-2058170109, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-2058170109|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2058170109} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2058170109, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058170109, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2058170109, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-2058170109|, ~weak$$choice2~0=~weak$$choice2~0_In-2058170109, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2058170109|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2058170109} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:34:13,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:34:13,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In282779099 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In282779099 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out282779099|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In282779099 |P2Thread1of1ForFork2_#t~ite28_Out282779099|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In282779099, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In282779099} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In282779099, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In282779099, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out282779099|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:34:13,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:34:13,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-429540871 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-429540871 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-429540871 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-429540871 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-429540871|)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite29_Out-429540871| ~y$w_buff1_used~0_In-429540871) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-429540871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-429540871, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-429540871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-429540871} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-429540871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-429540871, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-429540871, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-429540871|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-429540871} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:34:13,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1062392638 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1062392638 256) 0)) (.cse1 (= ~y$r_buff0_thd3~0_Out1062392638 ~y$r_buff0_thd3~0_In1062392638))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= ~y$r_buff0_thd3~0_Out1062392638 0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1062392638, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1062392638} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1062392638, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1062392638|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1062392638} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:34:13,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1264100461 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1264100461 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1264100461 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1264100461 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In1264100461 |P2Thread1of1ForFork2_#t~ite31_Out1264100461|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1264100461|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1264100461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1264100461, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1264100461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1264100461} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1264100461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1264100461, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1264100461|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1264100461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1264100461} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:34:13,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:34:13,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:34:13,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-572520395 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-572520395 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out-572520395| ~y$w_buff1~0_In-572520395) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite35_Out-572520395| ~y~0_In-572520395) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-572520395, ~y~0=~y~0_In-572520395, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-572520395, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572520395} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-572520395, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-572520395|, ~y~0=~y~0_In-572520395, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-572520395, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572520395} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:34:13,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:34:13,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1962104431 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1962104431 256) 0))) (or (and (= ~y$w_buff0_used~0_In1962104431 |ULTIMATE.start_main_#t~ite37_Out1962104431|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out1962104431|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1962104431, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1962104431} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1962104431, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1962104431, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1962104431|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:34:13,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1939844252 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1939844252 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1939844252 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1939844252 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1939844252| ~y$w_buff1_used~0_In-1939844252) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite38_Out-1939844252| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1939844252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1939844252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1939844252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1939844252} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1939844252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1939844252, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1939844252|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1939844252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1939844252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:34:13,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1130650705 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1130650705 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1130650705 |ULTIMATE.start_main_#t~ite39_Out-1130650705|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1130650705|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1130650705, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1130650705} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1130650705, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1130650705|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1130650705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:34:13,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In855000438 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In855000438 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In855000438 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In855000438 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out855000438| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite40_Out855000438| ~y$r_buff1_thd0~0_In855000438)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In855000438, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In855000438, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In855000438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In855000438} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out855000438|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In855000438, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In855000438, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In855000438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In855000438} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:34:13,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:34:13,951 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:34:13,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:34:13,953 INFO L168 Benchmark]: Toolchain (without parser) took 22704.91 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 952.3 MB in the beginning and 1.8 GB in the end (delta: -801.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-28 18:34:13,953 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:34:13,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:13,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:13,954 INFO L168 Benchmark]: Boogie Preprocessor took 40.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:34:13,954 INFO L168 Benchmark]: RCFGBuilder took 783.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:13,955 INFO L168 Benchmark]: TraceAbstraction took 20645.51 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 880.8 MB). Free memory was 1.1 GB in the beginning and 720.6 MB in the end (delta: 334.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-28 18:34:13,955 INFO L168 Benchmark]: Witness Printer took 378.98 ms. Allocated memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 3.7 MB). Free memory was 720.6 MB in the beginning and 1.8 GB in the end (delta: -1.0 GB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:13,958 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.76 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 786.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 783.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20645.51 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 880.8 MB). Free memory was 1.1 GB in the beginning and 720.6 MB in the end (delta: 334.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 378.98 ms. Allocated memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 3.7 MB). Free memory was 720.6 MB in the beginning and 1.8 GB in the end (delta: -1.0 GB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 151 ProgramPointsBefore, 73 ProgramPointsAfterwards, 176 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 20 ChoiceCompositions, 4974 VarBasedMoverChecksPositive, 245 VarBasedMoverChecksNegative, 129 SemBasedMoverChecksPositive, 162 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 63936 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2589, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L816] FCALL, FORK 0 pthread_create(&t2590, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L818] FCALL, FORK 0 pthread_create(&t2591, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.3s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2050 SDtfs, 3288 SDslu, 6005 SDs, 0 SdLazy, 4403 SolverSat, 249 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20292occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 15746 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 107655 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...