/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-divine/divinefifo_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:04:33,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:04:33,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:04:33,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:04:33,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:04:33,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:04:33,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:04:33,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:04:33,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:04:33,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:04:33,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:04:33,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:04:33,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:04:33,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:04:33,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:04:33,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:04:33,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:04:33,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:04:33,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:04:33,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:04:33,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:04:33,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:04:33,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:04:33,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:04:33,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:04:33,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:04:33,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:04:33,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:04:33,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:04:33,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:04:33,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:04:33,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:04:33,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:04:33,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:04:33,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:04:33,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:04:33,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:04:33,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:04:33,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:04:33,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:04:33,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:04:33,175 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 19:04:33,189 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:04:33,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:04:33,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:04:33,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:04:33,190 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:04:33,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:04:33,191 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:04:33,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:04:33,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:04:33,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:04:33,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:04:33,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:04:33,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:04:33,192 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:04:33,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:04:33,192 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:04:33,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:04:33,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:04:33,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:04:33,193 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:04:33,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:04:33,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:04:33,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:04:33,194 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:04:33,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:04:33,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:04:33,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:04:33,195 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:04:33,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:04:33,195 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:04:33,195 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:04:33,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:04:33,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:04:33,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:04:33,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:04:33,492 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:04:33,494 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2019-12-27 19:04:33,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5508d306e/6d3bff8cb08f4b09a09bed96d0a72435/FLAG25f3b2953 [2019-12-27 19:04:34,181 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:04:34,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2019-12-27 19:04:34,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5508d306e/6d3bff8cb08f4b09a09bed96d0a72435/FLAG25f3b2953 [2019-12-27 19:04:34,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5508d306e/6d3bff8cb08f4b09a09bed96d0a72435 [2019-12-27 19:04:34,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:04:34,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:04:34,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:04:34,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:04:34,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:04:34,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:34" (1/1) ... [2019-12-27 19:04:34,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430e80b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:34, skipping insertion in model container [2019-12-27 19:04:34,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:34" (1/1) ... [2019-12-27 19:04:34,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:04:34,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:04:34,699 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 19:04:35,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:04:35,132 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:04:35,144 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 19:04:35,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:04:35,363 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:04:35,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35 WrapperNode [2019-12-27 19:04:35,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:04:35,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:04:35,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:04:35,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:04:35,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 19:04:35,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 19:04:35,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:04:35,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:04:35,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:04:35,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:04:35,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 19:04:35,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 19:04:35,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 19:04:35,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 19:04:35,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 19:04:35,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 19:04:35,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (1/1) ... [2019-12-27 19:04:35,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:04:35,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:04:35,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:04:35,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:04:35,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (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 19:04:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2019-12-27 19:04:35,603 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2019-12-27 19:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-27 19:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 19:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:04:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-27 19:04:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 19:04:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:04:35,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:04:35,607 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 19:04:36,659 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:04:36,660 INFO L287 CfgBuilder]: Removed 40 assume(true) statements. [2019-12-27 19:04:36,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:36 BoogieIcfgContainer [2019-12-27 19:04:36,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:04:36,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:04:36,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:04:36,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:04:36,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:04:34" (1/3) ... [2019-12-27 19:04:36,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a047eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:36, skipping insertion in model container [2019-12-27 19:04:36,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:35" (2/3) ... [2019-12-27 19:04:36,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a047eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:36, skipping insertion in model container [2019-12-27 19:04:36,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:36" (3/3) ... [2019-12-27 19:04:36,671 INFO L109 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.i [2019-12-27 19:04:36,681 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:04:36,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:04:36,692 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-12-27 19:04:36,693 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:04:36,761 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,761 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,761 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,762 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,762 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,763 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,763 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,763 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,763 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,764 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,764 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,764 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,765 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,765 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,765 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,765 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,765 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,766 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,766 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,766 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,767 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,767 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,767 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,767 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,767 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,767 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,768 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,768 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,768 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,768 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,768 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,768 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,769 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,769 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,769 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,769 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,769 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,769 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,770 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,770 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,770 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,770 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,770 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,770 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,771 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,771 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,771 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,771 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,771 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,772 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,772 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,772 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,772 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,772 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,772 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,773 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,773 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,773 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,774 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,774 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,774 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,774 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,774 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,775 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,775 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,775 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,775 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,775 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,776 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,776 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,776 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,776 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,777 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,777 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,777 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,777 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,778 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,778 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,778 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,778 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,779 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,779 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,779 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,779 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,780 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,780 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,780 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,780 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,781 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,781 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,781 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,781 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,781 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,782 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,782 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,782 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,782 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,783 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,783 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,783 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,783 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,784 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,784 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,784 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,784 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,784 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,785 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,785 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,785 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,785 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,785 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,786 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,786 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,786 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,786 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,787 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,787 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,787 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,787 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,788 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,788 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,788 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,788 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,788 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,789 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,789 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,789 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,789 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,789 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,790 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,790 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,790 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,790 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,790 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,790 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,790 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,791 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,791 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,791 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,791 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,791 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,792 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,792 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,792 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,792 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,793 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,793 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,793 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,793 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,794 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,794 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,794 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,794 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,795 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,795 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,795 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,795 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,796 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,796 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,796 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,796 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,797 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,797 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,797 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,797 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,798 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,798 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,798 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,798 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,799 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,799 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,799 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,799 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,799 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,800 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,800 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,800 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,800 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,800 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,801 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,801 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,801 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,801 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,801 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,802 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,802 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,802 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,802 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,802 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,803 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,806 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,806 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,807 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,807 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,807 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,807 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,807 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,808 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,808 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,808 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,808 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,809 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,809 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,809 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,809 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,810 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,810 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,810 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,811 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,811 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,811 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,811 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,812 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,812 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,812 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,813 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,813 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,813 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,813 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,814 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,814 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,814 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,815 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,815 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,815 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,815 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,816 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,816 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,816 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,816 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,816 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,817 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,817 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,817 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:36,841 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-27 19:04:36,866 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:04:36,866 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:04:36,866 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:04:36,866 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:04:36,866 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:04:36,867 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:04:36,867 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:04:36,867 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:04:36,890 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 443 transitions [2019-12-27 19:04:36,892 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 415 places, 443 transitions [2019-12-27 19:04:37,116 INFO L132 PetriNetUnfolder]: 32/442 cut-off events. [2019-12-27 19:04:37,117 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 19:04:37,140 INFO L76 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 442 events. 32/442 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1074 event pairs. 0/399 useless extension candidates. Maximal degree in co-relation 316. Up to 3 conditions per place. [2019-12-27 19:04:37,193 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 415 places, 443 transitions [2019-12-27 19:04:37,308 INFO L132 PetriNetUnfolder]: 32/442 cut-off events. [2019-12-27 19:04:37,308 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 19:04:37,329 INFO L76 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 442 events. 32/442 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1074 event pairs. 0/399 useless extension candidates. Maximal degree in co-relation 316. Up to 3 conditions per place. [2019-12-27 19:04:37,378 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 30326 [2019-12-27 19:04:37,379 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:04:38,932 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:38,952 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:38,953 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:38,954 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2019-12-27 19:04:39,323 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:39,336 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:39,337 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:39,337 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2019-12-27 19:04:41,558 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:41,573 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:41,574 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:41,574 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:74 [2019-12-27 19:04:44,059 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-27 19:04:47,376 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-27 19:04:47,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:04:47,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:04:49,073 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2019-12-27 19:04:49,367 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 19:04:49,545 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-12-27 19:04:49,730 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-12-27 19:04:52,209 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 151 DAG size of output: 139 [2019-12-27 19:04:52,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:04:52,236 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:52,252 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:54,242 WARN L192 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 131 [2019-12-27 19:04:54,243 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:54,244 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-12-27 19:04:54,245 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:539, output treesize:557 [2019-12-27 19:04:56,347 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 135 [2019-12-27 19:04:57,913 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 157 DAG size of output: 133 [2019-12-27 19:04:58,343 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-12-27 19:04:59,749 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 169 DAG size of output: 163 [2019-12-27 19:04:59,788 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:00,318 WARN L192 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-12-27 19:05:00,319 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:00,320 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:00,320 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:452, output treesize:494 [2019-12-27 19:05:00,823 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-12-27 19:05:01,342 INFO L206 etLargeBlockEncoding]: Checked pairs total: 106197 [2019-12-27 19:05:01,342 INFO L214 etLargeBlockEncoding]: Total number of compositions: 458 [2019-12-27 19:05:01,346 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 121 transitions [2019-12-27 19:05:01,407 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1414 states. [2019-12-27 19:05:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states. [2019-12-27 19:05:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 19:05:01,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:01,416 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 19:05:01,417 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:01,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:01,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1581, now seen corresponding path program 1 times [2019-12-27 19:05:01,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:01,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615107205] [2019-12-27 19:05:01,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:01,554 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 19:05:01,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615107205] [2019-12-27 19:05:01,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:01,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 19:05:01,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1353623285] [2019-12-27 19:05:01,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:01,562 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:01,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 2 states and 1 transitions. [2019-12-27 19:05:01,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:01,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:05:01,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 19:05:01,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:01,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 19:05:01,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 19:05:01,593 INFO L87 Difference]: Start difference. First operand 1414 states. Second operand 2 states. [2019-12-27 19:05:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:01,650 INFO L93 Difference]: Finished difference Result 1413 states and 3158 transitions. [2019-12-27 19:05:01,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 19:05:01,651 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 19:05:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:01,683 INFO L225 Difference]: With dead ends: 1413 [2019-12-27 19:05:01,683 INFO L226 Difference]: Without dead ends: 1412 [2019-12-27 19:05:01,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 19:05:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2019-12-27 19:05:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2019-12-27 19:05:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-12-27 19:05:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 3157 transitions. [2019-12-27 19:05:01,896 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 3157 transitions. Word has length 1 [2019-12-27 19:05:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:01,897 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 3157 transitions. [2019-12-27 19:05:01,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 19:05:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 3157 transitions. [2019-12-27 19:05:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 19:05:01,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:01,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 19:05:01,898 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:01,899 INFO L82 PathProgramCache]: Analyzing trace with hash -965036191, now seen corresponding path program 1 times [2019-12-27 19:05:01,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:01,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087987862] [2019-12-27 19:05:01,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:02,020 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 19:05:02,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087987862] [2019-12-27 19:05:02,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:02,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:05:02,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1829685393] [2019-12-27 19:05:02,021 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:02,022 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:02,023 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 7 states and 6 transitions. [2019-12-27 19:05:02,023 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:02,024 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:05:02,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:05:02,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:02,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:05:02,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:05:02,026 INFO L87 Difference]: Start difference. First operand 1412 states and 3157 transitions. Second operand 3 states. [2019-12-27 19:05:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:02,093 INFO L93 Difference]: Finished difference Result 2647 states and 5928 transitions. [2019-12-27 19:05:02,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:05:02,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-27 19:05:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:02,111 INFO L225 Difference]: With dead ends: 2647 [2019-12-27 19:05:02,111 INFO L226 Difference]: Without dead ends: 2647 [2019-12-27 19:05:02,112 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 19:05:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-12-27 19:05:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1431. [2019-12-27 19:05:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-12-27 19:05:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3197 transitions. [2019-12-27 19:05:02,166 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3197 transitions. Word has length 6 [2019-12-27 19:05:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:02,166 INFO L462 AbstractCegarLoop]: Abstraction has 1431 states and 3197 transitions. [2019-12-27 19:05:02,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:05:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3197 transitions. [2019-12-27 19:05:02,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:05:02,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:02,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:02,167 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:02,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:02,168 INFO L82 PathProgramCache]: Analyzing trace with hash 146313941, now seen corresponding path program 1 times [2019-12-27 19:05:02,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:02,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123031076] [2019-12-27 19:05:02,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:02,301 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 19:05:02,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123031076] [2019-12-27 19:05:02,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:02,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:05:02,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389656943] [2019-12-27 19:05:02,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:02,303 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:02,304 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 19:05:02,304 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:02,305 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:05:02,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:05:02,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:02,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:05:02,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:05:02,307 INFO L87 Difference]: Start difference. First operand 1431 states and 3197 transitions. Second operand 3 states. [2019-12-27 19:05:02,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:02,330 INFO L93 Difference]: Finished difference Result 1431 states and 3178 transitions. [2019-12-27 19:05:02,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:05:02,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 19:05:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:02,339 INFO L225 Difference]: With dead ends: 1431 [2019-12-27 19:05:02,339 INFO L226 Difference]: Without dead ends: 1431 [2019-12-27 19:05:02,341 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 19:05:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-27 19:05:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2019-12-27 19:05:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-12-27 19:05:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3178 transitions. [2019-12-27 19:05:02,379 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3178 transitions. Word has length 7 [2019-12-27 19:05:02,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:02,380 INFO L462 AbstractCegarLoop]: Abstraction has 1431 states and 3178 transitions. [2019-12-27 19:05:02,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:05:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3178 transitions. [2019-12-27 19:05:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 19:05:02,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:02,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:02,382 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:02,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:02,382 INFO L82 PathProgramCache]: Analyzing trace with hash 246365665, now seen corresponding path program 1 times [2019-12-27 19:05:02,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:02,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519399252] [2019-12-27 19:05:02,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:02,576 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 19:05:02,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519399252] [2019-12-27 19:05:02,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:02,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:05:02,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267008579] [2019-12-27 19:05:02,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:02,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:02,579 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 19:05:02,579 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:02,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:05:02,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:05:02,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:02,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:05:02,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:05:02,581 INFO L87 Difference]: Start difference. First operand 1431 states and 3178 transitions. Second operand 6 states. [2019-12-27 19:05:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:03,159 INFO L93 Difference]: Finished difference Result 1817 states and 4039 transitions. [2019-12-27 19:05:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:05:03,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-12-27 19:05:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:03,168 INFO L225 Difference]: With dead ends: 1817 [2019-12-27 19:05:03,169 INFO L226 Difference]: Without dead ends: 1817 [2019-12-27 19:05:03,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:05:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2019-12-27 19:05:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1538. [2019-12-27 19:05:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-12-27 19:05:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 3423 transitions. [2019-12-27 19:05:03,210 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 3423 transitions. Word has length 8 [2019-12-27 19:05:03,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:03,211 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 3423 transitions. [2019-12-27 19:05:03,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:05:03,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 3423 transitions. [2019-12-27 19:05:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 19:05:03,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:03,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:03,213 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:03,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:03,213 INFO L82 PathProgramCache]: Analyzing trace with hash 534612052, now seen corresponding path program 1 times [2019-12-27 19:05:03,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:03,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460089038] [2019-12-27 19:05:03,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:03,251 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 19:05:03,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460089038] [2019-12-27 19:05:03,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:03,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:05:03,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431014671] [2019-12-27 19:05:03,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:03,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:03,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 19:05:03,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:03,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:05:03,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:05:03,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:03,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:05:03,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:05:03,257 INFO L87 Difference]: Start difference. First operand 1538 states and 3423 transitions. Second operand 3 states. [2019-12-27 19:05:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:03,330 INFO L93 Difference]: Finished difference Result 2508 states and 5570 transitions. [2019-12-27 19:05:03,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:05:03,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 19:05:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:03,344 INFO L225 Difference]: With dead ends: 2508 [2019-12-27 19:05:03,345 INFO L226 Difference]: Without dead ends: 2508 [2019-12-27 19:05:03,345 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 19:05:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-12-27 19:05:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 1595. [2019-12-27 19:05:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-27 19:05:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3543 transitions. [2019-12-27 19:05:03,393 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3543 transitions. Word has length 10 [2019-12-27 19:05:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:03,394 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 3543 transitions. [2019-12-27 19:05:03,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:05:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3543 transitions. [2019-12-27 19:05:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:05:03,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:03,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:03,397 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:03,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2116295203, now seen corresponding path program 1 times [2019-12-27 19:05:03,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:03,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334764819] [2019-12-27 19:05:03,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:03,508 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 19:05:03,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334764819] [2019-12-27 19:05:03,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:03,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:05:03,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1825030484] [2019-12-27 19:05:03,509 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:03,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:03,517 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 54 transitions. [2019-12-27 19:05:03,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:03,631 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:05:03,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:05:03,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:03,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:05:03,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:05:03,633 INFO L87 Difference]: Start difference. First operand 1595 states and 3543 transitions. Second operand 12 states. [2019-12-27 19:05:04,556 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-12-27 19:05:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:06,584 INFO L93 Difference]: Finished difference Result 2225 states and 4898 transitions. [2019-12-27 19:05:06,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 19:05:06,585 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2019-12-27 19:05:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:06,599 INFO L225 Difference]: With dead ends: 2225 [2019-12-27 19:05:06,599 INFO L226 Difference]: Without dead ends: 2225 [2019-12-27 19:05:06,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:05:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2019-12-27 19:05:06,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 1609. [2019-12-27 19:05:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-12-27 19:05:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3575 transitions. [2019-12-27 19:05:06,646 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3575 transitions. Word has length 14 [2019-12-27 19:05:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:06,647 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3575 transitions. [2019-12-27 19:05:06,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:05:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3575 transitions. [2019-12-27 19:05:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:05:06,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:06,653 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:06,653 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:06,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1320004501, now seen corresponding path program 2 times [2019-12-27 19:05:06,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:06,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525587256] [2019-12-27 19:05:06,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:06,864 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 19:05:06,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525587256] [2019-12-27 19:05:06,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:06,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:05:06,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1524688303] [2019-12-27 19:05:06,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:06,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:06,873 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 38 transitions. [2019-12-27 19:05:06,873 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:06,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:05:06,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:06,884 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 19:05:06,884 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:18 [2019-12-27 19:05:07,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:05:07,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:05:07,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:07,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:05:07,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:05:07,156 INFO L87 Difference]: Start difference. First operand 1609 states and 3575 transitions. Second operand 17 states. [2019-12-27 19:05:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:12,821 INFO L93 Difference]: Finished difference Result 2124 states and 4611 transitions. [2019-12-27 19:05:12,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 19:05:12,822 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-12-27 19:05:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:12,835 INFO L225 Difference]: With dead ends: 2124 [2019-12-27 19:05:12,835 INFO L226 Difference]: Without dead ends: 2124 [2019-12-27 19:05:12,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 19:05:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2019-12-27 19:05:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1604. [2019-12-27 19:05:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-12-27 19:05:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3563 transitions. [2019-12-27 19:05:12,873 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3563 transitions. Word has length 14 [2019-12-27 19:05:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:12,874 INFO L462 AbstractCegarLoop]: Abstraction has 1604 states and 3563 transitions. [2019-12-27 19:05:12,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:05:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3563 transitions. [2019-12-27 19:05:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:05:12,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:12,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:12,875 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:12,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1287222187, now seen corresponding path program 1 times [2019-12-27 19:05:12,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:12,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347043399] [2019-12-27 19:05:12,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:13,112 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 19:05:13,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347043399] [2019-12-27 19:05:13,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:13,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:05:13,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [83848342] [2019-12-27 19:05:13,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:13,116 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:13,119 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 19:05:13,119 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:13,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:05:13,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:05:13,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:13,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:05:13,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:05:13,121 INFO L87 Difference]: Start difference. First operand 1604 states and 3563 transitions. Second operand 8 states. [2019-12-27 19:05:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:14,279 INFO L93 Difference]: Finished difference Result 2382 states and 5288 transitions. [2019-12-27 19:05:14,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:05:14,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-27 19:05:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:14,291 INFO L225 Difference]: With dead ends: 2382 [2019-12-27 19:05:14,291 INFO L226 Difference]: Without dead ends: 2345 [2019-12-27 19:05:14,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:05:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2019-12-27 19:05:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1762. [2019-12-27 19:05:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2019-12-27 19:05:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 3963 transitions. [2019-12-27 19:05:14,332 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 3963 transitions. Word has length 14 [2019-12-27 19:05:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:14,332 INFO L462 AbstractCegarLoop]: Abstraction has 1762 states and 3963 transitions. [2019-12-27 19:05:14,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:05:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 3963 transitions. [2019-12-27 19:05:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:05:14,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:14,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:14,334 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2126637629, now seen corresponding path program 1 times [2019-12-27 19:05:14,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:14,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859924359] [2019-12-27 19:05:14,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:14,479 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 19:05:14,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859924359] [2019-12-27 19:05:14,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:14,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:05:14,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [958499647] [2019-12-27 19:05:14,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:14,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:14,489 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 63 transitions. [2019-12-27 19:05:14,490 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:14,543 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:05:14,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:05:14,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:14,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:05:14,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:05:14,544 INFO L87 Difference]: Start difference. First operand 1762 states and 3963 transitions. Second operand 9 states. [2019-12-27 19:05:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:15,768 INFO L93 Difference]: Finished difference Result 2001 states and 4465 transitions. [2019-12-27 19:05:15,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:05:15,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 19:05:15,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:15,779 INFO L225 Difference]: With dead ends: 2001 [2019-12-27 19:05:15,779 INFO L226 Difference]: Without dead ends: 2001 [2019-12-27 19:05:15,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:05:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-12-27 19:05:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1741. [2019-12-27 19:05:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-12-27 19:05:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 3899 transitions. [2019-12-27 19:05:15,815 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 3899 transitions. Word has length 15 [2019-12-27 19:05:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:15,816 INFO L462 AbstractCegarLoop]: Abstraction has 1741 states and 3899 transitions. [2019-12-27 19:05:15,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:05:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 3899 transitions. [2019-12-27 19:05:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:05:15,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:15,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:15,817 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:15,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:15,817 INFO L82 PathProgramCache]: Analyzing trace with hash -287376241, now seen corresponding path program 2 times [2019-12-27 19:05:15,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:15,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304905612] [2019-12-27 19:05:15,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:16,398 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 19:05:16,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304905612] [2019-12-27 19:05:16,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:16,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 19:05:16,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [852798434] [2019-12-27 19:05:16,399 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:16,401 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:16,406 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 51 transitions. [2019-12-27 19:05:16,407 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:16,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 19:05:16,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 19:05:16,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:16,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 19:05:16,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:05:16,860 INFO L87 Difference]: Start difference. First operand 1741 states and 3899 transitions. Second operand 23 states. [2019-12-27 19:05:17,693 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-12-27 19:05:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:21,054 INFO L93 Difference]: Finished difference Result 2470 states and 5461 transitions. [2019-12-27 19:05:21,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 19:05:21,054 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 15 [2019-12-27 19:05:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:21,064 INFO L225 Difference]: With dead ends: 2470 [2019-12-27 19:05:21,064 INFO L226 Difference]: Without dead ends: 2470 [2019-12-27 19:05:21,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=381, Invalid=1179, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 19:05:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-12-27 19:05:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 1765. [2019-12-27 19:05:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-12-27 19:05:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 3955 transitions. [2019-12-27 19:05:21,104 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 3955 transitions. Word has length 15 [2019-12-27 19:05:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:21,105 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 3955 transitions. [2019-12-27 19:05:21,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 19:05:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 3955 transitions. [2019-12-27 19:05:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:05:21,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:21,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:21,106 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:21,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:21,107 INFO L82 PathProgramCache]: Analyzing trace with hash 456627383, now seen corresponding path program 1 times [2019-12-27 19:05:21,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:21,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709328770] [2019-12-27 19:05:21,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:21,240 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 19:05:21,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709328770] [2019-12-27 19:05:21,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:21,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:05:21,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1350126295] [2019-12-27 19:05:21,241 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:21,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:21,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 45 transitions. [2019-12-27 19:05:21,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:21,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:05:21,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:05:21,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:21,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:05:21,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:05:21,315 INFO L87 Difference]: Start difference. First operand 1765 states and 3955 transitions. Second operand 13 states. [2019-12-27 19:05:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:23,886 INFO L93 Difference]: Finished difference Result 2490 states and 5508 transitions. [2019-12-27 19:05:23,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 19:05:23,887 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-27 19:05:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:23,893 INFO L225 Difference]: With dead ends: 2490 [2019-12-27 19:05:23,894 INFO L226 Difference]: Without dead ends: 2490 [2019-12-27 19:05:23,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2019-12-27 19:05:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2019-12-27 19:05:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 1817. [2019-12-27 19:05:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2019-12-27 19:05:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 4076 transitions. [2019-12-27 19:05:23,935 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 4076 transitions. Word has length 15 [2019-12-27 19:05:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:23,935 INFO L462 AbstractCegarLoop]: Abstraction has 1817 states and 4076 transitions. [2019-12-27 19:05:23,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:05:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 4076 transitions. [2019-12-27 19:05:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:05:23,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:23,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:23,937 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:23,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:23,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1240586563, now seen corresponding path program 3 times [2019-12-27 19:05:23,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:23,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416190979] [2019-12-27 19:05:23,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:24,400 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 19:05:24,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416190979] [2019-12-27 19:05:24,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:24,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 19:05:24,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1958511474] [2019-12-27 19:05:24,402 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:24,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:24,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 43 transitions. [2019-12-27 19:05:24,407 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:24,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 19:05:24,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 19:05:24,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:24,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 19:05:24,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:05:24,764 INFO L87 Difference]: Start difference. First operand 1817 states and 4076 transitions. Second operand 24 states. [2019-12-27 19:05:26,242 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 46 [2019-12-27 19:05:26,574 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 48 [2019-12-27 19:05:26,849 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 45 [2019-12-27 19:05:27,147 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 48 [2019-12-27 19:05:27,393 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-12-27 19:05:28,349 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2019-12-27 19:05:28,765 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 51 [2019-12-27 19:05:32,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:32,222 INFO L93 Difference]: Finished difference Result 2521 states and 5566 transitions. [2019-12-27 19:05:32,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 19:05:32,223 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 15 [2019-12-27 19:05:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:32,228 INFO L225 Difference]: With dead ends: 2521 [2019-12-27 19:05:32,229 INFO L226 Difference]: Without dead ends: 2521 [2019-12-27 19:05:32,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=624, Invalid=2456, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 19:05:32,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2019-12-27 19:05:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 1821. [2019-12-27 19:05:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-12-27 19:05:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 4084 transitions. [2019-12-27 19:05:32,267 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 4084 transitions. Word has length 15 [2019-12-27 19:05:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:32,267 INFO L462 AbstractCegarLoop]: Abstraction has 1821 states and 4084 transitions. [2019-12-27 19:05:32,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 19:05:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 4084 transitions. [2019-12-27 19:05:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:05:32,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:32,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:32,269 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:32,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:32,269 INFO L82 PathProgramCache]: Analyzing trace with hash 287771511, now seen corresponding path program 2 times [2019-12-27 19:05:32,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:32,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229215699] [2019-12-27 19:05:32,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:32,479 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 19:05:32,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229215699] [2019-12-27 19:05:32,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:32,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:05:32,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [99848648] [2019-12-27 19:05:32,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:32,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:32,487 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 19:05:32,487 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:32,739 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 19:05:32,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 19:05:32,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:32,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 19:05:32,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:05:32,741 INFO L87 Difference]: Start difference. First operand 1821 states and 4084 transitions. Second operand 22 states. [2019-12-27 19:05:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:36,694 INFO L93 Difference]: Finished difference Result 2645 states and 5845 transitions. [2019-12-27 19:05:36,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 19:05:36,695 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 15 [2019-12-27 19:05:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:36,701 INFO L225 Difference]: With dead ends: 2645 [2019-12-27 19:05:36,701 INFO L226 Difference]: Without dead ends: 2645 [2019-12-27 19:05:36,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=390, Invalid=1170, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 19:05:36,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2019-12-27 19:05:36,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1811. [2019-12-27 19:05:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2019-12-27 19:05:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 4059 transitions. [2019-12-27 19:05:36,740 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 4059 transitions. Word has length 15 [2019-12-27 19:05:36,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:36,741 INFO L462 AbstractCegarLoop]: Abstraction has 1811 states and 4059 transitions. [2019-12-27 19:05:36,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 19:05:36,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 4059 transitions. [2019-12-27 19:05:36,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:05:36,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:36,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:36,742 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1298791937, now seen corresponding path program 1 times [2019-12-27 19:05:36,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:36,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933857186] [2019-12-27 19:05:36,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:37,259 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 19:05:37,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933857186] [2019-12-27 19:05:37,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:37,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 19:05:37,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1703252568] [2019-12-27 19:05:37,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:37,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:37,268 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 55 transitions. [2019-12-27 19:05:37,268 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:37,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 19:05:37,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 19:05:37,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:37,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 19:05:37,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-12-27 19:05:37,892 INFO L87 Difference]: Start difference. First operand 1811 states and 4059 transitions. Second operand 31 states. [2019-12-27 19:05:38,864 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-12-27 19:05:39,362 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-27 19:05:39,807 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-12-27 19:05:40,246 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2019-12-27 19:05:40,688 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-12-27 19:05:41,009 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-27 19:05:41,388 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-12-27 19:05:41,578 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-12-27 19:05:41,751 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-12-27 19:05:42,517 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-12-27 19:05:43,553 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-12-27 19:05:44,138 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-12-27 19:05:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:49,441 INFO L93 Difference]: Finished difference Result 3126 states and 6960 transitions. [2019-12-27 19:05:49,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 19:05:49,442 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 17 [2019-12-27 19:05:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:49,448 INFO L225 Difference]: With dead ends: 3126 [2019-12-27 19:05:49,448 INFO L226 Difference]: Without dead ends: 3126 [2019-12-27 19:05:49,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=748, Invalid=3808, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 19:05:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2019-12-27 19:05:49,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 1963. [2019-12-27 19:05:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-27 19:05:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4437 transitions. [2019-12-27 19:05:49,495 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4437 transitions. Word has length 17 [2019-12-27 19:05:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:49,495 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 4437 transitions. [2019-12-27 19:05:49,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 19:05:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4437 transitions. [2019-12-27 19:05:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:05:49,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:49,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:49,497 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:49,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:49,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1804550017, now seen corresponding path program 2 times [2019-12-27 19:05:49,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:49,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149783061] [2019-12-27 19:05:49,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:49,980 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 23 [2019-12-27 19:05:50,042 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 19:05:50,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149783061] [2019-12-27 19:05:50,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:50,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:05:50,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [209748728] [2019-12-27 19:05:50,043 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:50,045 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:50,051 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 53 transitions. [2019-12-27 19:05:50,051 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:50,054 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_3469|], 2=[|v_#memory_$Pointer$.base_3469|]} [2019-12-27 19:05:50,056 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:05:50,061 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:50,062 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:50,070 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:50,070 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:50,070 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:16 [2019-12-27 19:05:50,655 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:05:50,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 19:05:50,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:50,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 19:05:50,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-12-27 19:05:50,656 INFO L87 Difference]: Start difference. First operand 1963 states and 4437 transitions. Second operand 25 states. [2019-12-27 19:05:51,945 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 59 [2019-12-27 19:05:52,156 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 57 [2019-12-27 19:05:52,423 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-12-27 19:05:52,706 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 80 [2019-12-27 19:05:52,963 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 66 [2019-12-27 19:05:53,535 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 81 [2019-12-27 19:05:53,853 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 87 [2019-12-27 19:05:54,081 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-12-27 19:05:54,496 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 76 [2019-12-27 19:05:54,679 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 57 [2019-12-27 19:05:55,234 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 85 [2019-12-27 19:05:55,456 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 64 [2019-12-27 19:05:55,748 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 95 [2019-12-27 19:05:56,141 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 114 [2019-12-27 19:05:56,565 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 100 [2019-12-27 19:05:56,783 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 79 [2019-12-27 19:05:57,152 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 106 [2019-12-27 19:05:57,464 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 85 [2019-12-27 19:05:57,950 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 103 [2019-12-27 19:05:58,635 WARN L192 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 133 [2019-12-27 19:05:59,081 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 62 [2019-12-27 19:05:59,587 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 112 [2019-12-27 19:06:00,300 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 118 [2019-12-27 19:06:00,865 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 60 [2019-12-27 19:06:01,400 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 69 [2019-12-27 19:06:03,882 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 79 [2019-12-27 19:06:04,670 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 88 [2019-12-27 19:06:04,926 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 67 [2019-12-27 19:06:05,729 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 122 [2019-12-27 19:06:06,105 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 98 [2019-12-27 19:06:07,375 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 106 [2019-12-27 19:06:08,069 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 125 [2019-12-27 19:06:17,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:06:17,088 INFO L93 Difference]: Finished difference Result 4131 states and 9183 transitions. [2019-12-27 19:06:17,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-12-27 19:06:17,089 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 17 [2019-12-27 19:06:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:06:17,094 INFO L225 Difference]: With dead ends: 4131 [2019-12-27 19:06:17,095 INFO L226 Difference]: Without dead ends: 4131 [2019-12-27 19:06:17,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2669 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=1520, Invalid=7792, Unknown=0, NotChecked=0, Total=9312 [2019-12-27 19:06:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2019-12-27 19:06:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 1950. [2019-12-27 19:06:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-12-27 19:06:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 4407 transitions. [2019-12-27 19:06:17,150 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 4407 transitions. Word has length 17 [2019-12-27 19:06:17,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:06:17,150 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 4407 transitions. [2019-12-27 19:06:17,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 19:06:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 4407 transitions. [2019-12-27 19:06:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:06:17,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:06:17,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:06:17,152 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:06:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:06:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash -568638307, now seen corresponding path program 3 times [2019-12-27 19:06:17,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:06:17,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195409068] [2019-12-27 19:06:17,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:06:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:06:17,564 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 19:06:17,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195409068] [2019-12-27 19:06:17,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:06:17,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:06:17,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1478893471] [2019-12-27 19:06:17,565 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:06:17,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:06:17,578 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 51 transitions. [2019-12-27 19:06:17,578 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:06:17,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:06:17,584 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_3470|], 2=[|v_#memory_$Pointer$.base_3470|]} [2019-12-27 19:06:17,587 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:06:17,589 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 19:06:17,607 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:06:17,610 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 19:06:17,612 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:06:17,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:06:17,620 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-27 19:06:17,621 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:79, output treesize:21 [2019-12-27 19:06:18,203 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 19:06:18,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 19:06:18,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:06:18,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 19:06:18,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:06:18,205 INFO L87 Difference]: Start difference. First operand 1950 states and 4407 transitions. Second operand 22 states. [2019-12-27 19:06:18,863 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-12-27 19:06:19,037 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-27 19:06:19,327 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 63 [2019-12-27 19:06:19,529 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-12-27 19:06:19,814 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 65 [2019-12-27 19:06:20,165 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 84 [2019-12-27 19:06:20,410 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 63 [2019-12-27 19:06:20,889 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 86 [2019-12-27 19:06:21,335 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 90 [2019-12-27 19:06:21,609 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 65 [2019-12-27 19:06:22,343 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 92 [2019-12-27 19:06:22,926 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 80 [2019-12-27 19:06:23,247 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 70 [2019-12-27 19:06:23,507 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 59 [2019-12-27 19:06:23,958 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 82 [2019-12-27 19:06:24,301 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 72 [2019-12-27 19:06:24,591 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 76 [2019-12-27 19:06:24,900 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 61 [2019-12-27 19:06:25,383 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 78 [2019-12-27 19:06:25,792 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-12-27 19:06:26,085 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 68 [2019-12-27 19:06:26,735 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 89 [2019-12-27 19:06:27,192 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 68 [2019-12-27 19:06:27,806 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 95 [2019-12-27 19:06:28,960 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 85 [2019-12-27 19:06:29,296 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 75 [2019-12-27 19:06:29,583 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-12-27 19:06:29,946 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 64 [2019-12-27 19:06:30,332 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 81 [2019-12-27 19:06:31,092 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-12-27 19:06:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:06:36,742 INFO L93 Difference]: Finished difference Result 3152 states and 6987 transitions. [2019-12-27 19:06:36,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 19:06:36,742 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2019-12-27 19:06:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:06:36,746 INFO L225 Difference]: With dead ends: 3152 [2019-12-27 19:06:36,746 INFO L226 Difference]: Without dead ends: 3152 [2019-12-27 19:06:36,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=849, Invalid=3311, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 19:06:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2019-12-27 19:06:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 1953. [2019-12-27 19:06:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2019-12-27 19:06:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 4413 transitions. [2019-12-27 19:06:36,774 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 4413 transitions. Word has length 17 [2019-12-27 19:06:36,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:06:36,774 INFO L462 AbstractCegarLoop]: Abstraction has 1953 states and 4413 transitions. [2019-12-27 19:06:36,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 19:06:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 4413 transitions. [2019-12-27 19:06:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:06:36,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:06:36,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:06:36,776 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:06:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:06:36,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1192920703, now seen corresponding path program 1 times [2019-12-27 19:06:36,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:06:36,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543649384] [2019-12-27 19:06:36,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:06:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:06:36,950 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 19:06:36,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543649384] [2019-12-27 19:06:36,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:06:36,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:06:36,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1892481992] [2019-12-27 19:06:36,951 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:06:36,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:06:36,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 48 transitions. [2019-12-27 19:06:36,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:06:37,036 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:06:37,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:06:37,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:06:37,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:06:37,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:06:37,037 INFO L87 Difference]: Start difference. First operand 1953 states and 4413 transitions. Second operand 10 states. [2019-12-27 19:06:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:06:39,771 INFO L93 Difference]: Finished difference Result 2483 states and 5537 transitions. [2019-12-27 19:06:39,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:06:39,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-27 19:06:39,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:06:39,775 INFO L225 Difference]: With dead ends: 2483 [2019-12-27 19:06:39,776 INFO L226 Difference]: Without dead ends: 2483 [2019-12-27 19:06:39,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:06:39,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2019-12-27 19:06:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 1965. [2019-12-27 19:06:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 19:06:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 4435 transitions. [2019-12-27 19:06:39,802 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 4435 transitions. Word has length 18 [2019-12-27 19:06:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:06:39,803 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 4435 transitions. [2019-12-27 19:06:39,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:06:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 4435 transitions. [2019-12-27 19:06:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:06:39,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:06:39,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:06:39,805 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:06:39,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:06:39,805 INFO L82 PathProgramCache]: Analyzing trace with hash -745285229, now seen corresponding path program 2 times [2019-12-27 19:06:39,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:06:39,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56736668] [2019-12-27 19:06:39,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:06:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:06:40,030 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 19:06:40,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56736668] [2019-12-27 19:06:40,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:06:40,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:06:40,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1726478795] [2019-12-27 19:06:40,031 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:06:40,034 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:06:40,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 48 transitions. [2019-12-27 19:06:40,040 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:06:40,122 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:06:40,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:06:40,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:06:40,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:06:40,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:06:40,124 INFO L87 Difference]: Start difference. First operand 1965 states and 4435 transitions. Second operand 15 states. [2019-12-27 19:06:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:06:44,245 INFO L93 Difference]: Finished difference Result 2743 states and 6101 transitions. [2019-12-27 19:06:44,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 19:06:44,245 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 19:06:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:06:44,249 INFO L225 Difference]: With dead ends: 2743 [2019-12-27 19:06:44,250 INFO L226 Difference]: Without dead ends: 2743 [2019-12-27 19:06:44,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=333, Invalid=999, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 19:06:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2019-12-27 19:06:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2033. [2019-12-27 19:06:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2019-12-27 19:06:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 4594 transitions. [2019-12-27 19:06:44,275 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 4594 transitions. Word has length 18 [2019-12-27 19:06:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:06:44,275 INFO L462 AbstractCegarLoop]: Abstraction has 2033 states and 4594 transitions. [2019-12-27 19:06:44,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:06:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 4594 transitions. [2019-12-27 19:06:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:06:44,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:06:44,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:06:44,277 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:06:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:06:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash 269048999, now seen corresponding path program 3 times [2019-12-27 19:06:44,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:06:44,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711199031] [2019-12-27 19:06:44,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:06:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:06:44,531 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 19:06:44,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711199031] [2019-12-27 19:06:44,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:06:44,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:06:44,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1690252460] [2019-12-27 19:06:44,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:06:44,534 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:06:44,539 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 42 transitions. [2019-12-27 19:06:44,539 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:06:44,779 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 19:06:44,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 19:06:44,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:06:44,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 19:06:44,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:06:44,781 INFO L87 Difference]: Start difference. First operand 2033 states and 4594 transitions. Second operand 19 states. [2019-12-27 19:06:46,013 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 50 [2019-12-27 19:06:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:06:48,371 INFO L93 Difference]: Finished difference Result 2693 states and 5982 transitions. [2019-12-27 19:06:48,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 19:06:48,371 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-12-27 19:06:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:06:48,375 INFO L225 Difference]: With dead ends: 2693 [2019-12-27 19:06:48,375 INFO L226 Difference]: Without dead ends: 2693 [2019-12-27 19:06:48,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2019-12-27 19:06:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2019-12-27 19:06:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2008. [2019-12-27 19:06:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2019-12-27 19:06:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 4529 transitions. [2019-12-27 19:06:48,399 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 4529 transitions. Word has length 18 [2019-12-27 19:06:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:06:48,399 INFO L462 AbstractCegarLoop]: Abstraction has 2008 states and 4529 transitions. [2019-12-27 19:06:48,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 19:06:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 4529 transitions. [2019-12-27 19:06:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:06:48,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:06:48,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:06:48,400 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:06:48,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:06:48,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1723864365, now seen corresponding path program 4 times [2019-12-27 19:06:48,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:06:48,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413422938] [2019-12-27 19:06:48,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:06:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:06:48,737 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 19:06:48,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413422938] [2019-12-27 19:06:48,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:06:48,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 19:06:48,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1228905372] [2019-12-27 19:06:48,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:06:48,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:06:48,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 42 transitions. [2019-12-27 19:06:48,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:06:48,964 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 19:06:48,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 19:06:48,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:06:48,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 19:06:48,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:06:48,966 INFO L87 Difference]: Start difference. First operand 2008 states and 4529 transitions. Second operand 24 states. [2019-12-27 19:06:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:06:53,836 INFO L93 Difference]: Finished difference Result 2820 states and 6256 transitions. [2019-12-27 19:06:53,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 19:06:53,836 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 18 [2019-12-27 19:06:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:06:53,841 INFO L225 Difference]: With dead ends: 2820 [2019-12-27 19:06:53,841 INFO L226 Difference]: Without dead ends: 2820 [2019-12-27 19:06:53,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=621, Invalid=1731, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 19:06:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2019-12-27 19:06:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 1996. [2019-12-27 19:06:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-12-27 19:06:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 4503 transitions. [2019-12-27 19:06:53,864 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 4503 transitions. Word has length 18 [2019-12-27 19:06:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:06:53,864 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 4503 transitions. [2019-12-27 19:06:53,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 19:06:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 4503 transitions. [2019-12-27 19:06:53,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:06:53,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:06:53,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:06:53,866 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:06:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:06:53,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1176401105, now seen corresponding path program 5 times [2019-12-27 19:06:53,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:06:53,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500057382] [2019-12-27 19:06:53,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:06:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:06:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:06:54,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500057382] [2019-12-27 19:06:54,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:06:54,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 19:06:54,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1732135832] [2019-12-27 19:06:54,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:06:54,189 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:06:54,195 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 56 transitions. [2019-12-27 19:06:54,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:06:54,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:06:54,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 19:06:54,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:06:54,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 19:06:54,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:06:54,664 INFO L87 Difference]: Start difference. First operand 1996 states and 4503 transitions. Second operand 32 states. [2019-12-27 19:06:57,485 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2019-12-27 19:06:58,972 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2019-12-27 19:06:59,258 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2019-12-27 19:07:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:07:02,988 INFO L93 Difference]: Finished difference Result 2825 states and 6260 transitions. [2019-12-27 19:07:02,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 19:07:02,989 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 18 [2019-12-27 19:07:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:07:02,993 INFO L225 Difference]: With dead ends: 2825 [2019-12-27 19:07:02,993 INFO L226 Difference]: Without dead ends: 2825 [2019-12-27 19:07:02,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=899, Invalid=3523, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 19:07:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2019-12-27 19:07:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 1978. [2019-12-27 19:07:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-12-27 19:07:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 4463 transitions. [2019-12-27 19:07:03,025 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 4463 transitions. Word has length 18 [2019-12-27 19:07:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:07:03,025 INFO L462 AbstractCegarLoop]: Abstraction has 1978 states and 4463 transitions. [2019-12-27 19:07:03,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 19:07:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 4463 transitions. [2019-12-27 19:07:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:07:03,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:07:03,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:07:03,027 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:07:03,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:07:03,028 INFO L82 PathProgramCache]: Analyzing trace with hash -676902244, now seen corresponding path program 1 times [2019-12-27 19:07:03,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:07:03,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543757778] [2019-12-27 19:07:03,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:07:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:07:03,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 19:07:03,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543757778] [2019-12-27 19:07:03,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:07:03,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:07:03,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875034898] [2019-12-27 19:07:03,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:07:03,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:07:03,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 18 transitions. [2019-12-27 19:07:03,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:07:03,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:07:03,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:07:03,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:07:03,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:07:03,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:07:03,525 INFO L87 Difference]: Start difference. First operand 1978 states and 4463 transitions. Second operand 15 states. [2019-12-27 19:07:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:07:06,787 INFO L93 Difference]: Finished difference Result 3356 states and 7492 transitions. [2019-12-27 19:07:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:07:06,788 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 19:07:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:07:06,792 INFO L225 Difference]: With dead ends: 3356 [2019-12-27 19:07:06,792 INFO L226 Difference]: Without dead ends: 3356 [2019-12-27 19:07:06,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:07:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3356 states. [2019-12-27 19:07:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3356 to 2020. [2019-12-27 19:07:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-12-27 19:07:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 4551 transitions. [2019-12-27 19:07:06,829 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 4551 transitions. Word has length 18 [2019-12-27 19:07:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:07:06,829 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 4551 transitions. [2019-12-27 19:07:06,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:07:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 4551 transitions. [2019-12-27 19:07:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:07:06,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:07:06,831 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:07:06,832 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:07:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:07:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1651812732, now seen corresponding path program 1 times [2019-12-27 19:07:06,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:07:06,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389548774] [2019-12-27 19:07:06,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:07:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:07:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:07:07,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389548774] [2019-12-27 19:07:07,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326329879] [2019-12-27 19:07:07,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:07:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:07:07,597 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 87 conjunts are in the unsatisfiable core [2019-12-27 19:07:07,606 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:07:07,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,681 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:07,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2019-12-27 19:07:07,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:07,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:07,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:07,860 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-12-27 19:07:07,861 INFO L614 ElimStorePlain]: treesize reduction 54, result has 83.0 percent of original size [2019-12-27 19:07:07,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 46 [2019-12-27 19:07:07,894 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:07,949 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:07,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:07,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 42 [2019-12-27 19:07:07,966 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:08,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:08,015 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 19:07:08,015 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:280, output treesize:181 [2019-12-27 19:07:08,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:08,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:08,409 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:08,409 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 102 [2019-12-27 19:07:08,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:08,457 INFO L614 ElimStorePlain]: treesize reduction 26, result has 77.8 percent of original size [2019-12-27 19:07:08,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 19:07:08,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:202, output treesize:91 [2019-12-27 19:07:08,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:09,094 WARN L192 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 114 [2019-12-27 19:07:09,095 INFO L343 Elim1Store]: treesize reduction 62, result has 85.5 percent of original size [2019-12-27 19:07:09,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 118 treesize of output 408 [2019-12-27 19:07:09,099 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:09,206 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-12-27 19:07:09,206 INFO L614 ElimStorePlain]: treesize reduction 148, result has 33.0 percent of original size [2019-12-27 19:07:09,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:09,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:09,208 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 19:07:09,208 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:124, output treesize:96 [2019-12-27 19:07:09,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:09,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:09,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:09,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:09,389 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:09,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 178 [2019-12-27 19:07:09,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 19:07:09,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:09,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:09,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:09,394 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-27 19:07:09,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:09,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:09,501 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:09,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 172 [2019-12-27 19:07:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 19:07:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:09,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:09,507 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-27 19:07:09,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:09,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:09,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:09,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 19:07:09,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:09,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 80 treesize of output 181 [2019-12-27 19:07:09,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:09,607 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:09,894 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-12-27 19:07:09,895 INFO L614 ElimStorePlain]: treesize reduction 1154, result has 10.8 percent of original size [2019-12-27 19:07:09,896 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-27 19:07:09,896 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:265, output treesize:111 [2019-12-27 19:07:10,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:07:10,289 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:10,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 46 [2019-12-27 19:07:10,291 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:10,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:10,337 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:10,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 50 [2019-12-27 19:07:10,339 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:10,372 INFO L614 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-12-27 19:07:10,373 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 19:07:10,373 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:101, output treesize:4 [2019-12-27 19:07:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:07:10,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:07:10,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2019-12-27 19:07:10,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1767576537] [2019-12-27 19:07:10,387 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:07:10,424 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:07:10,441 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 79 transitions. [2019-12-27 19:07:10,441 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:07:10,767 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:10,779 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:10,780 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 19:07:10,780 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:84, output treesize:64 [2019-12-27 19:07:10,910 INFO L430 ElimStorePlain]: Different costs {7=[|v_#memory_$Pointer$.offset_3473|], 14=[|v_#memory_$Pointer$.base_3475|]} [2019-12-27 19:07:10,914 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:07:10,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:10,936 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:07:10,955 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:10,956 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 19:07:10,956 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:154 [2019-12-27 19:07:12,164 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 19:07:12,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 19:07:12,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:07:12,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 19:07:12,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 19:07:12,165 INFO L87 Difference]: Start difference. First operand 2020 states and 4551 transitions. Second operand 30 states. [2019-12-27 19:07:13,244 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2019-12-27 19:07:13,697 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 72 [2019-12-27 19:07:14,350 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 139 [2019-12-27 19:07:15,870 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 114 [2019-12-27 19:07:16,166 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 68 [2019-12-27 19:07:16,660 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 139 [2019-12-27 19:07:17,143 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 136 [2019-12-27 19:07:17,803 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 116 [2019-12-27 19:07:18,485 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 325 DAG size of output: 176 [2019-12-27 19:07:19,887 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 62 [2019-12-27 19:07:20,827 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 75 [2019-12-27 19:07:21,017 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 65 [2019-12-27 19:07:21,879 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 142 [2019-12-27 19:07:23,426 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-12-27 19:07:24,427 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 117 [2019-12-27 19:07:24,788 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 72 [2019-12-27 19:07:25,667 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 142 [2019-12-27 19:07:26,483 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 139 [2019-12-27 19:07:27,070 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 119 [2019-12-27 19:07:28,773 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 328 DAG size of output: 179 [2019-12-27 19:07:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:07:43,123 INFO L93 Difference]: Finished difference Result 3485 states and 7824 transitions. [2019-12-27 19:07:43,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 19:07:43,124 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 19 [2019-12-27 19:07:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:07:43,128 INFO L225 Difference]: With dead ends: 3485 [2019-12-27 19:07:43,128 INFO L226 Difference]: Without dead ends: 3485 [2019-12-27 19:07:43,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2047 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1305, Invalid=7067, Unknown=0, NotChecked=0, Total=8372 [2019-12-27 19:07:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2019-12-27 19:07:43,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 2034. [2019-12-27 19:07:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-12-27 19:07:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 4581 transitions. [2019-12-27 19:07:43,159 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 4581 transitions. Word has length 19 [2019-12-27 19:07:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:07:43,159 INFO L462 AbstractCegarLoop]: Abstraction has 2034 states and 4581 transitions. [2019-12-27 19:07:43,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 19:07:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 4581 transitions. [2019-12-27 19:07:43,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:07:43,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:07:43,162 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] [2019-12-27 19:07:43,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:07:43,366 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:07:43,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:07:43,366 INFO L82 PathProgramCache]: Analyzing trace with hash 835204080, now seen corresponding path program 1 times [2019-12-27 19:07:43,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:07:43,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513973877] [2019-12-27 19:07:43,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:07:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:07:44,550 WARN L192 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 74 [2019-12-27 19:07:44,984 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 54 [2019-12-27 19:07:45,294 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 [2019-12-27 19:07:45,546 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 40 [2019-12-27 19:07:45,800 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 29 [2019-12-27 19:07:46,059 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 19:07:46,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513973877] [2019-12-27 19:07:46,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:07:46,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 19:07:46,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1983953032] [2019-12-27 19:07:46,060 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:07:46,062 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:07:46,069 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 58 transitions. [2019-12-27 19:07:46,069 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:07:46,439 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-12-27 19:07:47,187 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 19:07:47,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 19:07:47,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:07:47,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 19:07:47,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 19:07:47,189 INFO L87 Difference]: Start difference. First operand 2034 states and 4581 transitions. Second operand 34 states. [2019-12-27 19:07:48,287 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-27 19:07:48,506 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-12-27 19:07:49,138 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-12-27 19:07:49,609 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-12-27 19:07:50,937 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 73 [2019-12-27 19:07:51,344 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-12-27 19:07:51,572 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-12-27 19:07:52,180 WARN L192 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 76 [2019-12-27 19:07:55,218 WARN L192 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 79 [2019-12-27 19:08:00,759 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-12-27 19:08:01,837 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-12-27 19:08:02,389 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-12-27 19:08:02,814 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-12-27 19:08:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:08:03,113 INFO L93 Difference]: Finished difference Result 3777 states and 8418 transitions. [2019-12-27 19:08:03,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 19:08:03,114 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 20 [2019-12-27 19:08:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:08:03,119 INFO L225 Difference]: With dead ends: 3777 [2019-12-27 19:08:03,119 INFO L226 Difference]: Without dead ends: 3777 [2019-12-27 19:08:03,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=799, Invalid=4603, Unknown=0, NotChecked=0, Total=5402 [2019-12-27 19:08:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2019-12-27 19:08:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 2099. [2019-12-27 19:08:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2099 states. [2019-12-27 19:08:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 4744 transitions. [2019-12-27 19:08:03,145 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 4744 transitions. Word has length 20 [2019-12-27 19:08:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:08:03,146 INFO L462 AbstractCegarLoop]: Abstraction has 2099 states and 4744 transitions. [2019-12-27 19:08:03,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 19:08:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 4744 transitions. [2019-12-27 19:08:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:08:03,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:08:03,148 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] [2019-12-27 19:08:03,148 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:08:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:08:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1032302083, now seen corresponding path program 1 times [2019-12-27 19:08:03,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:08:03,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914774809] [2019-12-27 19:08:03,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:08:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:08:04,043 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 19:08:04,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914774809] [2019-12-27 19:08:04,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:08:04,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 19:08:04,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115400828] [2019-12-27 19:08:04,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:08:04,047 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:08:04,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 52 transitions. [2019-12-27 19:08:04,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:08:04,683 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:08:04,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 19:08:04,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:08:04,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 19:08:04,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:08:04,685 INFO L87 Difference]: Start difference. First operand 2099 states and 4744 transitions. Second operand 29 states. [2019-12-27 19:08:06,023 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2019-12-27 19:08:06,582 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 44 [2019-12-27 19:08:06,967 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 57 [2019-12-27 19:08:07,427 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 69 [2019-12-27 19:08:08,499 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 72 [2019-12-27 19:08:08,922 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 67 [2019-12-27 19:08:10,696 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 51 [2019-12-27 19:08:11,380 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 54 [2019-12-27 19:08:12,114 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 60 [2019-12-27 19:08:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:08:17,656 INFO L93 Difference]: Finished difference Result 3764 states and 8416 transitions. [2019-12-27 19:08:17,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 19:08:17,657 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-12-27 19:08:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:08:17,662 INFO L225 Difference]: With dead ends: 3764 [2019-12-27 19:08:17,662 INFO L226 Difference]: Without dead ends: 3764 [2019-12-27 19:08:17,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=678, Invalid=2628, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 19:08:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2019-12-27 19:08:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 2127. [2019-12-27 19:08:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-27 19:08:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4809 transitions. [2019-12-27 19:08:17,698 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4809 transitions. Word has length 20 [2019-12-27 19:08:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:08:17,698 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4809 transitions. [2019-12-27 19:08:17,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 19:08:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4809 transitions. [2019-12-27 19:08:17,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:08:17,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:08:17,700 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] [2019-12-27 19:08:17,701 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:08:17,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:08:17,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1215590211, now seen corresponding path program 2 times [2019-12-27 19:08:17,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:08:17,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067309300] [2019-12-27 19:08:17,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:08:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:08:18,376 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 19:08:18,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067309300] [2019-12-27 19:08:18,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:08:18,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 19:08:18,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1258858962] [2019-12-27 19:08:18,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:08:18,379 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:08:18,385 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 46 transitions. [2019-12-27 19:08:18,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:08:18,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:08:18,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 19:08:18,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:08:18,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 19:08:18,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:08:18,753 INFO L87 Difference]: Start difference. First operand 2127 states and 4809 transitions. Second operand 27 states. [2019-12-27 19:08:19,845 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-12-27 19:08:20,706 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 62 [2019-12-27 19:08:20,871 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 40 [2019-12-27 19:08:21,255 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 53 [2019-12-27 19:08:21,732 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 65 [2019-12-27 19:08:22,292 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 56 [2019-12-27 19:08:22,670 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 56 [2019-12-27 19:08:23,102 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 40 [2019-12-27 19:08:23,513 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 43 [2019-12-27 19:08:24,315 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 47 [2019-12-27 19:08:24,800 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 50 [2019-12-27 19:08:27,738 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 43 [2019-12-27 19:08:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:08:28,858 INFO L93 Difference]: Finished difference Result 3848 states and 8600 transitions. [2019-12-27 19:08:28,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 19:08:28,859 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 20 [2019-12-27 19:08:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:08:28,863 INFO L225 Difference]: With dead ends: 3848 [2019-12-27 19:08:28,863 INFO L226 Difference]: Without dead ends: 3848 [2019-12-27 19:08:28,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=749, Invalid=2673, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 19:08:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2019-12-27 19:08:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 2117. [2019-12-27 19:08:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2019-12-27 19:08:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 4789 transitions. [2019-12-27 19:08:28,904 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 4789 transitions. Word has length 20 [2019-12-27 19:08:28,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:08:28,904 INFO L462 AbstractCegarLoop]: Abstraction has 2117 states and 4789 transitions. [2019-12-27 19:08:28,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 19:08:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 4789 transitions. [2019-12-27 19:08:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:08:28,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:08:28,906 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] [2019-12-27 19:08:28,906 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:08:28,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:08:28,906 INFO L82 PathProgramCache]: Analyzing trace with hash -953194337, now seen corresponding path program 3 times [2019-12-27 19:08:28,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:08:28,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514732721] [2019-12-27 19:08:28,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:08:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:08:29,596 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 19:08:29,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514732721] [2019-12-27 19:08:29,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:08:29,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 19:08:29,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [575120433] [2019-12-27 19:08:29,597 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:08:29,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:08:29,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 60 transitions. [2019-12-27 19:08:29,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:08:30,379 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 19:08:30,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 19:08:30,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:08:30,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 19:08:30,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:08:30,380 INFO L87 Difference]: Start difference. First operand 2117 states and 4789 transitions. Second operand 32 states. [2019-12-27 19:08:31,389 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-12-27 19:08:31,891 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 65 [2019-12-27 19:08:32,701 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 43 [2019-12-27 19:08:33,130 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 68 [2019-12-27 19:08:33,371 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 51 [2019-12-27 19:08:34,064 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 76 [2019-12-27 19:08:34,906 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 49 [2019-12-27 19:08:35,654 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 62 [2019-12-27 19:08:35,949 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 49 [2019-12-27 19:08:36,475 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 74 [2019-12-27 19:08:36,906 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 70 [2019-12-27 19:08:37,575 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 46 [2019-12-27 19:08:38,155 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 54 [2019-12-27 19:08:39,241 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 52 [2019-12-27 19:08:39,771 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 53 [2019-12-27 19:08:40,330 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 52 [2019-12-27 19:08:40,867 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 56 [2019-12-27 19:08:46,223 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 49 Received shutdown request... [2019-12-27 19:08:47,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 19:08:47,110 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 19:08:47,118 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 19:08:47,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:08:47 BasicIcfg [2019-12-27 19:08:47,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:08:47,122 INFO L168 Benchmark]: Toolchain (without parser) took 252724.18 ms. Allocated memory was 138.9 MB in the beginning and 303.6 MB in the end (delta: 164.6 MB). Free memory was 101.4 MB in the beginning and 213.4 MB in the end (delta: -112.0 MB). Peak memory consumption was 52.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:08:47,123 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 19:08:47,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 965.00 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.2 MB in the beginning and 129.7 MB in the end (delta: -28.5 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:08:47,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.07 ms. Allocated memory is still 202.9 MB. Free memory was 129.7 MB in the beginning and 125.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-12-27 19:08:47,126 INFO L168 Benchmark]: Boogie Preprocessor took 66.14 ms. Allocated memory is still 202.9 MB. Free memory was 125.6 MB in the beginning and 121.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:08:47,126 INFO L168 Benchmark]: RCFGBuilder took 1128.29 ms. Allocated memory was 202.9 MB in the beginning and 237.0 MB in the end (delta: 34.1 MB). Free memory was 121.6 MB in the beginning and 154.1 MB in the end (delta: -32.5 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. [2019-12-27 19:08:47,126 INFO L168 Benchmark]: TraceAbstraction took 250455.18 ms. Allocated memory was 237.0 MB in the beginning and 303.6 MB in the end (delta: 66.6 MB). Free memory was 152.7 MB in the beginning and 213.4 MB in the end (delta: -60.7 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2019-12-27 19:08:47,133 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.16 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 965.00 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.2 MB in the beginning and 129.7 MB in the end (delta: -28.5 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 100.07 ms. Allocated memory is still 202.9 MB. Free memory was 129.7 MB in the beginning and 125.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.14 ms. Allocated memory is still 202.9 MB. Free memory was 125.6 MB in the beginning and 121.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1128.29 ms. Allocated memory was 202.9 MB in the beginning and 237.0 MB in the end (delta: 34.1 MB). Free memory was 121.6 MB in the beginning and 154.1 MB in the end (delta: -32.5 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250455.18 ms. Allocated memory was 237.0 MB in the beginning and 303.6 MB in the end (delta: 66.6 MB). Free memory was 152.7 MB in the beginning and 213.4 MB in the end (delta: -60.7 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 24.4s, 415 ProgramPointsBefore, 103 ProgramPointsAfterwards, 443 TransitionsBefore, 121 TransitionsAfterwards, 30326 CoEnabledTransitionPairs, 14 FixpointIterations, 121 TrivialSequentialCompositions, 233 ConcurrentSequentialCompositions, 28 TrivialYvCompositions, 76 ConcurrentYvCompositions, 11 ChoiceCompositions, 15998 VarBasedMoverChecksPositive, 666 VarBasedMoverChecksNegative, 507 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.6s, 0 MoverChecksTotal, 106197 CheckedPairsTotal, 458 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1064). Cancelled while BasicCegarLoop was constructing difference of abstraction (2117states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (3371 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1087]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1087). Cancelled while BasicCegarLoop was constructing difference of abstraction (2117states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (3371 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (2117states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (3371 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1085]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1085). Cancelled while BasicCegarLoop was constructing difference of abstraction (2117states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (3371 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2117states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (3371 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2117states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (3371 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (2117states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (3371 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2117states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (3371 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (2117states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (3371 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1065). Cancelled while BasicCegarLoop was constructing difference of abstraction (2117states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (3371 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1089]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1089). Cancelled while BasicCegarLoop was constructing difference of abstraction (2117states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (3371 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 412 locations, 11 error locations. Result: TIMEOUT, OverallTime: 250.2s, OverallIterations: 27, TraceHistogramMax: 2, AutomataDifference: 200.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2978 SDtfs, 21204 SDslu, 12239 SDs, 0 SdLazy, 90968 SolverSat, 2096 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 111.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1112 GetRequests, 63 SyntacticMatches, 11 SemanticMatches, 1038 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12660 ImplicationChecksByTransitivity, 91.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2127occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 23259 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 398 ConstructedInterpolants, 6 QuantifiedInterpolants, 197550 SizeOfPredicates, 41 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 28 InterpolantComputations, 26 PerfectInterpolantSequences, 0/2 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 could not prove your program: Timeout Completed graceful shutdown