/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:02:26,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:02:26,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:02:26,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:02:26,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:02:26,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:02:26,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:02:26,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:02:26,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:02:26,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:02:26,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:02:26,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:02:26,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:02:26,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:02:26,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:02:26,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:02:26,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:02:26,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:02:26,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:02:26,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:02:26,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:02:26,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:02:26,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:02:26,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:02:26,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:02:26,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:02:26,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:02:26,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:02:26,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:02:26,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:02:26,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:02:26,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:02:26,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:02:26,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:02:26,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:02:26,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:02:26,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:02:26,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:02:26,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:02:26,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:02:26,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:02:26,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:02:26,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:02:26,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:02:26,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:02:26,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:02:26,262 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:02:26,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:02:26,262 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:02:26,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:02:26,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:02:26,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:02:26,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:02:26,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:02:26,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:02:26,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:02:26,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:02:26,264 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:02:26,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:02:26,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:02:26,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:02:26,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:02:26,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:02:26,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:02:26,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:02:26,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:02:26,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:02:26,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:02:26,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:02:26,267 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:02:26,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:02:26,267 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:02:26,268 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:02:26,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:02:26,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:02:26,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:02:26,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:02:26,587 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:02:26,588 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2019-12-27 17:02:26,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca8aa72a/47ca9988c05540eb942ed6fdf5cba313/FLAG8aa2e6107 [2019-12-27 17:02:27,219 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:02:27,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2019-12-27 17:02:27,239 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca8aa72a/47ca9988c05540eb942ed6fdf5cba313/FLAG8aa2e6107 [2019-12-27 17:02:27,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca8aa72a/47ca9988c05540eb942ed6fdf5cba313 [2019-12-27 17:02:27,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:02:27,489 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:02:27,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:02:27,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:02:27,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:02:27,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:02:27" (1/1) ... [2019-12-27 17:02:27,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd32435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:27, skipping insertion in model container [2019-12-27 17:02:27,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:02:27" (1/1) ... [2019-12-27 17:02:27,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:02:27,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:02:28,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:02:28,080 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:02:28,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:02:28,219 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:02:28,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:28 WrapperNode [2019-12-27 17:02:28,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:02:28,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:02:28,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:02:28,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:02:28,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:28" (1/1) ... [2019-12-27 17:02:28,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:28" (1/1) ... [2019-12-27 17:02:28,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:02:28,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:02:28,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:02:28,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:02:28,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:28" (1/1) ... [2019-12-27 17:02:28,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:28" (1/1) ... [2019-12-27 17:02:28,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:28" (1/1) ... [2019-12-27 17:02:28,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:28" (1/1) ... [2019-12-27 17:02:28,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:28" (1/1) ... [2019-12-27 17:02:28,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:28" (1/1) ... [2019-12-27 17:02:28,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:28" (1/1) ... [2019-12-27 17:02:28,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:02:28,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:02:28,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:02:28,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:02:28,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:02:28,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:02:28,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:02:28,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:02:28,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:02:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:02:28,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:02:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:02:28,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:02:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:02:28,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:02:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:02:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:02:28,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:02:28,384 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:02:29,170 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:02:29,170 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:02:29,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:02:29 BoogieIcfgContainer [2019-12-27 17:02:29,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:02:29,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:02:29,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:02:29,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:02:29,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:02:27" (1/3) ... [2019-12-27 17:02:29,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2297c72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:02:29, skipping insertion in model container [2019-12-27 17:02:29,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:28" (2/3) ... [2019-12-27 17:02:29,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2297c72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:02:29, skipping insertion in model container [2019-12-27 17:02:29,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:02:29" (3/3) ... [2019-12-27 17:02:29,181 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.oepc.i [2019-12-27 17:02:29,192 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:02:29,192 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:02:29,202 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:02:29,203 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:02:29,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,267 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,267 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,301 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,302 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,345 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,347 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,361 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,361 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,361 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,363 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,363 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:29,384 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:02:29,407 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:02:29,407 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:02:29,407 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:02:29,407 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:02:29,408 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:02:29,408 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:02:29,408 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:02:29,408 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:02:29,423 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 17:02:29,425 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 17:02:29,528 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 17:02:29,528 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:02:29,545 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:02:29,570 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 17:02:29,625 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 17:02:29,625 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:02:29,634 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:02:29,655 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 17:02:29,656 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:02:34,879 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:02:34,982 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:02:35,331 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 17:02:35,458 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 17:02:35,492 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-27 17:02:35,492 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 17:02:35,496 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-27 17:02:49,607 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-27 17:02:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-27 17:02:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:02:49,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:49,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:02:49,615 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:49,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:49,622 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-27 17:02:49,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:49,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261825256] [2019-12-27 17:02:49,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:02:49,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261825256] [2019-12-27 17:02:49,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:49,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:02:49,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1819556673] [2019-12-27 17:02:49,926 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:49,930 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:49,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:02:49,942 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:49,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:49,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:02:49,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:49,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:02:49,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:02:49,963 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-27 17:02:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:50,977 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-27 17:02:50,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:02:50,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:02:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:54,556 INFO L225 Difference]: With dead ends: 101544 [2019-12-27 17:02:54,556 INFO L226 Difference]: Without dead ends: 95304 [2019-12-27 17:02:54,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:02:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-27 17:03:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-27 17:03:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-27 17:03:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-27 17:03:01,051 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-27 17:03:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:01,052 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-27 17:03:01,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-27 17:03:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:03:01,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:01,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:01,056 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:01,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-27 17:03:01,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:01,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322405044] [2019-12-27 17:03:01,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:01,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322405044] [2019-12-27 17:03:01,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:01,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:01,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [581494277] [2019-12-27 17:03:01,188 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:01,190 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:01,193 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:03:01,193 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:01,193 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:01,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:03:01,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:01,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:03:01,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:03:01,196 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-27 17:03:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:06,497 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-27 17:03:06,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:03:06,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:03:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:07,150 INFO L225 Difference]: With dead ends: 152040 [2019-12-27 17:03:07,150 INFO L226 Difference]: Without dead ends: 151991 [2019-12-27 17:03:07,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:10,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-27 17:03:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-27 17:03:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-27 17:03:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-27 17:03:18,156 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-27 17:03:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:18,157 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-27 17:03:18,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:03:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-27 17:03:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:03:18,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:18,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:18,165 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:18,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-27 17:03:18,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:18,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926419736] [2019-12-27 17:03:18,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:18,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926419736] [2019-12-27 17:03:18,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:18,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:18,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [595989243] [2019-12-27 17:03:18,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:18,234 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:18,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:03:18,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:18,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:18,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:18,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:18,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:18,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:18,237 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-27 17:03:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:18,367 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-27 17:03:18,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:18,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:03:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:18,444 INFO L225 Difference]: With dead ends: 30915 [2019-12-27 17:03:18,444 INFO L226 Difference]: Without dead ends: 30915 [2019-12-27 17:03:18,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-27 17:03:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-27 17:03:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-27 17:03:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-27 17:03:19,115 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-27 17:03:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:19,115 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-27 17:03:19,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-27 17:03:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:03:19,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:19,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:19,119 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:19,119 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-27 17:03:19,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:19,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794971245] [2019-12-27 17:03:19,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:19,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794971245] [2019-12-27 17:03:19,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:19,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:19,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1670130965] [2019-12-27 17:03:19,206 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:19,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:19,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:03:19,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:19,212 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:19,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:03:19,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:19,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:03:19,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:03:19,214 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-27 17:03:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:19,578 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-27 17:03:19,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:03:19,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:03:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:20,825 INFO L225 Difference]: With dead ends: 38538 [2019-12-27 17:03:20,826 INFO L226 Difference]: Without dead ends: 38538 [2019-12-27 17:03:20,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-27 17:03:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-27 17:03:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-27 17:03:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-27 17:03:21,494 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-27 17:03:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:21,495 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-27 17:03:21,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:03:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-27 17:03:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:03:21,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:21,504 INFO L411 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] [2019-12-27 17:03:21,504 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:21,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:21,505 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-27 17:03:21,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:21,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749401581] [2019-12-27 17:03:21,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:21,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749401581] [2019-12-27 17:03:21,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:21,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:21,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331367960] [2019-12-27 17:03:21,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:21,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:21,608 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 17:03:21,608 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:21,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:03:21,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:03:21,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:21,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:03:21,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:03:21,728 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 7 states. [2019-12-27 17:03:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:22,835 INFO L93 Difference]: Finished difference Result 52978 states and 168667 transitions. [2019-12-27 17:03:22,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:03:22,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 17:03:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:22,926 INFO L225 Difference]: With dead ends: 52978 [2019-12-27 17:03:22,926 INFO L226 Difference]: Without dead ends: 52971 [2019-12-27 17:03:22,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:03:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52971 states. [2019-12-27 17:03:23,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52971 to 34062. [2019-12-27 17:03:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-27 17:03:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-27 17:03:23,645 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-27 17:03:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:23,646 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-27 17:03:23,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:03:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-27 17:03:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:03:23,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:23,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:23,658 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:23,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-27 17:03:23,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:23,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793680458] [2019-12-27 17:03:23,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:25,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793680458] [2019-12-27 17:03:25,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:25,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:25,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1477236564] [2019-12-27 17:03:25,202 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:25,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:25,215 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 17:03:25,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:25,231 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:03:25,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:03:25,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:25,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:03:25,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:25,233 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 5 states. [2019-12-27 17:03:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:25,307 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-27 17:03:25,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:03:25,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:03:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:25,328 INFO L225 Difference]: With dead ends: 13768 [2019-12-27 17:03:25,328 INFO L226 Difference]: Without dead ends: 13768 [2019-12-27 17:03:25,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:25,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-27 17:03:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-27 17:03:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-27 17:03:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-27 17:03:25,527 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-27 17:03:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:25,528 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-27 17:03:25,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:03:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-27 17:03:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:03:25,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:25,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:25,538 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-27 17:03:25,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:25,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92853809] [2019-12-27 17:03:25,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:25,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92853809] [2019-12-27 17:03:25,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:25,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:25,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2026639543] [2019-12-27 17:03:25,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:25,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:25,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:03:25,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:25,600 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:25,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:25,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:25,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:25,601 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-27 17:03:25,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:25,692 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-27 17:03:25,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:25,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 17:03:25,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:25,718 INFO L225 Difference]: With dead ends: 19309 [2019-12-27 17:03:25,718 INFO L226 Difference]: Without dead ends: 19309 [2019-12-27 17:03:25,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:25,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-27 17:03:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-27 17:03:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-27 17:03:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-27 17:03:25,950 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-27 17:03:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:25,950 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-27 17:03:25,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-27 17:03:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:03:25,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:25,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:25,960 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:25,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:25,960 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-27 17:03:25,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:25,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012867434] [2019-12-27 17:03:25,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:26,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012867434] [2019-12-27 17:03:26,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:26,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:26,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1115557607] [2019-12-27 17:03:26,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:26,019 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:26,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:03:26,026 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:26,027 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:26,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:26,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:26,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:26,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:26,028 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-27 17:03:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:26,138 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-27 17:03:26,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:26,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 17:03:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:26,176 INFO L225 Difference]: With dead ends: 21037 [2019-12-27 17:03:26,176 INFO L226 Difference]: Without dead ends: 21037 [2019-12-27 17:03:26,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-27 17:03:26,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-27 17:03:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-27 17:03:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-27 17:03:26,467 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-27 17:03:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:26,467 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-27 17:03:26,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-27 17:03:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:03:26,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:26,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:26,480 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:26,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:26,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-27 17:03:26,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:26,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454592283] [2019-12-27 17:03:26,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:26,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454592283] [2019-12-27 17:03:26,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:26,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:03:26,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [201856061] [2019-12-27 17:03:26,574 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:26,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:26,585 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:03:26,586 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:26,586 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:26,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:03:26,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:03:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:03:26,587 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-27 17:03:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:27,192 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-27 17:03:27,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:03:27,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:03:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:27,235 INFO L225 Difference]: With dead ends: 29609 [2019-12-27 17:03:27,235 INFO L226 Difference]: Without dead ends: 29609 [2019-12-27 17:03:27,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-27 17:03:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-27 17:03:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-27 17:03:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-27 17:03:27,578 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-27 17:03:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:27,578 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-27 17:03:27,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:03:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-27 17:03:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 17:03:27,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:27,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:27,592 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:27,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:27,592 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-27 17:03:27,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:27,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267799771] [2019-12-27 17:03:27,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:27,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267799771] [2019-12-27 17:03:27,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:27,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:03:27,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [833129466] [2019-12-27 17:03:27,687 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:27,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:27,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 17:03:27,701 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:27,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:27,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:03:27,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:27,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:03:27,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:03:27,702 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-27 17:03:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:28,348 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-27 17:03:28,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:03:28,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 17:03:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:28,390 INFO L225 Difference]: With dead ends: 28968 [2019-12-27 17:03:28,390 INFO L226 Difference]: Without dead ends: 28968 [2019-12-27 17:03:28,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-27 17:03:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-27 17:03:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-27 17:03:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-27 17:03:28,836 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-27 17:03:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:28,836 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-27 17:03:28,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:03:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-27 17:03:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:03:28,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:28,854 INFO L411 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] [2019-12-27 17:03:28,854 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:28,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:28,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-27 17:03:28,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:28,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481159288] [2019-12-27 17:03:28,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:28,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481159288] [2019-12-27 17:03:28,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:28,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:03:28,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [633065591] [2019-12-27 17:03:28,966 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:28,972 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:28,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 17:03:28,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:29,081 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:03:29,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:03:29,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:29,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:03:29,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:29,082 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 9 states. [2019-12-27 17:03:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:31,310 INFO L93 Difference]: Finished difference Result 52157 states and 153796 transitions. [2019-12-27 17:03:31,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:03:31,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 17:03:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:31,389 INFO L225 Difference]: With dead ends: 52157 [2019-12-27 17:03:31,389 INFO L226 Difference]: Without dead ends: 52157 [2019-12-27 17:03:31,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:03:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52157 states. [2019-12-27 17:03:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52157 to 20337. [2019-12-27 17:03:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20337 states. [2019-12-27 17:03:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20337 states to 20337 states and 60571 transitions. [2019-12-27 17:03:31,921 INFO L78 Accepts]: Start accepts. Automaton has 20337 states and 60571 transitions. Word has length 33 [2019-12-27 17:03:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:31,922 INFO L462 AbstractCegarLoop]: Abstraction has 20337 states and 60571 transitions. [2019-12-27 17:03:31,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:03:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 20337 states and 60571 transitions. [2019-12-27 17:03:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:03:31,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:31,943 INFO L411 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] [2019-12-27 17:03:31,943 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:31,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:31,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-27 17:03:31,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:31,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220346029] [2019-12-27 17:03:31,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:32,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220346029] [2019-12-27 17:03:32,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:32,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:03:32,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [904046490] [2019-12-27 17:03:32,068 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:32,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:32,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 17:03:32,091 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:32,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:03:32,119 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:03:32,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:03:32,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:03:32,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:32,120 INFO L87 Difference]: Start difference. First operand 20337 states and 60571 transitions. Second operand 9 states. [2019-12-27 17:03:35,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:35,116 INFO L93 Difference]: Finished difference Result 61814 states and 179044 transitions. [2019-12-27 17:03:35,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 17:03:35,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 17:03:35,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:35,212 INFO L225 Difference]: With dead ends: 61814 [2019-12-27 17:03:35,212 INFO L226 Difference]: Without dead ends: 61814 [2019-12-27 17:03:35,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 17:03:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61814 states. [2019-12-27 17:03:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61814 to 22796. [2019-12-27 17:03:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22796 states. [2019-12-27 17:03:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22796 states to 22796 states and 67944 transitions. [2019-12-27 17:03:35,801 INFO L78 Accepts]: Start accepts. Automaton has 22796 states and 67944 transitions. Word has length 33 [2019-12-27 17:03:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:35,801 INFO L462 AbstractCegarLoop]: Abstraction has 22796 states and 67944 transitions. [2019-12-27 17:03:35,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:03:35,802 INFO L276 IsEmpty]: Start isEmpty. Operand 22796 states and 67944 transitions. [2019-12-27 17:03:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 17:03:35,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:35,822 INFO L411 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] [2019-12-27 17:03:35,822 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:35,822 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-27 17:03:35,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:35,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756242669] [2019-12-27 17:03:35,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:35,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756242669] [2019-12-27 17:03:35,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:35,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:03:35,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1453175963] [2019-12-27 17:03:35,949 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:35,955 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:35,966 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 17:03:35,966 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:36,049 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:03:36,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:03:36,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:36,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:03:36,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:36,051 INFO L87 Difference]: Start difference. First operand 22796 states and 67944 transitions. Second operand 9 states. [2019-12-27 17:03:38,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:38,269 INFO L93 Difference]: Finished difference Result 47036 states and 138916 transitions. [2019-12-27 17:03:38,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:03:38,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 17:03:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:38,335 INFO L225 Difference]: With dead ends: 47036 [2019-12-27 17:03:38,335 INFO L226 Difference]: Without dead ends: 47036 [2019-12-27 17:03:38,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:03:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47036 states. [2019-12-27 17:03:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47036 to 21660. [2019-12-27 17:03:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21660 states. [2019-12-27 17:03:38,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21660 states to 21660 states and 64627 transitions. [2019-12-27 17:03:38,829 INFO L78 Accepts]: Start accepts. Automaton has 21660 states and 64627 transitions. Word has length 34 [2019-12-27 17:03:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:38,830 INFO L462 AbstractCegarLoop]: Abstraction has 21660 states and 64627 transitions. [2019-12-27 17:03:38,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:03:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 21660 states and 64627 transitions. [2019-12-27 17:03:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 17:03:38,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:38,848 INFO L411 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] [2019-12-27 17:03:38,848 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:38,848 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-27 17:03:38,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:38,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361273809] [2019-12-27 17:03:38,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:38,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361273809] [2019-12-27 17:03:38,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:38,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:03:38,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [973712658] [2019-12-27 17:03:38,996 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:39,003 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:39,018 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 56 transitions. [2019-12-27 17:03:39,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:39,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:03:39,040 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:03:39,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:03:39,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:39,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:03:39,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:39,041 INFO L87 Difference]: Start difference. First operand 21660 states and 64627 transitions. Second operand 9 states. [2019-12-27 17:03:40,773 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-12-27 17:03:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:41,531 INFO L93 Difference]: Finished difference Result 52988 states and 153444 transitions. [2019-12-27 17:03:41,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 17:03:41,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 17:03:41,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:41,618 INFO L225 Difference]: With dead ends: 52988 [2019-12-27 17:03:41,619 INFO L226 Difference]: Without dead ends: 52988 [2019-12-27 17:03:41,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:03:41,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52988 states. [2019-12-27 17:03:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52988 to 23300. [2019-12-27 17:03:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23300 states. [2019-12-27 17:03:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23300 states to 23300 states and 69486 transitions. [2019-12-27 17:03:42,163 INFO L78 Accepts]: Start accepts. Automaton has 23300 states and 69486 transitions. Word has length 34 [2019-12-27 17:03:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:42,163 INFO L462 AbstractCegarLoop]: Abstraction has 23300 states and 69486 transitions. [2019-12-27 17:03:42,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:03:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand 23300 states and 69486 transitions. [2019-12-27 17:03:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 17:03:42,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:42,188 INFO L411 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] [2019-12-27 17:03:42,188 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:42,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:42,189 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-27 17:03:42,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:42,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977652421] [2019-12-27 17:03:42,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:42,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977652421] [2019-12-27 17:03:42,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:42,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:03:42,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1875617168] [2019-12-27 17:03:42,334 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:42,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:42,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 68 transitions. [2019-12-27 17:03:42,358 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:42,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:03:42,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:03:42,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:03:42,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:03:42,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:03:42,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:42,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:03:42,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:03:42,392 INFO L87 Difference]: Start difference. First operand 23300 states and 69486 transitions. Second operand 10 states. [2019-12-27 17:03:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:45,264 INFO L93 Difference]: Finished difference Result 51234 states and 148885 transitions. [2019-12-27 17:03:45,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 17:03:45,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-27 17:03:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:45,348 INFO L225 Difference]: With dead ends: 51234 [2019-12-27 17:03:45,348 INFO L226 Difference]: Without dead ends: 51234 [2019-12-27 17:03:45,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 17:03:45,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51234 states. [2019-12-27 17:03:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51234 to 21075. [2019-12-27 17:03:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21075 states. [2019-12-27 17:03:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21075 states to 21075 states and 62908 transitions. [2019-12-27 17:03:45,854 INFO L78 Accepts]: Start accepts. Automaton has 21075 states and 62908 transitions. Word has length 34 [2019-12-27 17:03:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:45,854 INFO L462 AbstractCegarLoop]: Abstraction has 21075 states and 62908 transitions. [2019-12-27 17:03:45,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:03:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 21075 states and 62908 transitions. [2019-12-27 17:03:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:03:45,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:45,878 INFO L411 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] [2019-12-27 17:03:45,878 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:45,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:45,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1053586821, now seen corresponding path program 1 times [2019-12-27 17:03:45,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:45,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161062646] [2019-12-27 17:03:45,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:45,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161062646] [2019-12-27 17:03:45,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:45,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:03:45,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281488563] [2019-12-27 17:03:45,938 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:45,948 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:46,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 17:03:46,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:46,010 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:46,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:46,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:46,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:46,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:46,011 INFO L87 Difference]: Start difference. First operand 21075 states and 62908 transitions. Second operand 3 states. [2019-12-27 17:03:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:46,092 INFO L93 Difference]: Finished difference Result 21074 states and 62906 transitions. [2019-12-27 17:03:46,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:46,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 17:03:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:46,129 INFO L225 Difference]: With dead ends: 21074 [2019-12-27 17:03:46,129 INFO L226 Difference]: Without dead ends: 21074 [2019-12-27 17:03:46,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21074 states. [2019-12-27 17:03:46,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21074 to 21074. [2019-12-27 17:03:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21074 states. [2019-12-27 17:03:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21074 states to 21074 states and 62906 transitions. [2019-12-27 17:03:46,548 INFO L78 Accepts]: Start accepts. Automaton has 21074 states and 62906 transitions. Word has length 39 [2019-12-27 17:03:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:46,548 INFO L462 AbstractCegarLoop]: Abstraction has 21074 states and 62906 transitions. [2019-12-27 17:03:46,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 21074 states and 62906 transitions. [2019-12-27 17:03:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 17:03:46,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:46,567 INFO L411 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] [2019-12-27 17:03:46,567 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:46,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:46,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 1 times [2019-12-27 17:03:46,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:46,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079262531] [2019-12-27 17:03:46,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:46,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079262531] [2019-12-27 17:03:46,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:46,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:03:46,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [786615361] [2019-12-27 17:03:46,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:46,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:46,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 17:03:46,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:46,760 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:03:46,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:03:46,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:46,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:03:46,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:03:46,761 INFO L87 Difference]: Start difference. First operand 21074 states and 62906 transitions. Second operand 7 states. [2019-12-27 17:03:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:46,890 INFO L93 Difference]: Finished difference Result 19829 states and 60059 transitions. [2019-12-27 17:03:46,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:03:46,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 17:03:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:46,932 INFO L225 Difference]: With dead ends: 19829 [2019-12-27 17:03:46,932 INFO L226 Difference]: Without dead ends: 19829 [2019-12-27 17:03:46,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:03:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19829 states. [2019-12-27 17:03:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19829 to 17213. [2019-12-27 17:03:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17213 states. [2019-12-27 17:03:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17213 states to 17213 states and 52783 transitions. [2019-12-27 17:03:47,367 INFO L78 Accepts]: Start accepts. Automaton has 17213 states and 52783 transitions. Word has length 40 [2019-12-27 17:03:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:47,367 INFO L462 AbstractCegarLoop]: Abstraction has 17213 states and 52783 transitions. [2019-12-27 17:03:47,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:03:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 17213 states and 52783 transitions. [2019-12-27 17:03:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:03:47,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:47,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:47,393 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:47,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:47,393 INFO L82 PathProgramCache]: Analyzing trace with hash 914424357, now seen corresponding path program 1 times [2019-12-27 17:03:47,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:47,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133051344] [2019-12-27 17:03:47,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:47,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133051344] [2019-12-27 17:03:47,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:47,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:03:47,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1509272956] [2019-12-27 17:03:47,525 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:47,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:47,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 458 transitions. [2019-12-27 17:03:47,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:47,848 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 17:03:47,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:03:47,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:47,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:03:47,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:03:47,849 INFO L87 Difference]: Start difference. First operand 17213 states and 52783 transitions. Second operand 11 states. [2019-12-27 17:03:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:52,201 INFO L93 Difference]: Finished difference Result 155513 states and 462917 transitions. [2019-12-27 17:03:52,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 17:03:52,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 17:03:52,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:52,374 INFO L225 Difference]: With dead ends: 155513 [2019-12-27 17:03:52,374 INFO L226 Difference]: Without dead ends: 116263 [2019-12-27 17:03:52,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=890, Invalid=3666, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 17:03:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116263 states. [2019-12-27 17:03:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116263 to 21172. [2019-12-27 17:03:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21172 states. [2019-12-27 17:03:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21172 states to 21172 states and 65402 transitions. [2019-12-27 17:03:53,291 INFO L78 Accepts]: Start accepts. Automaton has 21172 states and 65402 transitions. Word has length 64 [2019-12-27 17:03:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:53,291 INFO L462 AbstractCegarLoop]: Abstraction has 21172 states and 65402 transitions. [2019-12-27 17:03:53,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:03:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 21172 states and 65402 transitions. [2019-12-27 17:03:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:03:53,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:53,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:53,311 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:53,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:53,312 INFO L82 PathProgramCache]: Analyzing trace with hash -466762747, now seen corresponding path program 2 times [2019-12-27 17:03:53,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:53,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128922698] [2019-12-27 17:03:53,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:53,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128922698] [2019-12-27 17:03:53,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:53,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:03:53,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [648837020] [2019-12-27 17:03:53,410 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:53,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:53,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 337 transitions. [2019-12-27 17:03:53,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:53,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:03:53,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:03:53,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:53,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:03:53,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:03:53,669 INFO L87 Difference]: Start difference. First operand 21172 states and 65402 transitions. Second operand 8 states. [2019-12-27 17:03:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:55,541 INFO L93 Difference]: Finished difference Result 79688 states and 237149 transitions. [2019-12-27 17:03:55,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:03:55,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 17:03:55,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:55,629 INFO L225 Difference]: With dead ends: 79688 [2019-12-27 17:03:55,629 INFO L226 Difference]: Without dead ends: 60429 [2019-12-27 17:03:55,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:03:55,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60429 states. [2019-12-27 17:03:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60429 to 25181. [2019-12-27 17:03:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25181 states. [2019-12-27 17:03:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25181 states to 25181 states and 77173 transitions. [2019-12-27 17:03:56,485 INFO L78 Accepts]: Start accepts. Automaton has 25181 states and 77173 transitions. Word has length 64 [2019-12-27 17:03:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:56,485 INFO L462 AbstractCegarLoop]: Abstraction has 25181 states and 77173 transitions. [2019-12-27 17:03:56,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:03:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 25181 states and 77173 transitions. [2019-12-27 17:03:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:03:56,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:56,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:56,510 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:56,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:56,511 INFO L82 PathProgramCache]: Analyzing trace with hash 849472763, now seen corresponding path program 3 times [2019-12-27 17:03:56,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:56,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972680815] [2019-12-27 17:03:56,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:56,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972680815] [2019-12-27 17:03:56,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:56,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:03:56,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1388915017] [2019-12-27 17:03:56,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:56,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:56,871 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 377 transitions. [2019-12-27 17:03:56,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:56,995 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:03:56,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:03:56,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:56,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:03:56,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:03:56,997 INFO L87 Difference]: Start difference. First operand 25181 states and 77173 transitions. Second operand 11 states. [2019-12-27 17:03:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:58,999 INFO L93 Difference]: Finished difference Result 61426 states and 184930 transitions. [2019-12-27 17:03:59,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:03:59,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 17:03:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:59,081 INFO L225 Difference]: With dead ends: 61426 [2019-12-27 17:03:59,081 INFO L226 Difference]: Without dead ends: 52976 [2019-12-27 17:03:59,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:03:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52976 states. [2019-12-27 17:03:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52976 to 25485. [2019-12-27 17:03:59,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25485 states. [2019-12-27 17:03:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25485 states to 25485 states and 78087 transitions. [2019-12-27 17:03:59,707 INFO L78 Accepts]: Start accepts. Automaton has 25485 states and 78087 transitions. Word has length 64 [2019-12-27 17:03:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:59,707 INFO L462 AbstractCegarLoop]: Abstraction has 25485 states and 78087 transitions. [2019-12-27 17:03:59,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:03:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 25485 states and 78087 transitions. [2019-12-27 17:03:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:03:59,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:59,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:59,736 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:59,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1624619189, now seen corresponding path program 4 times [2019-12-27 17:03:59,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:59,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977042334] [2019-12-27 17:03:59,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:59,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977042334] [2019-12-27 17:03:59,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:59,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:59,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1315649422] [2019-12-27 17:03:59,805 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:59,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:00,059 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 339 transitions. [2019-12-27 17:04:00,060 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:00,062 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:04:00,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:00,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:00,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:00,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:00,063 INFO L87 Difference]: Start difference. First operand 25485 states and 78087 transitions. Second operand 3 states. [2019-12-27 17:04:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:00,296 INFO L93 Difference]: Finished difference Result 29412 states and 89995 transitions. [2019-12-27 17:04:00,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:00,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 17:04:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:00,367 INFO L225 Difference]: With dead ends: 29412 [2019-12-27 17:04:00,367 INFO L226 Difference]: Without dead ends: 29412 [2019-12-27 17:04:00,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:00,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29412 states. [2019-12-27 17:04:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29412 to 26244. [2019-12-27 17:04:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26244 states. [2019-12-27 17:04:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26244 states to 26244 states and 80632 transitions. [2019-12-27 17:04:01,181 INFO L78 Accepts]: Start accepts. Automaton has 26244 states and 80632 transitions. Word has length 64 [2019-12-27 17:04:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:01,182 INFO L462 AbstractCegarLoop]: Abstraction has 26244 states and 80632 transitions. [2019-12-27 17:04:01,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:01,182 INFO L276 IsEmpty]: Start isEmpty. Operand 26244 states and 80632 transitions. [2019-12-27 17:04:01,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:01,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:01,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:01,221 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:01,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:01,221 INFO L82 PathProgramCache]: Analyzing trace with hash -998961960, now seen corresponding path program 1 times [2019-12-27 17:04:01,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:01,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758675051] [2019-12-27 17:04:01,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:01,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758675051] [2019-12-27 17:04:01,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:01,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:04:01,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1676966382] [2019-12-27 17:04:01,279 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:01,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:01,579 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 412 transitions. [2019-12-27 17:04:01,580 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:01,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:04:01,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:04:01,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:01,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:04:01,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:04:01,593 INFO L87 Difference]: Start difference. First operand 26244 states and 80632 transitions. Second operand 5 states. [2019-12-27 17:04:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:02,122 INFO L93 Difference]: Finished difference Result 48707 states and 149353 transitions. [2019-12-27 17:04:02,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:04:02,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 17:04:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:02,202 INFO L225 Difference]: With dead ends: 48707 [2019-12-27 17:04:02,202 INFO L226 Difference]: Without dead ends: 48707 [2019-12-27 17:04:02,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:04:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48707 states. [2019-12-27 17:04:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48707 to 28497. [2019-12-27 17:04:02,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28497 states. [2019-12-27 17:04:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28497 states to 28497 states and 88042 transitions. [2019-12-27 17:04:02,820 INFO L78 Accepts]: Start accepts. Automaton has 28497 states and 88042 transitions. Word has length 65 [2019-12-27 17:04:02,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:02,820 INFO L462 AbstractCegarLoop]: Abstraction has 28497 states and 88042 transitions. [2019-12-27 17:04:02,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:04:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 28497 states and 88042 transitions. [2019-12-27 17:04:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:02,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:02,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:02,854 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash 8687464, now seen corresponding path program 2 times [2019-12-27 17:04:02,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:02,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097721473] [2019-12-27 17:04:02,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:02,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097721473] [2019-12-27 17:04:02,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:02,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:04:02,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1487172282] [2019-12-27 17:04:02,908 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:02,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:03,235 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 392 transitions. [2019-12-27 17:04:03,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:03,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:04:03,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:03,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:03,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:03,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:03,240 INFO L87 Difference]: Start difference. First operand 28497 states and 88042 transitions. Second operand 3 states. [2019-12-27 17:04:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:03,561 INFO L93 Difference]: Finished difference Result 38026 states and 117533 transitions. [2019-12-27 17:04:03,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:03,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:04:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:03,652 INFO L225 Difference]: With dead ends: 38026 [2019-12-27 17:04:03,652 INFO L226 Difference]: Without dead ends: 38026 [2019-12-27 17:04:03,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38026 states. [2019-12-27 17:04:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38026 to 28886. [2019-12-27 17:04:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28886 states. [2019-12-27 17:04:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28886 states to 28886 states and 89251 transitions. [2019-12-27 17:04:04,376 INFO L78 Accepts]: Start accepts. Automaton has 28886 states and 89251 transitions. Word has length 65 [2019-12-27 17:04:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:04,376 INFO L462 AbstractCegarLoop]: Abstraction has 28886 states and 89251 transitions. [2019-12-27 17:04:04,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 28886 states and 89251 transitions. [2019-12-27 17:04:04,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:04,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:04,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:04,405 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:04,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:04,405 INFO L82 PathProgramCache]: Analyzing trace with hash 405134954, now seen corresponding path program 1 times [2019-12-27 17:04:04,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:04,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643953669] [2019-12-27 17:04:04,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:04,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643953669] [2019-12-27 17:04:04,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:04,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:04:04,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1626799787] [2019-12-27 17:04:04,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:04,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:04,731 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 392 transitions. [2019-12-27 17:04:04,732 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:04,844 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 17:04:04,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:04:04,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:04,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:04:04,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:04:04,845 INFO L87 Difference]: Start difference. First operand 28886 states and 89251 transitions. Second operand 11 states. [2019-12-27 17:04:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:07,881 INFO L93 Difference]: Finished difference Result 118050 states and 351135 transitions. [2019-12-27 17:04:07,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 17:04:07,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 17:04:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:08,071 INFO L225 Difference]: With dead ends: 118050 [2019-12-27 17:04:08,071 INFO L226 Difference]: Without dead ends: 110348 [2019-12-27 17:04:08,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=455, Invalid=1525, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 17:04:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110348 states. [2019-12-27 17:04:09,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110348 to 28546. [2019-12-27 17:04:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28546 states. [2019-12-27 17:04:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28546 states to 28546 states and 87940 transitions. [2019-12-27 17:04:09,192 INFO L78 Accepts]: Start accepts. Automaton has 28546 states and 87940 transitions. Word has length 65 [2019-12-27 17:04:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:09,192 INFO L462 AbstractCegarLoop]: Abstraction has 28546 states and 87940 transitions. [2019-12-27 17:04:09,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:04:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 28546 states and 87940 transitions. [2019-12-27 17:04:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:09,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:09,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:09,225 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash 32225569, now seen corresponding path program 1 times [2019-12-27 17:04:09,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:09,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528877627] [2019-12-27 17:04:09,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:09,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528877627] [2019-12-27 17:04:09,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:09,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:04:09,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [184485736] [2019-12-27 17:04:09,314 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:09,473 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:09,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 319 transitions. [2019-12-27 17:04:09,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:09,689 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:04:09,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:04:09,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:09,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:04:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:04:09,690 INFO L87 Difference]: Start difference. First operand 28546 states and 87940 transitions. Second operand 7 states. [2019-12-27 17:04:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:10,596 INFO L93 Difference]: Finished difference Result 43253 states and 130066 transitions. [2019-12-27 17:04:10,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:04:10,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 17:04:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:10,658 INFO L225 Difference]: With dead ends: 43253 [2019-12-27 17:04:10,658 INFO L226 Difference]: Without dead ends: 43033 [2019-12-27 17:04:10,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:04:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43033 states. [2019-12-27 17:04:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43033 to 34867. [2019-12-27 17:04:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34867 states. [2019-12-27 17:04:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34867 states to 34867 states and 106157 transitions. [2019-12-27 17:04:11,233 INFO L78 Accepts]: Start accepts. Automaton has 34867 states and 106157 transitions. Word has length 65 [2019-12-27 17:04:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:11,233 INFO L462 AbstractCegarLoop]: Abstraction has 34867 states and 106157 transitions. [2019-12-27 17:04:11,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:04:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 34867 states and 106157 transitions. [2019-12-27 17:04:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:11,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:11,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:11,272 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:11,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:11,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1958685575, now seen corresponding path program 2 times [2019-12-27 17:04:11,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:11,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128210023] [2019-12-27 17:04:11,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:11,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128210023] [2019-12-27 17:04:11,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:11,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:04:11,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1009353658] [2019-12-27 17:04:11,328 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:11,347 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:11,496 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 337 transitions. [2019-12-27 17:04:11,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:11,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:11,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:11,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:11,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:11,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:11,498 INFO L87 Difference]: Start difference. First operand 34867 states and 106157 transitions. Second operand 3 states. [2019-12-27 17:04:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:11,598 INFO L93 Difference]: Finished difference Result 34867 states and 106156 transitions. [2019-12-27 17:04:11,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:11,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:04:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:11,650 INFO L225 Difference]: With dead ends: 34867 [2019-12-27 17:04:11,650 INFO L226 Difference]: Without dead ends: 34867 [2019-12-27 17:04:11,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34867 states. [2019-12-27 17:04:12,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34867 to 29322. [2019-12-27 17:04:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29322 states. [2019-12-27 17:04:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29322 states to 29322 states and 90601 transitions. [2019-12-27 17:04:12,155 INFO L78 Accepts]: Start accepts. Automaton has 29322 states and 90601 transitions. Word has length 65 [2019-12-27 17:04:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:12,156 INFO L462 AbstractCegarLoop]: Abstraction has 29322 states and 90601 transitions. [2019-12-27 17:04:12,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 29322 states and 90601 transitions. [2019-12-27 17:04:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:04:12,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:12,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:12,188 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:12,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:12,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1650156242, now seen corresponding path program 1 times [2019-12-27 17:04:12,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:12,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229996400] [2019-12-27 17:04:12,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:12,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229996400] [2019-12-27 17:04:12,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:12,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:04:12,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [675547085] [2019-12-27 17:04:12,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:12,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:12,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 183 states and 305 transitions. [2019-12-27 17:04:12,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:12,672 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:12,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:12,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:12,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:12,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:12,673 INFO L87 Difference]: Start difference. First operand 29322 states and 90601 transitions. Second operand 3 states. [2019-12-27 17:04:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:12,748 INFO L93 Difference]: Finished difference Result 23783 states and 72437 transitions. [2019-12-27 17:04:12,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:12,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 17:04:12,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:12,780 INFO L225 Difference]: With dead ends: 23783 [2019-12-27 17:04:12,781 INFO L226 Difference]: Without dead ends: 23783 [2019-12-27 17:04:12,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23783 states. [2019-12-27 17:04:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23783 to 21743. [2019-12-27 17:04:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21743 states. [2019-12-27 17:04:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21743 states to 21743 states and 66245 transitions. [2019-12-27 17:04:13,112 INFO L78 Accepts]: Start accepts. Automaton has 21743 states and 66245 transitions. Word has length 66 [2019-12-27 17:04:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:13,112 INFO L462 AbstractCegarLoop]: Abstraction has 21743 states and 66245 transitions. [2019-12-27 17:04:13,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 21743 states and 66245 transitions. [2019-12-27 17:04:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:04:13,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:13,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:13,133 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:13,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash 176666880, now seen corresponding path program 1 times [2019-12-27 17:04:13,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:13,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126257088] [2019-12-27 17:04:13,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:13,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126257088] [2019-12-27 17:04:13,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:13,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:04:13,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1237783045] [2019-12-27 17:04:13,196 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:13,218 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:13,426 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 368 transitions. [2019-12-27 17:04:13,426 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:13,427 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:04:13,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:04:13,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:13,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:04:13,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:04:13,428 INFO L87 Difference]: Start difference. First operand 21743 states and 66245 transitions. Second operand 4 states. [2019-12-27 17:04:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:13,546 INFO L93 Difference]: Finished difference Result 21555 states and 65483 transitions. [2019-12-27 17:04:13,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:04:13,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 17:04:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:13,575 INFO L225 Difference]: With dead ends: 21555 [2019-12-27 17:04:13,575 INFO L226 Difference]: Without dead ends: 21555 [2019-12-27 17:04:13,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:04:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21555 states. [2019-12-27 17:04:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21555 to 18577. [2019-12-27 17:04:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18577 states. [2019-12-27 17:04:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18577 states to 18577 states and 55984 transitions. [2019-12-27 17:04:13,870 INFO L78 Accepts]: Start accepts. Automaton has 18577 states and 55984 transitions. Word has length 67 [2019-12-27 17:04:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:13,871 INFO L462 AbstractCegarLoop]: Abstraction has 18577 states and 55984 transitions. [2019-12-27 17:04:13,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:04:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 18577 states and 55984 transitions. [2019-12-27 17:04:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:04:13,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:13,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:04:13,889 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:13,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-27 17:04:13,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:13,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809597414] [2019-12-27 17:04:13,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:04:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:04:14,016 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:04:14,016 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:04:14,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_93| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$r_buff1_thd3~0_279 0) (= v_~a$flush_delayed~0_36 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$mem_tmp~0_25 0) (= v_~a$r_buff0_thd3~0_364 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_55| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_55|) |v_ULTIMATE.start_main_~#t1111~0.offset_34| 0))) (= v_~__unbuffered_p2_EBX~0_67 0) (= v_~y~0_75 0) (= v_~a~0_169 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard1~0_56 0) (= 0 |v_ULTIMATE.start_main_~#t1111~0.offset_34|) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1111~0.base_55|) (= 0 |v_#NULL.base_4|) (= 0 v_~a$w_buff1_used~0_506) (= 0 v_~__unbuffered_p2_EAX~0_61) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1111~0.base_55| 4) |v_#length_25|) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_55|)) (= 0 v_~__unbuffered_p0_EAX~0_116) (= v_~z~0_20 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~x~0_91 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_55| 1) |v_#valid_91|) (= v_~weak$$choice2~0_114 0) (= v_~a$r_buff1_thd0~0_166 0) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_41|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_169, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_67, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_166, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_91, ULTIMATE.start_main_~#t1111~0.base=|v_ULTIMATE.start_main_~#t1111~0.base_55|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ~a$mem_tmp~0=v_~a$mem_tmp~0_25, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_20|, ~y~0=v_~y~0_75, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_19|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_28|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t1111~0.offset=|v_ULTIMATE.start_main_~#t1111~0.offset_34|, ~a$flush_delayed~0=v_~a$flush_delayed~0_36, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1112~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1111~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t1113~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t1112~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1113~0.base, #NULL.base, ULTIMATE.start_main_~#t1111~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 17:04:14,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff1_thd0~0_Out2117596950 ~a$r_buff0_thd0~0_In2117596950) (= ~a$r_buff0_thd1~0_Out2117596950 1) (= ~a$r_buff1_thd3~0_Out2117596950 ~a$r_buff0_thd3~0_In2117596950) (= ~a$r_buff0_thd2~0_In2117596950 ~a$r_buff1_thd2~0_Out2117596950) (= ~__unbuffered_p0_EAX~0_Out2117596950 ~x~0_In2117596950) (= ~a$r_buff0_thd1~0_In2117596950 ~a$r_buff1_thd1~0_Out2117596950) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2117596950))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2117596950, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2117596950, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2117596950, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2117596950, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2117596950, ~x~0=~x~0_In2117596950} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out2117596950, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out2117596950, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out2117596950, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out2117596950, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out2117596950, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2117596950, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2117596950, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2117596950, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2117596950, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2117596950, ~x~0=~x~0_In2117596950} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:04:14,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9|) |v_ULTIMATE.start_main_~#t1112~0.offset_7| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1112~0.offset_7|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1112~0.base_9| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1112~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1112~0.base_9|)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_9|, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_7|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1112~0.base, ULTIMATE.start_main_~#t1112~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 17:04:14,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) |v_ULTIMATE.start_main_~#t1113~0.offset_8| 2))) (= |v_ULTIMATE.start_main_~#t1113~0.offset_8| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1113~0.base_9| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1113~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1113~0.base] because there is no mapped edge [2019-12-27 17:04:14,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In958554785 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In958554785 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out958554785| |P1Thread1of1ForFork2_#t~ite10_Out958554785|))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out958554785| ~a$w_buff1~0_In958554785) (not .cse1) .cse2) (and (or .cse1 .cse0) (= ~a~0_In958554785 |P1Thread1of1ForFork2_#t~ite9_Out958554785|) .cse2))) InVars {~a~0=~a~0_In958554785, ~a$w_buff1~0=~a$w_buff1~0_In958554785, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In958554785, ~a$w_buff1_used~0=~a$w_buff1_used~0_In958554785} OutVars{~a~0=~a~0_In958554785, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out958554785|, ~a$w_buff1~0=~a$w_buff1~0_In958554785, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In958554785, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out958554785|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In958554785} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 17:04:14,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1027586566 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1027586566 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1027586566 |P1Thread1of1ForFork2_#t~ite11_Out1027586566|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1027586566|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1027586566, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1027586566} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1027586566, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1027586566, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1027586566|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 17:04:14,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In2042432494 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In2042432494 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In2042432494 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In2042432494 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out2042432494|)) (and (= ~a$w_buff1_used~0_In2042432494 |P1Thread1of1ForFork2_#t~ite12_Out2042432494|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2042432494, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2042432494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2042432494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2042432494} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2042432494, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2042432494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2042432494, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out2042432494|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2042432494} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 17:04:14,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1465834923 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out-1465834923| |P2Thread1of1ForFork0_#t~ite20_Out-1465834923|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1465834923 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-1465834923 256)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-1465834923 256))) (and (= (mod ~a$r_buff1_thd3~0_In-1465834923 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite20_Out-1465834923| ~a$w_buff0~0_In-1465834923)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1465834923| ~a$w_buff0~0_In-1465834923) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-1465834923| |P2Thread1of1ForFork0_#t~ite20_Out-1465834923|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1465834923, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1465834923, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1465834923, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1465834923, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1465834923, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1465834923|, ~weak$$choice2~0=~weak$$choice2~0_In-1465834923} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1465834923|, ~a$w_buff0~0=~a$w_buff0~0_In-1465834923, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1465834923, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1465834923, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1465834923, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1465834923|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1465834923, ~weak$$choice2~0=~weak$$choice2~0_In-1465834923} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 17:04:14,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1690562821 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-1690562821 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1690562821| 0)) (and (= ~a$r_buff0_thd2~0_In-1690562821 |P1Thread1of1ForFork2_#t~ite13_Out-1690562821|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1690562821, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1690562821} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1690562821, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1690562821, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1690562821|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 17:04:14,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1962226583 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1962226583 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1962226583 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-1962226583 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1962226583| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1962226583| ~a$r_buff1_thd2~0_In-1962226583) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1962226583, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1962226583, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1962226583, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1962226583} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1962226583, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1962226583, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1962226583, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1962226583, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1962226583|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 17:04:14,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 17:04:14,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In892648928 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In892648928 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In892648928 256)) .cse0) (and .cse0 (= (mod ~a$r_buff1_thd3~0_In892648928 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In892648928 256)))) .cse1 (= ~a$w_buff1~0_In892648928 |P2Thread1of1ForFork0_#t~ite23_Out892648928|) (= |P2Thread1of1ForFork0_#t~ite24_Out892648928| |P2Thread1of1ForFork0_#t~ite23_Out892648928|)) (and (not .cse1) (= ~a$w_buff1~0_In892648928 |P2Thread1of1ForFork0_#t~ite24_Out892648928|) (= |P2Thread1of1ForFork0_#t~ite23_In892648928| |P2Thread1of1ForFork0_#t~ite23_Out892648928|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In892648928, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In892648928|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In892648928, ~a$w_buff0_used~0=~a$w_buff0_used~0_In892648928, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In892648928, ~a$w_buff1_used~0=~a$w_buff1_used~0_In892648928, ~weak$$choice2~0=~weak$$choice2~0_In892648928} OutVars{~a$w_buff1~0=~a$w_buff1~0_In892648928, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out892648928|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out892648928|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In892648928, ~a$w_buff0_used~0=~a$w_buff0_used~0_In892648928, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In892648928, ~a$w_buff1_used~0=~a$w_buff1_used~0_In892648928, ~weak$$choice2~0=~weak$$choice2~0_In892648928} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 17:04:14,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In683853147 256)))) (or (and (not .cse0) (= ~a$w_buff0_used~0_In683853147 |P2Thread1of1ForFork0_#t~ite27_Out683853147|) (= |P2Thread1of1ForFork0_#t~ite26_In683853147| |P2Thread1of1ForFork0_#t~ite26_Out683853147|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In683853147 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In683853147 256) 0)) (and (= (mod ~a$w_buff1_used~0_In683853147 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In683853147 256) 0))) (= |P2Thread1of1ForFork0_#t~ite26_Out683853147| |P2Thread1of1ForFork0_#t~ite27_Out683853147|) .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out683853147| ~a$w_buff0_used~0_In683853147)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In683853147|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In683853147, ~a$w_buff0_used~0=~a$w_buff0_used~0_In683853147, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In683853147, ~a$w_buff1_used~0=~a$w_buff1_used~0_In683853147, ~weak$$choice2~0=~weak$$choice2~0_In683853147} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out683853147|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out683853147|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In683853147, ~a$w_buff0_used~0=~a$w_buff0_used~0_In683853147, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In683853147, ~a$w_buff1_used~0=~a$w_buff1_used~0_In683853147, ~weak$$choice2~0=~weak$$choice2~0_In683853147} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 17:04:14,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 17:04:14,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 17:04:14,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-96333239 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-96333239 256) 0))) (or (and (= ~a~0_In-96333239 |P2Thread1of1ForFork0_#t~ite38_Out-96333239|) (or .cse0 .cse1)) (and (not .cse0) (= ~a$w_buff1~0_In-96333239 |P2Thread1of1ForFork0_#t~ite38_Out-96333239|) (not .cse1)))) InVars {~a~0=~a~0_In-96333239, ~a$w_buff1~0=~a$w_buff1~0_In-96333239, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-96333239, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-96333239} OutVars{~a~0=~a~0_In-96333239, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-96333239|, ~a$w_buff1~0=~a$w_buff1~0_In-96333239, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-96333239, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-96333239} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 17:04:14,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 17:04:14,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In729135612 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In729135612 256)))) (or (and (= ~a$w_buff0_used~0_In729135612 |P2Thread1of1ForFork0_#t~ite40_Out729135612|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out729135612|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In729135612, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In729135612} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out729135612|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In729135612, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In729135612} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 17:04:14,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-329912279 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-329912279 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-329912279 |P0Thread1of1ForFork1_#t~ite5_Out-329912279|)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-329912279| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-329912279, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-329912279} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-329912279|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-329912279, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-329912279} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 17:04:14,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd1~0_In-1732817838 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1732817838 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1732817838 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-1732817838 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1732817838|)) (and (= ~a$w_buff1_used~0_In-1732817838 |P0Thread1of1ForFork1_#t~ite6_Out-1732817838|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1732817838, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1732817838, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1732817838, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1732817838} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1732817838|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1732817838, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1732817838, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1732817838, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1732817838} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 17:04:14,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In265910611 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In265910611 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In265910611 ~a$r_buff0_thd1~0_Out265910611)) (and (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out265910611) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In265910611, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In265910611} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out265910611|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In265910611, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out265910611} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:04:14,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In1157577782 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In1157577782 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1157577782 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1157577782 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1157577782|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~a$r_buff1_thd1~0_In1157577782 |P0Thread1of1ForFork1_#t~ite8_Out1157577782|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1157577782, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1157577782, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1157577782, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1157577782} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1157577782|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1157577782, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1157577782, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1157577782, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1157577782} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 17:04:14,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:04:14,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In1491025234 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In1491025234 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1491025234 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1491025234 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1491025234| ~a$w_buff1_used~0_In1491025234) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out1491025234| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1491025234, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1491025234, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1491025234, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1491025234} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1491025234, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1491025234, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1491025234, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1491025234, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1491025234|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 17:04:14,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In420453558 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In420453558 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In420453558 |P2Thread1of1ForFork0_#t~ite42_Out420453558|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out420453558|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In420453558, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In420453558} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In420453558, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In420453558, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out420453558|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 17:04:14,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-884995555 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-884995555 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-884995555 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-884995555 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-884995555 |P2Thread1of1ForFork0_#t~ite43_Out-884995555|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-884995555|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-884995555, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-884995555, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-884995555, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-884995555} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-884995555|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-884995555, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-884995555, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-884995555, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-884995555} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 17:04:14,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 17:04:14,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:04:14,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-2074407024| |ULTIMATE.start_main_#t~ite47_Out-2074407024|)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-2074407024 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-2074407024 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-2074407024| ~a~0_In-2074407024)) (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-2074407024| ~a$w_buff1~0_In-2074407024) (not .cse2)))) InVars {~a~0=~a~0_In-2074407024, ~a$w_buff1~0=~a$w_buff1~0_In-2074407024, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2074407024, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2074407024} OutVars{~a~0=~a~0_In-2074407024, ~a$w_buff1~0=~a$w_buff1~0_In-2074407024, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2074407024|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2074407024, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-2074407024|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2074407024} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 17:04:14,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-67220874 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-67220874 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-67220874|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-67220874| ~a$w_buff0_used~0_In-67220874)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-67220874, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-67220874} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-67220874, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-67220874|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-67220874} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 17:04:14,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-667212213 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-667212213 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-667212213 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-667212213 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-667212213 |ULTIMATE.start_main_#t~ite50_Out-667212213|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-667212213|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-667212213, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-667212213, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-667212213, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-667212213} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-667212213|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-667212213, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-667212213, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-667212213, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-667212213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 17:04:14,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1468774666 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1468774666 256)))) (or (and (= ~a$r_buff0_thd0~0_In1468774666 |ULTIMATE.start_main_#t~ite51_Out1468774666|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1468774666|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1468774666, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1468774666} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1468774666|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468774666, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1468774666} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 17:04:14,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1437729152 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-1437729152 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-1437729152 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1437729152 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1437729152| ~a$r_buff1_thd0~0_In-1437729152)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1437729152| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1437729152, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1437729152, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1437729152, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1437729152} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1437729152|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1437729152, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1437729152, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1437729152, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1437729152} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 17:04:14,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~y~0_31 2) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:04:14,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:04:14 BasicIcfg [2019-12-27 17:04:14,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:04:14,130 INFO L168 Benchmark]: Toolchain (without parser) took 106641.29 ms. Allocated memory was 145.8 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 101.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 17:04:14,130 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:04:14,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.84 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 156.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:14,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.93 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:14,132 INFO L168 Benchmark]: Boogie Preprocessor took 40.62 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:14,132 INFO L168 Benchmark]: RCFGBuilder took 851.15 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 101.4 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:14,132 INFO L168 Benchmark]: TraceAbstraction took 104954.93 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 17:04:14,135 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.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 730.84 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 156.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.93 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.62 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 851.15 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 101.4 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104954.93 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7302 VarBasedMoverChecksPositive, 250 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1111, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1112, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1113, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 104.6s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 43.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6813 SDtfs, 11166 SDslu, 18985 SDs, 0 SdLazy, 16445 SolverSat, 706 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 512 GetRequests, 138 SyntacticMatches, 28 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 31.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 519109 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1227 NumberOfCodeBlocks, 1227 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1132 ConstructedInterpolants, 0 QuantifiedInterpolants, 172979 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...