/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/mix002_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:30:30,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:30:30,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:30:30,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:30:30,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:30:30,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:30:30,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:30:30,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:30:30,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:30:30,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:30:30,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:30:30,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:30:30,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:30:30,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:30:30,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:30:30,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:30:30,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:30:30,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:30:30,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:30:30,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:30:30,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:30:30,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:30:30,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:30:30,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:30:30,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:30:30,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:30:30,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:30:30,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:30:30,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:30:30,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:30:30,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:30:30,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:30:30,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:30:30,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:30:30,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:30:30,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:30:30,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:30:30,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:30:30,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:30:30,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:30:30,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:30:30,107 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 15:30:30,140 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:30:30,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:30:30,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:30:30,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:30:30,144 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:30:30,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:30:30,144 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:30:30,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:30:30,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:30:30,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:30:30,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:30:30,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:30:30,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:30:30,146 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:30:30,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:30:30,148 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:30:30,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:30:30,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:30:30,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:30:30,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:30:30,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:30:30,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:30:30,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:30:30,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:30:30,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:30:30,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:30:30,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:30:30,150 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:30:30,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:30:30,151 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:30:30,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:30:30,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:30:30,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:30:30,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:30:30,443 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:30:30,443 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:30:30,444 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i [2019-12-27 15:30:30,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c341c5120/f36b0cd145e643699994af709152495a/FLAG63c0b7bec [2019-12-27 15:30:31,085 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:30:31,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i [2019-12-27 15:30:31,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c341c5120/f36b0cd145e643699994af709152495a/FLAG63c0b7bec [2019-12-27 15:30:31,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c341c5120/f36b0cd145e643699994af709152495a [2019-12-27 15:30:31,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:30:31,347 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:30:31,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:30:31,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:30:31,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:30:31,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:30:31" (1/1) ... [2019-12-27 15:30:31,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:31, skipping insertion in model container [2019-12-27 15:30:31,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:30:31" (1/1) ... [2019-12-27 15:30:31,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:30:31,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:30:31,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:30:31,957 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:30:32,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:30:32,132 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:30:32,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:32 WrapperNode [2019-12-27 15:30:32,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:30:32,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:30:32,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:30:32,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:30:32,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:32" (1/1) ... [2019-12-27 15:30:32,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:32" (1/1) ... [2019-12-27 15:30:32,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:30:32,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:30:32,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:30:32,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:30:32,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:32" (1/1) ... [2019-12-27 15:30:32,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:32" (1/1) ... [2019-12-27 15:30:32,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:32" (1/1) ... [2019-12-27 15:30:32,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:32" (1/1) ... [2019-12-27 15:30:32,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:32" (1/1) ... [2019-12-27 15:30:32,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:32" (1/1) ... [2019-12-27 15:30:32,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:32" (1/1) ... [2019-12-27 15:30:32,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:30:32,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:30:32,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:30:32,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:30:32,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:32" (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 15:30:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:30:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:30:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:30:32,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:30:32,332 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:30:32,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:30:32,332 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:30:32,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:30:32,332 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:30:32,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:30:32,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:30:32,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:30:32,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:30:32,335 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 15:30:33,096 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:30:33,097 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:30:33,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:30:33 BoogieIcfgContainer [2019-12-27 15:30:33,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:30:33,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:30:33,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:30:33,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:30:33,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:30:31" (1/3) ... [2019-12-27 15:30:33,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5584f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:30:33, skipping insertion in model container [2019-12-27 15:30:33,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:32" (2/3) ... [2019-12-27 15:30:33,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5584f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:30:33, skipping insertion in model container [2019-12-27 15:30:33,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:30:33" (3/3) ... [2019-12-27 15:30:33,107 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_pso.oepc.i [2019-12-27 15:30:33,118 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:30:33,119 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:30:33,127 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:30:33,128 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:30:33,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,174 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,174 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,175 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,183 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,183 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,212 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,212 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,240 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,241 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,247 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,249 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:33,296 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:30:33,318 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:30:33,318 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:30:33,318 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:30:33,319 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:30:33,319 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:30:33,319 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:30:33,319 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:30:33,319 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:30:33,341 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 15:30:33,343 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 15:30:33,468 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 15:30:33,469 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:30:33,489 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:30:33,513 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 15:30:33,601 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 15:30:33,601 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:30:33,609 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:30:33,631 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:30:33,632 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:30:38,967 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 15:30:39,120 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 15:30:39,321 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-27 15:30:39,321 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 15:30:39,325 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-27 15:30:58,936 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-27 15:30:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-27 15:30:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:30:58,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:30:58,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:30:58,948 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 15:30:58,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:30:58,955 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-27 15:30:58,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:30:58,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080363082] [2019-12-27 15:30:58,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:30:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:30:59,237 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 15:30:59,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080363082] [2019-12-27 15:30:59,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:30:59,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:30:59,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [183377968] [2019-12-27 15:30:59,241 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:30:59,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:30:59,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:30:59,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:30:59,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:30:59,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:30:59,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:30:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:30:59,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:30:59,282 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-27 15:31:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:02,821 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-27 15:31:02,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:02,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:31:02,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:03,557 INFO L225 Difference]: With dead ends: 119349 [2019-12-27 15:31:03,557 INFO L226 Difference]: Without dead ends: 112420 [2019-12-27 15:31:03,559 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 15:31:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-27 15:31:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-27 15:31:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-27 15:31:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-27 15:31:14,511 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-27 15:31:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:14,511 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-27 15:31:14,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-27 15:31:14,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:31:14,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:14,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:31:14,517 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 15:31:14,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:14,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-27 15:31:14,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:14,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539058624] [2019-12-27 15:31:14,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:14,643 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 15:31:14,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539058624] [2019-12-27 15:31:14,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:14,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:31:14,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [68245848] [2019-12-27 15:31:14,644 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:14,646 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:14,649 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:31:14,649 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:14,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:14,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:31:14,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:14,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:31:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:31:14,652 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-27 15:31:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:20,980 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-27 15:31:20,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:31:20,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:31:20,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:21,641 INFO L225 Difference]: With dead ends: 179210 [2019-12-27 15:31:21,641 INFO L226 Difference]: Without dead ends: 179161 [2019-12-27 15:31:21,642 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 15:31:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-27 15:31:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-27 15:31:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-27 15:31:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-27 15:31:31,396 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-27 15:31:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:31,397 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-27 15:31:31,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:31:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-27 15:31:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:31:31,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:31,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:31:31,405 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 15:31:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-27 15:31:31,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:31,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685577736] [2019-12-27 15:31:31,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:31,465 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 15:31:31,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685577736] [2019-12-27 15:31:31,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:31,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:31:31,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [621471078] [2019-12-27 15:31:31,467 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:31,468 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:31,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:31:31,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:31,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:31,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:31:31,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:31,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:31:31,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:31:31,471 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 3 states. [2019-12-27 15:31:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:31,655 INFO L93 Difference]: Finished difference Result 34811 states and 113031 transitions. [2019-12-27 15:31:31,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:31,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:31:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:31,761 INFO L225 Difference]: With dead ends: 34811 [2019-12-27 15:31:31,761 INFO L226 Difference]: Without dead ends: 34811 [2019-12-27 15:31:31,761 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 15:31:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34811 states. [2019-12-27 15:31:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34811 to 34811. [2019-12-27 15:31:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34811 states. [2019-12-27 15:31:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34811 states to 34811 states and 113031 transitions. [2019-12-27 15:31:37,424 INFO L78 Accepts]: Start accepts. Automaton has 34811 states and 113031 transitions. Word has length 13 [2019-12-27 15:31:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:37,425 INFO L462 AbstractCegarLoop]: Abstraction has 34811 states and 113031 transitions. [2019-12-27 15:31:37,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 34811 states and 113031 transitions. [2019-12-27 15:31:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:31:37,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:37,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:31:37,429 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 15:31:37,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:37,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-27 15:31:37,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:37,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028078949] [2019-12-27 15:31:37,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:37,517 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 15:31:37,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028078949] [2019-12-27 15:31:37,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:37,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:31:37,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [972914972] [2019-12-27 15:31:37,521 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:37,524 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:37,527 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:31:37,527 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:37,528 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:37,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:31:37,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:37,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:31:37,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:31:37,529 INFO L87 Difference]: Start difference. First operand 34811 states and 113031 transitions. Second operand 5 states. [2019-12-27 15:31:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:38,122 INFO L93 Difference]: Finished difference Result 48236 states and 154913 transitions. [2019-12-27 15:31:38,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:31:38,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 15:31:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:38,206 INFO L225 Difference]: With dead ends: 48236 [2019-12-27 15:31:38,206 INFO L226 Difference]: Without dead ends: 48236 [2019-12-27 15:31:38,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:31:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-27 15:31:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 41215. [2019-12-27 15:31:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41215 states. [2019-12-27 15:31:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41215 states to 41215 states and 133442 transitions. [2019-12-27 15:31:38,988 INFO L78 Accepts]: Start accepts. Automaton has 41215 states and 133442 transitions. Word has length 16 [2019-12-27 15:31:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:38,989 INFO L462 AbstractCegarLoop]: Abstraction has 41215 states and 133442 transitions. [2019-12-27 15:31:38,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:31:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 41215 states and 133442 transitions. [2019-12-27 15:31:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:31:39,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:39,001 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 15:31:39,001 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 15:31:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-27 15:31:39,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:39,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575212104] [2019-12-27 15:31:39,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:39,100 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 15:31:39,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575212104] [2019-12-27 15:31:39,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:39,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:31:39,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [343812516] [2019-12-27 15:31:39,101 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:39,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:39,114 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 15:31:39,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:39,116 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:39,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:31:39,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:31:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:31:39,117 INFO L87 Difference]: Start difference. First operand 41215 states and 133442 transitions. Second operand 6 states. [2019-12-27 15:31:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:40,421 INFO L93 Difference]: Finished difference Result 62182 states and 196414 transitions. [2019-12-27 15:31:40,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:31:40,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 15:31:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:40,529 INFO L225 Difference]: With dead ends: 62182 [2019-12-27 15:31:40,530 INFO L226 Difference]: Without dead ends: 62175 [2019-12-27 15:31:40,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:31:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62175 states. [2019-12-27 15:31:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62175 to 40995. [2019-12-27 15:31:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40995 states. [2019-12-27 15:31:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40995 states to 40995 states and 132031 transitions. [2019-12-27 15:31:41,405 INFO L78 Accepts]: Start accepts. Automaton has 40995 states and 132031 transitions. Word has length 22 [2019-12-27 15:31:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:41,405 INFO L462 AbstractCegarLoop]: Abstraction has 40995 states and 132031 transitions. [2019-12-27 15:31:41,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:31:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 40995 states and 132031 transitions. [2019-12-27 15:31:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:31:41,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:41,420 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 15:31:41,420 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 15:31:41,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:41,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-27 15:31:41,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:41,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464829477] [2019-12-27 15:31:41,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:41,487 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 15:31:41,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464829477] [2019-12-27 15:31:41,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:41,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:31:41,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1789227377] [2019-12-27 15:31:41,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:41,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:41,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:31:41,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:41,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:41,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:31:41,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:41,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:31:41,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:31:41,504 INFO L87 Difference]: Start difference. First operand 40995 states and 132031 transitions. Second operand 4 states. [2019-12-27 15:31:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:41,569 INFO L93 Difference]: Finished difference Result 16196 states and 49196 transitions. [2019-12-27 15:31:41,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:31:41,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 15:31:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:41,592 INFO L225 Difference]: With dead ends: 16196 [2019-12-27 15:31:41,592 INFO L226 Difference]: Without dead ends: 16196 [2019-12-27 15:31:41,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:31:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16196 states. [2019-12-27 15:31:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16196 to 15833. [2019-12-27 15:31:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15833 states. [2019-12-27 15:31:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15833 states to 15833 states and 48160 transitions. [2019-12-27 15:31:41,830 INFO L78 Accepts]: Start accepts. Automaton has 15833 states and 48160 transitions. Word has length 25 [2019-12-27 15:31:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:41,830 INFO L462 AbstractCegarLoop]: Abstraction has 15833 states and 48160 transitions. [2019-12-27 15:31:41,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:31:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 15833 states and 48160 transitions. [2019-12-27 15:31:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:31:41,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:41,841 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 15:31:41,841 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 15:31:41,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:41,841 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-27 15:31:41,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:41,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753062871] [2019-12-27 15:31:41,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:41,893 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 15:31:41,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753062871] [2019-12-27 15:31:41,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:41,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:31:41,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [603200758] [2019-12-27 15:31:41,895 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:41,899 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:41,905 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:31:41,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:41,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:41,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:31:41,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:41,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:31:41,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:31:41,906 INFO L87 Difference]: Start difference. First operand 15833 states and 48160 transitions. Second operand 3 states. [2019-12-27 15:31:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:42,007 INFO L93 Difference]: Finished difference Result 23073 states and 68792 transitions. [2019-12-27 15:31:42,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:42,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 15:31:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:42,039 INFO L225 Difference]: With dead ends: 23073 [2019-12-27 15:31:42,039 INFO L226 Difference]: Without dead ends: 23073 [2019-12-27 15:31:42,039 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 15:31:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23073 states. [2019-12-27 15:31:42,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23073 to 17600. [2019-12-27 15:31:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17600 states. [2019-12-27 15:31:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17600 states to 17600 states and 53010 transitions. [2019-12-27 15:31:42,576 INFO L78 Accepts]: Start accepts. Automaton has 17600 states and 53010 transitions. Word has length 27 [2019-12-27 15:31:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:42,576 INFO L462 AbstractCegarLoop]: Abstraction has 17600 states and 53010 transitions. [2019-12-27 15:31:42,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 17600 states and 53010 transitions. [2019-12-27 15:31:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:31:42,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:42,589 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 15:31:42,589 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 15:31:42,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:42,589 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-27 15:31:42,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:42,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914313319] [2019-12-27 15:31:42,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:42,689 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 15:31:42,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914313319] [2019-12-27 15:31:42,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:42,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:31:42,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [128583438] [2019-12-27 15:31:42,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:42,695 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:42,701 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:31:42,701 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:42,702 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:42,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:31:42,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:42,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:31:42,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:31:42,703 INFO L87 Difference]: Start difference. First operand 17600 states and 53010 transitions. Second operand 6 states. [2019-12-27 15:31:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:43,243 INFO L93 Difference]: Finished difference Result 24767 states and 72789 transitions. [2019-12-27 15:31:43,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:31:43,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 15:31:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:43,279 INFO L225 Difference]: With dead ends: 24767 [2019-12-27 15:31:43,279 INFO L226 Difference]: Without dead ends: 24767 [2019-12-27 15:31:43,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:31:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-12-27 15:31:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 20286. [2019-12-27 15:31:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20286 states. [2019-12-27 15:31:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20286 states to 20286 states and 60759 transitions. [2019-12-27 15:31:43,589 INFO L78 Accepts]: Start accepts. Automaton has 20286 states and 60759 transitions. Word has length 27 [2019-12-27 15:31:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:43,589 INFO L462 AbstractCegarLoop]: Abstraction has 20286 states and 60759 transitions. [2019-12-27 15:31:43,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:31:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 20286 states and 60759 transitions. [2019-12-27 15:31:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:31:43,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:43,611 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 15:31:43,611 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 15:31:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:43,612 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-27 15:31:43,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:43,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852875800] [2019-12-27 15:31:43,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:43,704 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 15:31:43,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852875800] [2019-12-27 15:31:43,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:43,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:31:43,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [755971345] [2019-12-27 15:31:43,706 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:43,711 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:43,726 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 15:31:43,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:43,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:43,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:31:43,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:43,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:31:43,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:31:43,728 INFO L87 Difference]: Start difference. First operand 20286 states and 60759 transitions. Second operand 7 states. [2019-12-27 15:31:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:45,039 INFO L93 Difference]: Finished difference Result 27601 states and 80773 transitions. [2019-12-27 15:31:45,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:31:45,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 15:31:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:45,078 INFO L225 Difference]: With dead ends: 27601 [2019-12-27 15:31:45,078 INFO L226 Difference]: Without dead ends: 27601 [2019-12-27 15:31:45,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:31:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2019-12-27 15:31:45,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 18412. [2019-12-27 15:31:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18412 states. [2019-12-27 15:31:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18412 states to 18412 states and 55362 transitions. [2019-12-27 15:31:45,420 INFO L78 Accepts]: Start accepts. Automaton has 18412 states and 55362 transitions. Word has length 33 [2019-12-27 15:31:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:45,421 INFO L462 AbstractCegarLoop]: Abstraction has 18412 states and 55362 transitions. [2019-12-27 15:31:45,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:31:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 18412 states and 55362 transitions. [2019-12-27 15:31:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:31:45,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:45,445 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 15:31:45,445 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 15:31:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:45,446 INFO L82 PathProgramCache]: Analyzing trace with hash 994852703, now seen corresponding path program 1 times [2019-12-27 15:31:45,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:45,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286262309] [2019-12-27 15:31:45,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:45,518 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 15:31:45,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286262309] [2019-12-27 15:31:45,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:45,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:31:45,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1879085839] [2019-12-27 15:31:45,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:45,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:45,808 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 15:31:45,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:45,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:45,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:31:45,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:45,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:31:45,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:31:45,811 INFO L87 Difference]: Start difference. First operand 18412 states and 55362 transitions. Second operand 3 states. [2019-12-27 15:31:45,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:45,878 INFO L93 Difference]: Finished difference Result 18411 states and 55360 transitions. [2019-12-27 15:31:45,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:45,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:31:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:45,905 INFO L225 Difference]: With dead ends: 18411 [2019-12-27 15:31:45,905 INFO L226 Difference]: Without dead ends: 18411 [2019-12-27 15:31:45,906 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 15:31:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2019-12-27 15:31:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 18411. [2019-12-27 15:31:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18411 states. [2019-12-27 15:31:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18411 states to 18411 states and 55360 transitions. [2019-12-27 15:31:46,175 INFO L78 Accepts]: Start accepts. Automaton has 18411 states and 55360 transitions. Word has length 39 [2019-12-27 15:31:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:46,175 INFO L462 AbstractCegarLoop]: Abstraction has 18411 states and 55360 transitions. [2019-12-27 15:31:46,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 18411 states and 55360 transitions. [2019-12-27 15:31:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:31:46,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:46,199 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 15:31:46,199 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 15:31:46,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:46,199 INFO L82 PathProgramCache]: Analyzing trace with hash 467911076, now seen corresponding path program 1 times [2019-12-27 15:31:46,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:46,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534212155] [2019-12-27 15:31:46,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:46,304 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 15:31:46,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534212155] [2019-12-27 15:31:46,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:46,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:31:46,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [392100469] [2019-12-27 15:31:46,305 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:46,314 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:46,426 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 15:31:46,427 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:46,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:31:46,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:31:46,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:46,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:31:46,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:31:46,433 INFO L87 Difference]: Start difference. First operand 18411 states and 55360 transitions. Second operand 3 states. [2019-12-27 15:31:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:46,517 INFO L93 Difference]: Finished difference Result 18325 states and 55099 transitions. [2019-12-27 15:31:46,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:46,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 15:31:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:46,544 INFO L225 Difference]: With dead ends: 18325 [2019-12-27 15:31:46,544 INFO L226 Difference]: Without dead ends: 18325 [2019-12-27 15:31:46,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 15:31:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2019-12-27 15:31:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 16323. [2019-12-27 15:31:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-27 15:31:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 49617 transitions. [2019-12-27 15:31:46,809 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 49617 transitions. Word has length 40 [2019-12-27 15:31:46,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:46,810 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 49617 transitions. [2019-12-27 15:31:46,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 49617 transitions. [2019-12-27 15:31:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:31:46,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:46,827 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] [2019-12-27 15:31:46,827 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 15:31:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:46,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-27 15:31:46,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:46,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240415449] [2019-12-27 15:31:46,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:46,897 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 15:31:46,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240415449] [2019-12-27 15:31:46,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:46,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:31:46,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2136331466] [2019-12-27 15:31:46,899 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:46,907 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:46,991 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 417 transitions. [2019-12-27 15:31:46,992 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:47,034 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:31:47,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:31:47,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:47,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:31:47,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:31:47,035 INFO L87 Difference]: Start difference. First operand 16323 states and 49617 transitions. Second operand 6 states. [2019-12-27 15:31:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:47,124 INFO L93 Difference]: Finished difference Result 15143 states and 47024 transitions. [2019-12-27 15:31:47,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:31:47,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 15:31:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:47,153 INFO L225 Difference]: With dead ends: 15143 [2019-12-27 15:31:47,153 INFO L226 Difference]: Without dead ends: 15143 [2019-12-27 15:31:47,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:31:47,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-27 15:31:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 15143. [2019-12-27 15:31:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-12-27 15:31:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 47024 transitions. [2019-12-27 15:31:47,393 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 47024 transitions. Word has length 41 [2019-12-27 15:31:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:47,393 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 47024 transitions. [2019-12-27 15:31:47,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:31:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 47024 transitions. [2019-12-27 15:31:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:31:47,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:47,410 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 15:31:47,410 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 15:31:47,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-27 15:31:47,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:47,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448888152] [2019-12-27 15:31:47,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:47,464 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 15:31:47,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448888152] [2019-12-27 15:31:47,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:47,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:31:47,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [793584260] [2019-12-27 15:31:47,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:47,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:47,991 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 313 states and 574 transitions. [2019-12-27 15:31:47,991 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:48,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:31:48,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:31:48,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:48,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:31:48,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:31:48,012 INFO L87 Difference]: Start difference. First operand 15143 states and 47024 transitions. Second operand 3 states. [2019-12-27 15:31:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:48,112 INFO L93 Difference]: Finished difference Result 19655 states and 59985 transitions. [2019-12-27 15:31:48,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:48,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:31:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:48,138 INFO L225 Difference]: With dead ends: 19655 [2019-12-27 15:31:48,139 INFO L226 Difference]: Without dead ends: 19655 [2019-12-27 15:31:48,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 2 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 15:31:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19655 states. [2019-12-27 15:31:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19655 to 14961. [2019-12-27 15:31:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14961 states. [2019-12-27 15:31:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14961 states to 14961 states and 45870 transitions. [2019-12-27 15:31:48,417 INFO L78 Accepts]: Start accepts. Automaton has 14961 states and 45870 transitions. Word has length 65 [2019-12-27 15:31:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:48,417 INFO L462 AbstractCegarLoop]: Abstraction has 14961 states and 45870 transitions. [2019-12-27 15:31:48,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 14961 states and 45870 transitions. [2019-12-27 15:31:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:31:48,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:48,439 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 15:31:48,440 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 15:31:48,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:48,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-27 15:31:48,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:48,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136466155] [2019-12-27 15:31:48,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:48,538 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 15:31:48,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136466155] [2019-12-27 15:31:48,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:48,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:31:48,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1625587187] [2019-12-27 15:31:48,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:48,561 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:48,824 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 313 states and 574 transitions. [2019-12-27 15:31:48,824 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:48,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:31:48,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:31:48,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:48,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:31:48,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:31:48,884 INFO L87 Difference]: Start difference. First operand 14961 states and 45870 transitions. Second operand 9 states. [2019-12-27 15:31:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:52,169 INFO L93 Difference]: Finished difference Result 67643 states and 203328 transitions. [2019-12-27 15:31:52,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 15:31:52,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:31:52,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:52,243 INFO L225 Difference]: With dead ends: 67643 [2019-12-27 15:31:52,243 INFO L226 Difference]: Without dead ends: 53075 [2019-12-27 15:31:52,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 15:31:52,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53075 states. [2019-12-27 15:31:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53075 to 18596. [2019-12-27 15:31:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18596 states. [2019-12-27 15:31:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18596 states to 18596 states and 57138 transitions. [2019-12-27 15:31:52,756 INFO L78 Accepts]: Start accepts. Automaton has 18596 states and 57138 transitions. Word has length 65 [2019-12-27 15:31:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:52,756 INFO L462 AbstractCegarLoop]: Abstraction has 18596 states and 57138 transitions. [2019-12-27 15:31:52,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:31:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 18596 states and 57138 transitions. [2019-12-27 15:31:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:31:52,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:52,785 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 15:31:52,785 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 15:31:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash -29541862, now seen corresponding path program 2 times [2019-12-27 15:31:52,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:52,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145645698] [2019-12-27 15:31:52,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:52,891 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 15:31:52,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145645698] [2019-12-27 15:31:52,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:52,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:31:52,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [794661759] [2019-12-27 15:31:52,892 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:52,934 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:53,147 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 497 transitions. [2019-12-27 15:31:53,147 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:53,163 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:31:53,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:31:53,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:53,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:31:53,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:31:53,164 INFO L87 Difference]: Start difference. First operand 18596 states and 57138 transitions. Second operand 8 states. [2019-12-27 15:31:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:55,942 INFO L93 Difference]: Finished difference Result 69175 states and 210360 transitions. [2019-12-27 15:31:55,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 15:31:55,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 15:31:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:56,012 INFO L225 Difference]: With dead ends: 69175 [2019-12-27 15:31:56,012 INFO L226 Difference]: Without dead ends: 48309 [2019-12-27 15:31:56,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-12-27 15:31:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48309 states. [2019-12-27 15:31:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48309 to 23571. [2019-12-27 15:31:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23571 states. [2019-12-27 15:31:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23571 states to 23571 states and 72094 transitions. [2019-12-27 15:31:56,876 INFO L78 Accepts]: Start accepts. Automaton has 23571 states and 72094 transitions. Word has length 65 [2019-12-27 15:31:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:56,877 INFO L462 AbstractCegarLoop]: Abstraction has 23571 states and 72094 transitions. [2019-12-27 15:31:56,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:31:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 23571 states and 72094 transitions. [2019-12-27 15:31:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:31:56,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:56,899 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 15:31:56,900 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 15:31:56,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:56,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1604322860, now seen corresponding path program 3 times [2019-12-27 15:31:56,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:56,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966239875] [2019-12-27 15:31:56,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:31:57,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966239875] [2019-12-27 15:31:57,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:57,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:31:57,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [370604320] [2019-12-27 15:31:57,027 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:57,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:57,284 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 310 transitions. [2019-12-27 15:31:57,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:57,323 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:31:57,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:31:57,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:57,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:31:57,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:31:57,324 INFO L87 Difference]: Start difference. First operand 23571 states and 72094 transitions. Second operand 11 states. [2019-12-27 15:32:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:00,122 INFO L93 Difference]: Finished difference Result 93089 states and 282056 transitions. [2019-12-27 15:32:00,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 15:32:00,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 15:32:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:00,258 INFO L225 Difference]: With dead ends: 93089 [2019-12-27 15:32:00,258 INFO L226 Difference]: Without dead ends: 90467 [2019-12-27 15:32:00,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=489, Invalid=1767, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 15:32:00,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90467 states. [2019-12-27 15:32:01,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90467 to 23764. [2019-12-27 15:32:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23764 states. [2019-12-27 15:32:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23764 states to 23764 states and 72954 transitions. [2019-12-27 15:32:01,544 INFO L78 Accepts]: Start accepts. Automaton has 23764 states and 72954 transitions. Word has length 65 [2019-12-27 15:32:01,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:01,545 INFO L462 AbstractCegarLoop]: Abstraction has 23764 states and 72954 transitions. [2019-12-27 15:32:01,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:32:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 23764 states and 72954 transitions. [2019-12-27 15:32:01,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:32:01,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:01,570 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 15:32:01,570 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 15:32:01,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:01,570 INFO L82 PathProgramCache]: Analyzing trace with hash -841108452, now seen corresponding path program 4 times [2019-12-27 15:32:01,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:01,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47019889] [2019-12-27 15:32:01,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:01,640 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 15:32:01,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47019889] [2019-12-27 15:32:01,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:01,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:32:01,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1754680213] [2019-12-27 15:32:01,641 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:01,661 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:01,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 340 states and 648 transitions. [2019-12-27 15:32:01,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:01,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:32:01,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:01,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:01,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:01,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:01,961 INFO L87 Difference]: Start difference. First operand 23764 states and 72954 transitions. Second operand 3 states. [2019-12-27 15:32:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:02,079 INFO L93 Difference]: Finished difference Result 26831 states and 82437 transitions. [2019-12-27 15:32:02,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:02,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:32:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:02,116 INFO L225 Difference]: With dead ends: 26831 [2019-12-27 15:32:02,116 INFO L226 Difference]: Without dead ends: 26831 [2019-12-27 15:32:02,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 4 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 15:32:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26831 states. [2019-12-27 15:32:02,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26831 to 22448. [2019-12-27 15:32:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22448 states. [2019-12-27 15:32:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22448 states to 22448 states and 69699 transitions. [2019-12-27 15:32:02,502 INFO L78 Accepts]: Start accepts. Automaton has 22448 states and 69699 transitions. Word has length 65 [2019-12-27 15:32:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:02,502 INFO L462 AbstractCegarLoop]: Abstraction has 22448 states and 69699 transitions. [2019-12-27 15:32:02,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 22448 states and 69699 transitions. [2019-12-27 15:32:02,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:32:02,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:02,528 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 15:32:02,528 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 15:32:02,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:02,528 INFO L82 PathProgramCache]: Analyzing trace with hash -23971085, now seen corresponding path program 1 times [2019-12-27 15:32:02,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:02,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201992516] [2019-12-27 15:32:02,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:02,637 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 15:32:02,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201992516] [2019-12-27 15:32:02,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:02,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:32:02,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [669786509] [2019-12-27 15:32:02,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:02,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:02,907 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 293 transitions. [2019-12-27 15:32:02,908 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:02,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:32:02,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:32:02,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:02,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:32:02,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:32:02,912 INFO L87 Difference]: Start difference. First operand 22448 states and 69699 transitions. Second operand 8 states. [2019-12-27 15:32:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:04,490 INFO L93 Difference]: Finished difference Result 55952 states and 170672 transitions. [2019-12-27 15:32:04,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 15:32:04,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 15:32:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:04,563 INFO L225 Difference]: With dead ends: 55952 [2019-12-27 15:32:04,563 INFO L226 Difference]: Without dead ends: 52796 [2019-12-27 15:32:04,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:32:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52796 states. [2019-12-27 15:32:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52796 to 22532. [2019-12-27 15:32:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22532 states. [2019-12-27 15:32:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 70039 transitions. [2019-12-27 15:32:05,097 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 70039 transitions. Word has length 66 [2019-12-27 15:32:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:05,097 INFO L462 AbstractCegarLoop]: Abstraction has 22532 states and 70039 transitions. [2019-12-27 15:32:05,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:32:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 70039 transitions. [2019-12-27 15:32:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:32:05,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:05,120 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 15:32:05,120 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 15:32:05,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:05,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1713623309, now seen corresponding path program 2 times [2019-12-27 15:32:05,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:05,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456847093] [2019-12-27 15:32:05,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:32:05,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456847093] [2019-12-27 15:32:05,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:05,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:32:05,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [609270498] [2019-12-27 15:32:05,242 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:05,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:05,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 307 transitions. [2019-12-27 15:32:05,421 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:05,582 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:32:05,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:32:05,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:05,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:32:05,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:32:05,583 INFO L87 Difference]: Start difference. First operand 22532 states and 70039 transitions. Second operand 12 states. [2019-12-27 15:32:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:11,651 INFO L93 Difference]: Finished difference Result 98642 states and 299379 transitions. [2019-12-27 15:32:11,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-27 15:32:11,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 15:32:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:11,769 INFO L225 Difference]: With dead ends: 98642 [2019-12-27 15:32:11,769 INFO L226 Difference]: Without dead ends: 83103 [2019-12-27 15:32:11,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=840, Invalid=3990, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 15:32:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83103 states. [2019-12-27 15:32:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83103 to 24328. [2019-12-27 15:32:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24328 states. [2019-12-27 15:32:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24328 states to 24328 states and 75952 transitions. [2019-12-27 15:32:12,542 INFO L78 Accepts]: Start accepts. Automaton has 24328 states and 75952 transitions. Word has length 66 [2019-12-27 15:32:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:12,542 INFO L462 AbstractCegarLoop]: Abstraction has 24328 states and 75952 transitions. [2019-12-27 15:32:12,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:32:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 24328 states and 75952 transitions. [2019-12-27 15:32:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:32:12,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:12,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, 1, 1, 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 15:32:12,567 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 15:32:12,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:12,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1583227917, now seen corresponding path program 3 times [2019-12-27 15:32:12,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:12,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393688463] [2019-12-27 15:32:12,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:12,673 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 15:32:12,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393688463] [2019-12-27 15:32:12,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:12,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:32:12,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [226445238] [2019-12-27 15:32:12,674 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:12,697 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:12,899 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 293 transitions. [2019-12-27 15:32:12,900 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:12,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:32:12,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:32:12,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:12,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:32:12,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:32:12,910 INFO L87 Difference]: Start difference. First operand 24328 states and 75952 transitions. Second operand 9 states. [2019-12-27 15:32:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:14,257 INFO L93 Difference]: Finished difference Result 72337 states and 218873 transitions. [2019-12-27 15:32:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:32:14,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 15:32:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:14,360 INFO L225 Difference]: With dead ends: 72337 [2019-12-27 15:32:14,360 INFO L226 Difference]: Without dead ends: 68973 [2019-12-27 15:32:14,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:32:14,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68973 states. [2019-12-27 15:32:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68973 to 24188. [2019-12-27 15:32:15,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24188 states. [2019-12-27 15:32:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24188 states to 24188 states and 75284 transitions. [2019-12-27 15:32:15,497 INFO L78 Accepts]: Start accepts. Automaton has 24188 states and 75284 transitions. Word has length 66 [2019-12-27 15:32:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:15,497 INFO L462 AbstractCegarLoop]: Abstraction has 24188 states and 75284 transitions. [2019-12-27 15:32:15,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:32:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 24188 states and 75284 transitions. [2019-12-27 15:32:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:32:15,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:15,523 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 15:32:15,523 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 15:32:15,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:15,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1805047887, now seen corresponding path program 4 times [2019-12-27 15:32:15,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:15,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069506237] [2019-12-27 15:32:15,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:15,636 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 15:32:15,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069506237] [2019-12-27 15:32:15,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:15,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:32:15,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1992586528] [2019-12-27 15:32:15,637 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:15,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:15,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 548 transitions. [2019-12-27 15:32:15,968 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:16,207 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:32:16,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:32:16,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:16,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:32:16,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:32:16,209 INFO L87 Difference]: Start difference. First operand 24188 states and 75284 transitions. Second operand 13 states. [2019-12-27 15:32:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:19,793 INFO L93 Difference]: Finished difference Result 61337 states and 185557 transitions. [2019-12-27 15:32:19,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 15:32:19,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 15:32:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:19,882 INFO L225 Difference]: With dead ends: 61337 [2019-12-27 15:32:19,883 INFO L226 Difference]: Without dead ends: 61337 [2019-12-27 15:32:19,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2019-12-27 15:32:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61337 states. [2019-12-27 15:32:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61337 to 22583. [2019-12-27 15:32:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22583 states. [2019-12-27 15:32:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22583 states to 22583 states and 69137 transitions. [2019-12-27 15:32:20,530 INFO L78 Accepts]: Start accepts. Automaton has 22583 states and 69137 transitions. Word has length 66 [2019-12-27 15:32:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:20,530 INFO L462 AbstractCegarLoop]: Abstraction has 22583 states and 69137 transitions. [2019-12-27 15:32:20,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:32:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 22583 states and 69137 transitions. [2019-12-27 15:32:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:32:20,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:20,562 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 15:32:20,562 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 15:32:20,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:20,562 INFO L82 PathProgramCache]: Analyzing trace with hash -707932787, now seen corresponding path program 1 times [2019-12-27 15:32:20,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:20,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230471586] [2019-12-27 15:32:20,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:20,644 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 15:32:20,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230471586] [2019-12-27 15:32:20,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:20,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:32:20,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1365482012] [2019-12-27 15:32:20,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:20,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:21,245 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 548 transitions. [2019-12-27 15:32:21,245 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:21,250 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:32:21,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:32:21,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:21,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:32:21,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:32:21,251 INFO L87 Difference]: Start difference. First operand 22583 states and 69137 transitions. Second operand 4 states. [2019-12-27 15:32:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:21,367 INFO L93 Difference]: Finished difference Result 22398 states and 68401 transitions. [2019-12-27 15:32:21,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:32:21,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:32:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:21,396 INFO L225 Difference]: With dead ends: 22398 [2019-12-27 15:32:21,396 INFO L226 Difference]: Without dead ends: 22398 [2019-12-27 15:32:21,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 5 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 15:32:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22398 states. [2019-12-27 15:32:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22398 to 20584. [2019-12-27 15:32:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20584 states. [2019-12-27 15:32:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20584 states to 20584 states and 62988 transitions. [2019-12-27 15:32:21,713 INFO L78 Accepts]: Start accepts. Automaton has 20584 states and 62988 transitions. Word has length 66 [2019-12-27 15:32:21,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:21,714 INFO L462 AbstractCegarLoop]: Abstraction has 20584 states and 62988 transitions. [2019-12-27 15:32:21,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:32:21,714 INFO L276 IsEmpty]: Start isEmpty. Operand 20584 states and 62988 transitions. [2019-12-27 15:32:21,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:32:21,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:21,736 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 15:32:21,736 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 15:32:21,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:21,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1506873112, now seen corresponding path program 1 times [2019-12-27 15:32:21,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:21,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046682327] [2019-12-27 15:32:21,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:21,815 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 15:32:21,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046682327] [2019-12-27 15:32:21,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:21,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:32:21,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2054967911] [2019-12-27 15:32:21,816 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:21,835 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:22,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 308 states and 520 transitions. [2019-12-27 15:32:22,069 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:22,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:32:22,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:32:22,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:22,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:32:22,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:32:22,077 INFO L87 Difference]: Start difference. First operand 20584 states and 62988 transitions. Second operand 4 states. [2019-12-27 15:32:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:22,315 INFO L93 Difference]: Finished difference Result 26349 states and 78432 transitions. [2019-12-27 15:32:22,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:32:22,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:32:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:22,349 INFO L225 Difference]: With dead ends: 26349 [2019-12-27 15:32:22,350 INFO L226 Difference]: Without dead ends: 26349 [2019-12-27 15:32:22,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 15:32:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26349 states. [2019-12-27 15:32:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26349 to 18341. [2019-12-27 15:32:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18341 states. [2019-12-27 15:32:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18341 states to 18341 states and 55309 transitions. [2019-12-27 15:32:22,657 INFO L78 Accepts]: Start accepts. Automaton has 18341 states and 55309 transitions. Word has length 66 [2019-12-27 15:32:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:22,658 INFO L462 AbstractCegarLoop]: Abstraction has 18341 states and 55309 transitions. [2019-12-27 15:32:22,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:32:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 18341 states and 55309 transitions. [2019-12-27 15:32:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:32:22,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:22,676 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 15:32:22,676 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 15:32:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-27 15:32:22,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:22,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840184296] [2019-12-27 15:32:22,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:22,785 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 15:32:22,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840184296] [2019-12-27 15:32:22,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:22,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:32:22,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103646167] [2019-12-27 15:32:22,786 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:22,803 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:23,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 334 transitions. [2019-12-27 15:32:23,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:23,366 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:32:23,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:32:23,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:23,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:32:23,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:32:23,368 INFO L87 Difference]: Start difference. First operand 18341 states and 55309 transitions. Second operand 9 states. [2019-12-27 15:32:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:24,896 INFO L93 Difference]: Finished difference Result 34193 states and 101561 transitions. [2019-12-27 15:32:24,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:32:24,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 15:32:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:24,937 INFO L225 Difference]: With dead ends: 34193 [2019-12-27 15:32:24,937 INFO L226 Difference]: Without dead ends: 28904 [2019-12-27 15:32:24,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-27 15:32:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28904 states. [2019-12-27 15:32:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28904 to 18973. [2019-12-27 15:32:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18973 states. [2019-12-27 15:32:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18973 states to 18973 states and 56913 transitions. [2019-12-27 15:32:25,316 INFO L78 Accepts]: Start accepts. Automaton has 18973 states and 56913 transitions. Word has length 67 [2019-12-27 15:32:25,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:25,316 INFO L462 AbstractCegarLoop]: Abstraction has 18973 states and 56913 transitions. [2019-12-27 15:32:25,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:32:25,316 INFO L276 IsEmpty]: Start isEmpty. Operand 18973 states and 56913 transitions. [2019-12-27 15:32:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:32:25,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:25,337 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 15:32:25,337 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 15:32:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 2 times [2019-12-27 15:32:25,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:25,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543390355] [2019-12-27 15:32:25,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:32:25,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543390355] [2019-12-27 15:32:25,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:25,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 15:32:25,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2035372090] [2019-12-27 15:32:25,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:25,969 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:26,144 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 324 transitions. [2019-12-27 15:32:26,144 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:26,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:32:26,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 15:32:26,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 15:32:26,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:26,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 15:32:26,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2019-12-27 15:32:26,834 INFO L87 Difference]: Start difference. First operand 18973 states and 56913 transitions. Second operand 27 states. [2019-12-27 15:32:31,711 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-12-27 15:32:40,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:40,422 INFO L93 Difference]: Finished difference Result 31685 states and 93016 transitions. [2019-12-27 15:32:40,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-12-27 15:32:40,422 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2019-12-27 15:32:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:40,459 INFO L225 Difference]: With dead ends: 31685 [2019-12-27 15:32:40,459 INFO L226 Difference]: Without dead ends: 27587 [2019-12-27 15:32:40,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 18 SyntacticMatches, 15 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3567 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1156, Invalid=10400, Unknown=0, NotChecked=0, Total=11556 [2019-12-27 15:32:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27587 states. [2019-12-27 15:32:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27587 to 19216. [2019-12-27 15:32:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19216 states. [2019-12-27 15:32:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19216 states to 19216 states and 57562 transitions. [2019-12-27 15:32:40,780 INFO L78 Accepts]: Start accepts. Automaton has 19216 states and 57562 transitions. Word has length 67 [2019-12-27 15:32:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:40,780 INFO L462 AbstractCegarLoop]: Abstraction has 19216 states and 57562 transitions. [2019-12-27 15:32:40,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 15:32:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 19216 states and 57562 transitions. [2019-12-27 15:32:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:32:40,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:40,798 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 15:32:40,798 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 15:32:40,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:40,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2010664093, now seen corresponding path program 3 times [2019-12-27 15:32:40,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:40,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978901663] [2019-12-27 15:32:40,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:40,955 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 15:32:40,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978901663] [2019-12-27 15:32:40,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:40,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:32:40,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1719561360] [2019-12-27 15:32:40,956 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:40,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:41,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 424 transitions. [2019-12-27 15:32:41,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:41,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 15:32:41,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:32:41,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:41,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:32:41,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:32:41,298 INFO L87 Difference]: Start difference. First operand 19216 states and 57562 transitions. Second operand 12 states. [2019-12-27 15:32:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:42,735 INFO L93 Difference]: Finished difference Result 24210 states and 71896 transitions. [2019-12-27 15:32:42,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:32:42,736 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 15:32:42,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:42,767 INFO L225 Difference]: With dead ends: 24210 [2019-12-27 15:32:42,767 INFO L226 Difference]: Without dead ends: 22442 [2019-12-27 15:32:42,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:32:42,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22442 states. [2019-12-27 15:32:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22442 to 19069. [2019-12-27 15:32:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19069 states. [2019-12-27 15:32:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19069 states to 19069 states and 57154 transitions. [2019-12-27 15:32:43,071 INFO L78 Accepts]: Start accepts. Automaton has 19069 states and 57154 transitions. Word has length 67 [2019-12-27 15:32:43,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:43,071 INFO L462 AbstractCegarLoop]: Abstraction has 19069 states and 57154 transitions. [2019-12-27 15:32:43,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:32:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 19069 states and 57154 transitions. [2019-12-27 15:32:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:32:43,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:43,092 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 15:32:43,092 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 15:32:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:43,093 INFO L82 PathProgramCache]: Analyzing trace with hash -809344243, now seen corresponding path program 4 times [2019-12-27 15:32:43,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:43,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388927415] [2019-12-27 15:32:43,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:43,289 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 15:32:43,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388927415] [2019-12-27 15:32:43,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:43,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:32:43,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1835474662] [2019-12-27 15:32:43,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:43,312 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:43,696 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 289 states and 588 transitions. [2019-12-27 15:32:43,696 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:43,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:32:43,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:32:43,884 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 15:32:43,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 15:32:43,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:43,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 15:32:43,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:32:43,885 INFO L87 Difference]: Start difference. First operand 19069 states and 57154 transitions. Second operand 17 states. [2019-12-27 15:32:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:48,261 INFO L93 Difference]: Finished difference Result 41904 states and 124469 transitions. [2019-12-27 15:32:48,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 15:32:48,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 15:32:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:48,315 INFO L225 Difference]: With dead ends: 41904 [2019-12-27 15:32:48,315 INFO L226 Difference]: Without dead ends: 41245 [2019-12-27 15:32:48,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=363, Invalid=1989, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 15:32:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41245 states. [2019-12-27 15:32:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41245 to 19021. [2019-12-27 15:32:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19021 states. [2019-12-27 15:32:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19021 states to 19021 states and 57038 transitions. [2019-12-27 15:32:48,745 INFO L78 Accepts]: Start accepts. Automaton has 19021 states and 57038 transitions. Word has length 67 [2019-12-27 15:32:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:48,745 INFO L462 AbstractCegarLoop]: Abstraction has 19021 states and 57038 transitions. [2019-12-27 15:32:48,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 15:32:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 19021 states and 57038 transitions. [2019-12-27 15:32:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:32:48,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:48,763 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 15:32:48,764 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 15:32:48,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:48,764 INFO L82 PathProgramCache]: Analyzing trace with hash -96373001, now seen corresponding path program 5 times [2019-12-27 15:32:48,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:48,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575586189] [2019-12-27 15:32:48,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:49,169 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 15:32:49,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575586189] [2019-12-27 15:32:49,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:49,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:32:49,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1245318309] [2019-12-27 15:32:49,170 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:49,190 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:49,555 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 472 transitions. [2019-12-27 15:32:49,555 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:49,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:32:49,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 15:32:49,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:49,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 15:32:49,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:32:49,676 INFO L87 Difference]: Start difference. First operand 19021 states and 57038 transitions. Second operand 15 states. [2019-12-27 15:32:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:56,203 INFO L93 Difference]: Finished difference Result 72431 states and 214760 transitions. [2019-12-27 15:32:56,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-27 15:32:56,204 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 15:32:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:56,275 INFO L225 Difference]: With dead ends: 72431 [2019-12-27 15:32:56,275 INFO L226 Difference]: Without dead ends: 51774 [2019-12-27 15:32:56,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3833 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1438, Invalid=9068, Unknown=0, NotChecked=0, Total=10506 [2019-12-27 15:32:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51774 states. [2019-12-27 15:32:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51774 to 18617. [2019-12-27 15:32:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2019-12-27 15:32:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 55706 transitions. [2019-12-27 15:32:56,793 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 55706 transitions. Word has length 67 [2019-12-27 15:32:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:56,793 INFO L462 AbstractCegarLoop]: Abstraction has 18617 states and 55706 transitions. [2019-12-27 15:32:56,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 15:32:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 55706 transitions. [2019-12-27 15:32:56,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:32:56,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:56,812 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 15:32:56,812 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 15:32:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:56,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 6 times [2019-12-27 15:32:56,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:56,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800996093] [2019-12-27 15:32:56,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:56,972 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 15:32:56,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800996093] [2019-12-27 15:32:56,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:56,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:32:56,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [663966569] [2019-12-27 15:32:56,973 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:56,995 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:57,645 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 242 states and 464 transitions. [2019-12-27 15:32:57,646 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:57,778 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 15:32:57,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:32:57,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:57,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:32:57,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:32:57,780 INFO L87 Difference]: Start difference. First operand 18617 states and 55706 transitions. Second operand 12 states. [2019-12-27 15:32:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:58,766 INFO L93 Difference]: Finished difference Result 31528 states and 93292 transitions. [2019-12-27 15:32:58,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:32:58,766 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 15:32:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:58,809 INFO L225 Difference]: With dead ends: 31528 [2019-12-27 15:32:58,809 INFO L226 Difference]: Without dead ends: 31305 [2019-12-27 15:32:58,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2019-12-27 15:32:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31305 states. [2019-12-27 15:32:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31305 to 18601. [2019-12-27 15:32:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18601 states. [2019-12-27 15:32:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18601 states to 18601 states and 55662 transitions. [2019-12-27 15:32:59,185 INFO L78 Accepts]: Start accepts. Automaton has 18601 states and 55662 transitions. Word has length 67 [2019-12-27 15:32:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:59,185 INFO L462 AbstractCegarLoop]: Abstraction has 18601 states and 55662 transitions. [2019-12-27 15:32:59,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:32:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 18601 states and 55662 transitions. [2019-12-27 15:32:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:32:59,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:59,207 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 15:32:59,207 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:32:59,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 7 times [2019-12-27 15:32:59,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:59,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423980234] [2019-12-27 15:32:59,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:32:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:32:59,325 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:32:59,326 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:32:59,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23|) |v_ULTIMATE.start_main_~#t44~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= v_~__unbuffered_p0_EBX~0_60 0) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t44~0.base_23|) (= 0 |v_ULTIMATE.start_main_~#t44~0.offset_18|) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23|) 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23| 1)) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t44~0.base_23| 4)) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ULTIMATE.start_main_~#t44~0.base=|v_ULTIMATE.start_main_~#t44~0.base_23|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t44~0.offset=|v_ULTIMATE.start_main_~#t44~0.offset_18|, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~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, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t46~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t45~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_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, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t46~0.offset, ULTIMATE.start_main_~#t45~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t44~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t44~0.offset, #NULL.base, ~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 15:32:59,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff0~0_Out1515219195 1) (= |P0Thread1of1ForFork2_#in~arg.base_In1515219195| P0Thread1of1ForFork2_~arg.base_Out1515219195) (= ~a$w_buff0_used~0_In1515219195 ~a$w_buff1_used~0_Out1515219195) (= ~a$w_buff0_used~0_Out1515219195 1) (= P0Thread1of1ForFork2_~arg.offset_Out1515219195 |P0Thread1of1ForFork2_#in~arg.offset_In1515219195|) (= ~a$w_buff0~0_In1515219195 ~a$w_buff1~0_Out1515219195) (= 0 (mod ~a$w_buff1_used~0_Out1515219195 256)) (= 1 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out1515219195|) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out1515219195 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out1515219195|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In1515219195|, ~a$w_buff0~0=~a$w_buff0~0_In1515219195, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1515219195, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In1515219195|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out1515219195, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In1515219195|, ~a$w_buff0~0=~a$w_buff0~0_Out1515219195, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out1515219195, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out1515219195, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out1515219195, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In1515219195|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out1515219195, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out1515219195, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out1515219195|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:32:59,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t45~0.base_13| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t45~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t45~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t45~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13|) |v_ULTIMATE.start_main_~#t45~0.offset_11| 1)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_13|, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t45~0.base, ULTIMATE.start_main_~#t45~0.offset] because there is no mapped edge [2019-12-27 15:32:59,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork0_#t~ite9_Out-390878081| |P1Thread1of1ForFork0_#t~ite10_Out-390878081|)) (.cse2 (= (mod ~a$w_buff1_used~0_In-390878081 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-390878081 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork0_#t~ite9_Out-390878081| ~a$w_buff1~0_In-390878081)) (and .cse1 (= |P1Thread1of1ForFork0_#t~ite9_Out-390878081| ~a~0_In-390878081) (or .cse2 .cse0)))) InVars {~a~0=~a~0_In-390878081, ~a$w_buff1~0=~a$w_buff1~0_In-390878081, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-390878081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-390878081} OutVars{~a~0=~a~0_In-390878081, ~a$w_buff1~0=~a$w_buff1~0_In-390878081, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out-390878081|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-390878081, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-390878081|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-390878081} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 15:32:59,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In260297116 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In260297116 256)))) (or (and (= ~a$w_buff0_used~0_In260297116 |P1Thread1of1ForFork0_#t~ite11_Out260297116|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out260297116|) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In260297116, ~a$w_buff0_used~0=~a$w_buff0_used~0_In260297116} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In260297116, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out260297116|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In260297116} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 15:32:59,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-457904035 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-457904035 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-457904035 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-457904035 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite12_Out-457904035| ~a$w_buff1_used~0_In-457904035) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite12_Out-457904035| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-457904035, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-457904035, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-457904035, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-457904035} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-457904035, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-457904035, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-457904035|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-457904035, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-457904035} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 15:32:59,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In240580023 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In240580023 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In240580023 |P1Thread1of1ForFork0_#t~ite13_Out240580023|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out240580023|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In240580023, ~a$w_buff0_used~0=~a$w_buff0_used~0_In240580023} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In240580023, ~a$w_buff0_used~0=~a$w_buff0_used~0_In240580023, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out240580023|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 15:32:59,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1206904470 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1206904470 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1206904470 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-1206904470 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite14_Out-1206904470| 0)) (and (= |P1Thread1of1ForFork0_#t~ite14_Out-1206904470| ~a$r_buff1_thd2~0_In-1206904470) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1206904470, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1206904470, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1206904470, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1206904470} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1206904470, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1206904470, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1206904470, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-1206904470|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1206904470} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 15:32:59,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_28|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_27|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 15:32:59,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t46~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t46~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12|) |v_ULTIMATE.start_main_~#t46~0.offset_10| 2))) (not (= 0 |v_ULTIMATE.start_main_~#t46~0.base_12|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t46~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_12|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t46~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t46~0.offset] because there is no mapped edge [2019-12-27 15:32:59,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1562016169 256)))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1562016169 256) 0))) (or (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1562016169 256))) (= 0 (mod ~a$w_buff0_used~0_In-1562016169 256)) (and (= (mod ~a$w_buff1_used~0_In-1562016169 256) 0) .cse0))) (= |P2Thread1of1ForFork1_#t~ite21_Out-1562016169| |P2Thread1of1ForFork1_#t~ite20_Out-1562016169|) (= ~a$w_buff0~0_In-1562016169 |P2Thread1of1ForFork1_#t~ite20_Out-1562016169|) .cse1) (and (= ~a$w_buff0~0_In-1562016169 |P2Thread1of1ForFork1_#t~ite21_Out-1562016169|) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite20_In-1562016169| |P2Thread1of1ForFork1_#t~ite20_Out-1562016169|)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-1562016169|, ~a$w_buff0~0=~a$w_buff0~0_In-1562016169, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1562016169, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1562016169, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1562016169, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1562016169, ~weak$$choice2~0=~weak$$choice2~0_In-1562016169} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-1562016169|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-1562016169|, ~a$w_buff0~0=~a$w_buff0~0_In-1562016169, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1562016169, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1562016169, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1562016169, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1562016169, ~weak$$choice2~0=~weak$$choice2~0_In-1562016169} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 15:32:59,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In888594691 256) 0))) (or (and (= ~a$w_buff0_used~0_In888594691 |P2Thread1of1ForFork1_#t~ite27_Out888594691|) (= |P2Thread1of1ForFork1_#t~ite26_In888594691| |P2Thread1of1ForFork1_#t~ite26_Out888594691|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite27_Out888594691| |P2Thread1of1ForFork1_#t~ite26_Out888594691|) (= ~a$w_buff0_used~0_In888594691 |P2Thread1of1ForFork1_#t~ite26_Out888594691|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In888594691 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In888594691 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In888594691 256)) .cse1) (and (= (mod ~a$w_buff1_used~0_In888594691 256) 0) .cse1)))))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In888594691|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In888594691, ~a$w_buff0_used~0=~a$w_buff0_used~0_In888594691, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In888594691, ~a$w_buff1_used~0=~a$w_buff1_used~0_In888594691, ~weak$$choice2~0=~weak$$choice2~0_In888594691} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out888594691|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out888594691|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In888594691, ~a$w_buff0_used~0=~a$w_buff0_used~0_In888594691, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In888594691, ~a$w_buff1_used~0=~a$w_buff1_used~0_In888594691, ~weak$$choice2~0=~weak$$choice2~0_In888594691} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 15:32:59,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 15:32:59,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 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{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 15:32:59,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In312859397 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In312859397 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out312859397| ~a~0_In312859397)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In312859397 |P2Thread1of1ForFork1_#t~ite38_Out312859397|)))) InVars {~a~0=~a~0_In312859397, ~a$w_buff1~0=~a$w_buff1~0_In312859397, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In312859397, ~a$w_buff1_used~0=~a$w_buff1_used~0_In312859397} OutVars{~a~0=~a~0_In312859397, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out312859397|, ~a$w_buff1~0=~a$w_buff1~0_In312859397, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In312859397, ~a$w_buff1_used~0=~a$w_buff1_used~0_In312859397} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 15:32:59,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_14|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_14|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_13|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 15:32:59,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1950073266 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1950073266 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1950073266 |P2Thread1of1ForFork1_#t~ite40_Out-1950073266|)) (and (= |P2Thread1of1ForFork1_#t~ite40_Out-1950073266| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1950073266, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1950073266} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1950073266, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1950073266, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-1950073266|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 15:32:59,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-229354705 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-229354705 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-229354705 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-229354705 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite41_Out-229354705| 0)) (and (= |P2Thread1of1ForFork1_#t~ite41_Out-229354705| ~a$w_buff1_used~0_In-229354705) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-229354705, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-229354705, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-229354705, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-229354705} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-229354705, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-229354705, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-229354705, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-229354705|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-229354705} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 15:32:59,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-203227650 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-203227650 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-203227650|) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite42_Out-203227650| ~a$r_buff0_thd3~0_In-203227650) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-203227650, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-203227650} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-203227650|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-203227650, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-203227650} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 15:32:59,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-706771845 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-706771845 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-706771845 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-706771845 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In-706771845 |P2Thread1of1ForFork1_#t~ite43_Out-706771845|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out-706771845|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-706771845, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-706771845, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-706771845, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-706771845} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-706771845|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-706771845, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-706771845, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-706771845, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-706771845} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 15:32:59,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_34|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 15:32:59,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In461379658 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In461379658 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out461379658|)) (and (= ~a$w_buff0_used~0_In461379658 |P0Thread1of1ForFork2_#t~ite5_Out461379658|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In461379658, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In461379658} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out461379658|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In461379658, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In461379658} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 15:32:59,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In700597543 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In700597543 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In700597543 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In700597543 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In700597543 |P0Thread1of1ForFork2_#t~ite6_Out700597543|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork2_#t~ite6_Out700597543|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In700597543, ~a$w_buff0_used~0=~a$w_buff0_used~0_In700597543, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In700597543, ~a$w_buff1_used~0=~a$w_buff1_used~0_In700597543} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In700597543, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out700597543|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In700597543, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In700597543, ~a$w_buff1_used~0=~a$w_buff1_used~0_In700597543} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 15:32:59,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-2002839715 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2002839715 256)))) (or (and (= ~a$r_buff0_thd1~0_Out-2002839715 ~a$r_buff0_thd1~0_In-2002839715) (or .cse0 .cse1)) (and (= ~a$r_buff0_thd1~0_Out-2002839715 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2002839715, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2002839715} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-2002839715|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2002839715, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-2002839715} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:32:59,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In1813390950 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In1813390950 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1813390950 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1813390950 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite8_Out1813390950| ~a$r_buff1_thd1~0_In1813390950)) (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out1813390950|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1813390950, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1813390950, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1813390950, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1813390950} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1813390950|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1813390950, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1813390950, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1813390950, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1813390950} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 15:32:59,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_44| v_~a$r_buff1_thd1~0_72) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_43|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 15:32:59,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~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 15:32:59,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-445823421 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-445823421 256)))) (or (and (not .cse0) (= ~a$w_buff1~0_In-445823421 |ULTIMATE.start_main_#t~ite47_Out-445823421|) (not .cse1)) (and (= ~a~0_In-445823421 |ULTIMATE.start_main_#t~ite47_Out-445823421|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-445823421, ~a$w_buff1~0=~a$w_buff1~0_In-445823421, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-445823421, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-445823421} OutVars{~a~0=~a~0_In-445823421, ~a$w_buff1~0=~a$w_buff1~0_In-445823421, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-445823421|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-445823421, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-445823421} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 15:32:59,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 15:32:59,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-334487422 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-334487422 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-334487422| ~a$w_buff0_used~0_In-334487422)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-334487422| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-334487422, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-334487422} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-334487422, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-334487422|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-334487422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 15:32:59,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1932199142 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-1932199142 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1932199142 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1932199142 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1932199142| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In-1932199142 |ULTIMATE.start_main_#t~ite50_Out-1932199142|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1932199142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1932199142, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1932199142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1932199142} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1932199142|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1932199142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1932199142, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1932199142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1932199142} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 15:32:59,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In603439160 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In603439160 256)))) (or (and (= ~a$r_buff0_thd0~0_In603439160 |ULTIMATE.start_main_#t~ite51_Out603439160|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out603439160|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In603439160, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In603439160} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out603439160|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In603439160, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In603439160} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 15:32:59,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In-2122023799 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-2122023799 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-2122023799 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-2122023799 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-2122023799| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out-2122023799| ~a$r_buff1_thd0~0_In-2122023799) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2122023799, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2122023799, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2122023799, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2122023799} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2122023799|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2122023799, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2122023799, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2122023799, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2122023799} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 15:32:59,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_21 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} 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 15:32:59,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:32:59 BasicIcfg [2019-12-27 15:32:59,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:32:59,490 INFO L168 Benchmark]: Toolchain (without parser) took 148141.56 ms. Allocated memory was 138.4 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 100.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 15:32:59,491 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 15:32:59,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.47 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 156.1 MB in the end (delta: -56.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:59,492 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.69 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:59,492 INFO L168 Benchmark]: Boogie Preprocessor took 45.39 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:59,495 INFO L168 Benchmark]: RCFGBuilder took 847.79 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 99.7 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:59,495 INFO L168 Benchmark]: TraceAbstraction took 146386.68 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 15:32:59,502 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.17 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.47 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 156.1 MB in the end (delta: -56.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.69 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.39 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.79 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 99.7 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 146386.68 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t44, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t45, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L783] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L760] 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) [L783] 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) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 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 [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t46, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 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) [L808] 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)) [L809] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=7, weak$$choice2=1, 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))=0, x=1, y=1, z=1] [L809] 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)) [L810] 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)) [L811] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=7, 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=1, z=1] [L811] 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)) [L813] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=7, 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=1, z=1] [L813] 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)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 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 [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 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 [L852] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, 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=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 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 [L855] 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, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 146.0s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 67.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8553 SDtfs, 13504 SDslu, 38076 SDs, 0 SdLazy, 32151 SolverSat, 937 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 832 GetRequests, 158 SyntacticMatches, 48 SemanticMatches, 626 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11511 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162301occurred 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: 39.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 473726 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1487 NumberOfCodeBlocks, 1487 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1391 ConstructedInterpolants, 0 QuantifiedInterpolants, 336318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...