/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:14:50,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:14:50,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:14:50,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:14:50,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:14:50,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:14:50,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:14:50,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:14:50,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:14:50,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:14:50,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:14:50,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:14:50,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:14:50,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:14:50,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:14:50,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:14:50,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:14:50,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:14:50,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:14:50,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:14:50,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:14:50,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:14:50,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:14:50,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:14:50,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:14:50,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:14:50,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:14:50,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:14:50,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:14:50,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:14:50,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:14:50,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:14:50,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:14:50,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:14:50,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:14:50,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:14:50,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:14:50,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:14:50,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:14:50,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:14:50,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:14:50,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 23:14:50,691 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:14:50,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:14:50,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:14:50,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:14:50,693 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:14:50,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:14:50,694 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:14:50,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:14:50,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:14:50,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:14:50,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:14:50,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:14:50,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:14:50,695 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:14:50,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:14:50,695 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:14:50,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:14:50,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:14:50,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:14:50,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:14:50,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:14:50,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:14:50,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:14:50,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:14:50,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:14:50,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:14:50,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:14:50,698 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:14:50,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:14:50,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:14:51,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:14:51,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:14:51,010 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:14:51,010 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:14:51,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2020-10-21 23:14:51,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6373cd3b5/b68dada389f8426dbd7b959e1f9df517/FLAG587cd3b63 [2020-10-21 23:14:51,602 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:14:51,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2020-10-21 23:14:51,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6373cd3b5/b68dada389f8426dbd7b959e1f9df517/FLAG587cd3b63 [2020-10-21 23:14:52,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6373cd3b5/b68dada389f8426dbd7b959e1f9df517 [2020-10-21 23:14:52,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:14:52,069 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:14:52,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:14:52,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:14:52,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:14:52,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:14:52" (1/1) ... [2020-10-21 23:14:52,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286d28c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:52, skipping insertion in model container [2020-10-21 23:14:52,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:14:52" (1/1) ... [2020-10-21 23:14:52,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:14:52,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:14:52,350 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-10-21 23:14:52,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:14:52,948 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:14:52,962 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-10-21 23:14:53,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:14:53,257 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:14:53,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:53 WrapperNode [2020-10-21 23:14:53,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:14:53,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:14:53,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:14:53,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:14:53,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:53" (1/1) ... [2020-10-21 23:14:53,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:53" (1/1) ... [2020-10-21 23:14:53,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:14:53,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:14:53,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:14:53,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:14:53,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:53" (1/1) ... [2020-10-21 23:14:53,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:53" (1/1) ... [2020-10-21 23:14:53,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:53" (1/1) ... [2020-10-21 23:14:53,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:53" (1/1) ... [2020-10-21 23:14:53,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:53" (1/1) ... [2020-10-21 23:14:53,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:53" (1/1) ... [2020-10-21 23:14:53,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:53" (1/1) ... [2020-10-21 23:14:53,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:14:53,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:14:53,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:14:53,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:14:53,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:53" (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 [2020-10-21 23:14:53,558 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2020-10-21 23:14:53,558 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2020-10-21 23:14:53,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:14:53,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-21 23:14:53,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:14:53,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-21 23:14:53,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:14:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-21 23:14:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-21 23:14:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:14:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:14:53,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:14:53,563 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:14:54,546 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:14:54,546 INFO L298 CfgBuilder]: Removed 62 assume(true) statements. [2020-10-21 23:14:54,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:14:54 BoogieIcfgContainer [2020-10-21 23:14:54,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:14:54,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:14:54,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:14:54,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:14:54,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:14:52" (1/3) ... [2020-10-21 23:14:54,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b886c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:14:54, skipping insertion in model container [2020-10-21 23:14:54,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:14:53" (2/3) ... [2020-10-21 23:14:54,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b886c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:14:54, skipping insertion in model container [2020-10-21 23:14:54,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:14:54" (3/3) ... [2020-10-21 23:14:54,559 INFO L111 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.i [2020-10-21 23:14:54,571 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:14:54,571 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:14:54,580 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-10-21 23:14:54,581 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:14:54,629 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,630 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,630 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,630 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,630 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,631 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,631 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,631 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,631 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,631 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,631 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,632 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,632 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,632 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,632 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,632 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,633 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,633 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,633 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,633 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,633 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,634 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,634 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,634 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,634 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,634 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,634 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,635 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,635 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,635 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,635 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,635 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,635 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,636 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,636 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,636 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,636 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,636 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,636 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,636 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,637 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,637 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,637 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,637 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,637 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,638 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,638 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,638 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,638 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,638 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,639 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,639 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,639 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,639 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,639 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,639 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,640 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,640 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,640 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,640 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,640 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,640 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,641 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,641 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,641 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,641 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,642 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,642 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,642 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,642 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,642 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,643 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,643 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,643 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,643 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,643 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,644 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,644 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,644 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,644 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,644 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,645 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,645 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,645 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,645 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,645 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,646 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,646 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,646 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,646 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,646 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,647 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,647 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,647 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,647 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,647 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,648 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,648 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,648 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,648 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,648 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,649 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,649 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,649 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,649 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,649 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,650 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,650 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,650 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,650 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,650 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,651 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,651 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,651 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,651 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,651 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,652 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,652 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,652 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,652 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,653 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,653 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,653 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,653 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,653 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,653 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,654 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,654 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,654 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,654 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,655 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,655 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,655 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,655 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,655 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,655 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,656 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,656 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,656 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,656 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,656 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,657 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,657 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,657 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,657 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,657 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,657 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,658 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,658 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,658 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,658 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,658 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,658 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,659 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,659 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,659 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,659 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,659 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,659 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,660 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,660 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,660 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,660 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,660 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,661 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,661 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,661 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,661 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,661 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,661 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,662 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,662 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,662 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,662 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,662 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,662 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,663 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,663 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,663 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,663 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,663 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,664 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,664 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,664 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,664 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,664 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,665 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,665 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,665 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,665 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,669 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,669 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,669 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,670 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,670 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,670 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,670 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,670 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,670 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,671 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,671 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,671 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,671 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,671 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,672 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,672 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,672 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,672 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,672 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,672 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,673 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,673 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,673 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,673 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,674 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,674 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,674 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,674 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,674 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,675 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,675 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,675 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,675 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,675 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,676 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,676 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,676 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,676 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,676 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,677 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,677 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,677 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,677 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,677 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:14:54,690 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2020-10-21 23:14:54,704 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-10-21 23:14:54,726 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:14:54,726 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:14:54,726 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:14:54,726 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:14:54,726 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:14:54,727 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:14:54,727 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:14:54,727 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:14:54,753 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:14:54,754 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 459 places, 498 transitions, 1004 flow [2020-10-21 23:14:54,757 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 459 places, 498 transitions, 1004 flow [2020-10-21 23:14:54,759 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 459 places, 498 transitions, 1004 flow [2020-10-21 23:14:54,988 INFO L129 PetriNetUnfolder]: 43/497 cut-off events. [2020-10-21 23:14:54,989 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-10-21 23:14:55,001 INFO L80 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 497 events. 43/497 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1245 event pairs, 0 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 348. Up to 3 conditions per place. [2020-10-21 23:14:55,029 INFO L116 LiptonReduction]: Number of co-enabled transitions 34102 [2020-10-21 23:14:56,927 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-21 23:14:56,949 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:14:56,950 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-21 23:14:56,951 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2020-10-21 23:14:57,172 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-21 23:14:57,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:14:57,185 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-21 23:14:57,186 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2020-10-21 23:15:01,512 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-21 23:15:01,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:15:01,546 INFO L545 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. [2020-10-21 23:15:01,547 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:106, output treesize:92 [2020-10-21 23:15:01,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 23:15:02,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 23:15:02,677 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2020-10-21 23:15:03,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 23:15:03,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 23:15:03,235 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2020-10-21 23:15:03,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 23:15:03,968 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-21 23:15:04,214 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-21 23:15:04,433 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-21 23:15:04,729 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-21 23:15:05,663 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-10-21 23:15:05,998 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2020-10-21 23:15:06,659 WARN L193 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 [2020-10-21 23:15:06,682 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-21 23:15:06,832 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-21 23:15:06,833 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:15:06,834 INFO L545 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. [2020-10-21 23:15:06,835 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:382, output treesize:388 [2020-10-21 23:15:07,016 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-21 23:15:07,352 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2020-10-21 23:15:07,480 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-21 23:15:07,643 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2020-10-21 23:15:07,823 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-10-21 23:15:12,345 WARN L193 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 229 DAG size of output: 214 [2020-10-21 23:15:12,377 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-21 23:15:14,052 WARN L193 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 199 [2020-10-21 23:15:14,053 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:15:14,054 INFO L545 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. [2020-10-21 23:15:14,055 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:593, output treesize:638 [2020-10-21 23:15:15,686 WARN L193 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 199 [2020-10-21 23:15:15,715 INFO L131 LiptonReduction]: Checked pairs total: 79858 [2020-10-21 23:15:15,715 INFO L133 LiptonReduction]: Total number of compositions: 539 [2020-10-21 23:15:15,724 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 126 transitions, 260 flow [2020-10-21 23:15:15,804 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1509 states. [2020-10-21 23:15:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states. [2020-10-21 23:15:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-21 23:15:15,816 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:15,817 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-21 23:15:15,817 INFO L429 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]=== [2020-10-21 23:15:15,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:15,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1816, now seen corresponding path program 1 times [2020-10-21 23:15:15,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:15,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258081805] [2020-10-21 23:15:15,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:15,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258081805] [2020-10-21 23:15:15,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:15,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-21 23:15:15,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472940845] [2020-10-21 23:15:15,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-21 23:15:15,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:15,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-21 23:15:15,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-21 23:15:15,985 INFO L87 Difference]: Start difference. First operand 1509 states. Second operand 2 states. [2020-10-21 23:15:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:16,052 INFO L93 Difference]: Finished difference Result 1470 states and 3278 transitions. [2020-10-21 23:15:16,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-21 23:15:16,054 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-21 23:15:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:16,083 INFO L225 Difference]: With dead ends: 1470 [2020-10-21 23:15:16,084 INFO L226 Difference]: Without dead ends: 1431 [2020-10-21 23:15:16,085 INFO L677 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 [2020-10-21 23:15:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-10-21 23:15:16,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2020-10-21 23:15:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2020-10-21 23:15:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3197 transitions. [2020-10-21 23:15:16,235 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3197 transitions. Word has length 1 [2020-10-21 23:15:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:16,235 INFO L481 AbstractCegarLoop]: Abstraction has 1431 states and 3197 transitions. [2020-10-21 23:15:16,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-21 23:15:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3197 transitions. [2020-10-21 23:15:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-21 23:15:16,236 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:16,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-21 23:15:16,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:15:16,237 INFO L429 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]=== [2020-10-21 23:15:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:16,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1673217019, now seen corresponding path program 1 times [2020-10-21 23:15:16,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:16,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204601582] [2020-10-21 23:15:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:16,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204601582] [2020-10-21 23:15:16,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:16,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:15:16,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588185559] [2020-10-21 23:15:16,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:15:16,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:16,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:15:16,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:15:16,380 INFO L87 Difference]: Start difference. First operand 1431 states and 3197 transitions. Second operand 3 states. [2020-10-21 23:15:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:16,445 INFO L93 Difference]: Finished difference Result 2685 states and 6008 transitions. [2020-10-21 23:15:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:15:16,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-10-21 23:15:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:16,474 INFO L225 Difference]: With dead ends: 2685 [2020-10-21 23:15:16,475 INFO L226 Difference]: Without dead ends: 2685 [2020-10-21 23:15:16,476 INFO L677 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 [2020-10-21 23:15:16,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2020-10-21 23:15:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 1450. [2020-10-21 23:15:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-21 23:15:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 3237 transitions. [2020-10-21 23:15:16,544 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 3237 transitions. Word has length 6 [2020-10-21 23:15:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:16,545 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 3237 transitions. [2020-10-21 23:15:16,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:15:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 3237 transitions. [2020-10-21 23:15:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 23:15:16,545 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:16,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:16,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:15:16,546 INFO L429 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]=== [2020-10-21 23:15:16,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash 330400010, now seen corresponding path program 1 times [2020-10-21 23:15:16,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:16,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412528307] [2020-10-21 23:15:16,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:16,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412528307] [2020-10-21 23:15:16,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:16,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:15:16,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194774955] [2020-10-21 23:15:16,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:15:16,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:16,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:15:16,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:15:16,659 INFO L87 Difference]: Start difference. First operand 1450 states and 3237 transitions. Second operand 3 states. [2020-10-21 23:15:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:16,677 INFO L93 Difference]: Finished difference Result 1450 states and 3218 transitions. [2020-10-21 23:15:16,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:15:16,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 23:15:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:16,686 INFO L225 Difference]: With dead ends: 1450 [2020-10-21 23:15:16,687 INFO L226 Difference]: Without dead ends: 1450 [2020-10-21 23:15:16,687 INFO L677 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 [2020-10-21 23:15:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-10-21 23:15:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-10-21 23:15:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-21 23:15:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 3218 transitions. [2020-10-21 23:15:16,729 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 3218 transitions. Word has length 7 [2020-10-21 23:15:16,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:16,729 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 3218 transitions. [2020-10-21 23:15:16,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:15:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 3218 transitions. [2020-10-21 23:15:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-21 23:15:16,731 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:16,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:16,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:15:16,731 INFO L429 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]=== [2020-10-21 23:15:16,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:16,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1664981825, now seen corresponding path program 1 times [2020-10-21 23:15:16,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:16,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256882065] [2020-10-21 23:15:16,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:16,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256882065] [2020-10-21 23:15:16,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:16,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:15:16,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450140784] [2020-10-21 23:15:16,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:15:16,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:15:16,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:15:16,863 INFO L87 Difference]: Start difference. First operand 1450 states and 3218 transitions. Second operand 5 states. [2020-10-21 23:15:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:17,437 INFO L93 Difference]: Finished difference Result 1826 states and 4058 transitions. [2020-10-21 23:15:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:15:17,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-21 23:15:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:17,451 INFO L225 Difference]: With dead ends: 1826 [2020-10-21 23:15:17,451 INFO L226 Difference]: Without dead ends: 1826 [2020-10-21 23:15:17,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:15:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2020-10-21 23:15:17,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1557. [2020-10-21 23:15:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2020-10-21 23:15:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 3463 transitions. [2020-10-21 23:15:17,501 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 3463 transitions. Word has length 8 [2020-10-21 23:15:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:17,502 INFO L481 AbstractCegarLoop]: Abstraction has 1557 states and 3463 transitions. [2020-10-21 23:15:17,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:15:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 3463 transitions. [2020-10-21 23:15:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:15:17,504 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:17,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:17,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:15:17,504 INFO L429 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]=== [2020-10-21 23:15:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1975126375, now seen corresponding path program 1 times [2020-10-21 23:15:17,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:17,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004862720] [2020-10-21 23:15:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:17,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004862720] [2020-10-21 23:15:17,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:17,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:15:17,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707825030] [2020-10-21 23:15:17,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:15:17,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:17,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:15:17,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:15:17,568 INFO L87 Difference]: Start difference. First operand 1557 states and 3463 transitions. Second operand 3 states. [2020-10-21 23:15:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:17,646 INFO L93 Difference]: Finished difference Result 2565 states and 5690 transitions. [2020-10-21 23:15:17,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:15:17,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-21 23:15:17,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:17,662 INFO L225 Difference]: With dead ends: 2565 [2020-10-21 23:15:17,662 INFO L226 Difference]: Without dead ends: 2565 [2020-10-21 23:15:17,663 INFO L677 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 [2020-10-21 23:15:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2020-10-21 23:15:17,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1614. [2020-10-21 23:15:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2020-10-21 23:15:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 3583 transitions. [2020-10-21 23:15:17,718 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 3583 transitions. Word has length 10 [2020-10-21 23:15:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:17,718 INFO L481 AbstractCegarLoop]: Abstraction has 1614 states and 3583 transitions. [2020-10-21 23:15:17,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:15:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 3583 transitions. [2020-10-21 23:15:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:15:17,721 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:17,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:17,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:15:17,722 INFO L429 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]=== [2020-10-21 23:15:17,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:17,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1249348263, now seen corresponding path program 1 times [2020-10-21 23:15:17,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:17,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962428152] [2020-10-21 23:15:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:17,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962428152] [2020-10-21 23:15:17,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:17,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:15:17,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586334662] [2020-10-21 23:15:17,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:15:17,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:17,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:15:17,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:15:17,915 INFO L87 Difference]: Start difference. First operand 1614 states and 3583 transitions. Second operand 10 states. [2020-10-21 23:15:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:19,520 INFO L93 Difference]: Finished difference Result 2355 states and 5222 transitions. [2020-10-21 23:15:19,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 23:15:19,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-10-21 23:15:19,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:19,535 INFO L225 Difference]: With dead ends: 2355 [2020-10-21 23:15:19,536 INFO L226 Difference]: Without dead ends: 2355 [2020-10-21 23:15:19,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-21 23:15:19,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2020-10-21 23:15:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1628. [2020-10-21 23:15:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2020-10-21 23:15:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 3615 transitions. [2020-10-21 23:15:19,591 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 3615 transitions. Word has length 14 [2020-10-21 23:15:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:19,591 INFO L481 AbstractCegarLoop]: Abstraction has 1628 states and 3615 transitions. [2020-10-21 23:15:19,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:15:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 3615 transitions. [2020-10-21 23:15:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:15:19,594 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:19,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:19,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:15:19,594 INFO L429 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]=== [2020-10-21 23:15:19,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash 38942986, now seen corresponding path program 1 times [2020-10-21 23:15:19,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:19,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762379368] [2020-10-21 23:15:19,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:19,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762379368] [2020-10-21 23:15:19,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:19,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:15:19,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333795830] [2020-10-21 23:15:19,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:15:19,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:19,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:15:19,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:15:19,855 INFO L87 Difference]: Start difference. First operand 1628 states and 3615 transitions. Second operand 8 states. [2020-10-21 23:15:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:20,992 INFO L93 Difference]: Finished difference Result 2242 states and 4958 transitions. [2020-10-21 23:15:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:15:20,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-21 23:15:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:21,005 INFO L225 Difference]: With dead ends: 2242 [2020-10-21 23:15:21,005 INFO L226 Difference]: Without dead ends: 2214 [2020-10-21 23:15:21,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:15:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2020-10-21 23:15:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1725. [2020-10-21 23:15:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2020-10-21 23:15:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3840 transitions. [2020-10-21 23:15:21,058 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3840 transitions. Word has length 14 [2020-10-21 23:15:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:21,058 INFO L481 AbstractCegarLoop]: Abstraction has 1725 states and 3840 transitions. [2020-10-21 23:15:21,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:15:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3840 transitions. [2020-10-21 23:15:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:15:21,060 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:21,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:21,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:15:21,061 INFO L429 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]=== [2020-10-21 23:15:21,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:21,061 INFO L82 PathProgramCache]: Analyzing trace with hash 416351743, now seen corresponding path program 2 times [2020-10-21 23:15:21,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:21,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985025052] [2020-10-21 23:15:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:21,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985025052] [2020-10-21 23:15:21,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:21,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:15:21,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636750152] [2020-10-21 23:15:21,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:15:21,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:21,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:15:21,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:15:21,208 INFO L87 Difference]: Start difference. First operand 1725 states and 3840 transitions. Second operand 9 states. [2020-10-21 23:15:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:22,731 INFO L93 Difference]: Finished difference Result 2150 states and 4764 transitions. [2020-10-21 23:15:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-21 23:15:22,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-10-21 23:15:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:22,744 INFO L225 Difference]: With dead ends: 2150 [2020-10-21 23:15:22,744 INFO L226 Difference]: Without dead ends: 2150 [2020-10-21 23:15:22,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2020-10-21 23:15:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2020-10-21 23:15:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1713. [2020-10-21 23:15:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2020-10-21 23:15:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 3812 transitions. [2020-10-21 23:15:22,786 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 3812 transitions. Word has length 14 [2020-10-21 23:15:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:22,786 INFO L481 AbstractCegarLoop]: Abstraction has 1713 states and 3812 transitions. [2020-10-21 23:15:22,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:15:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 3812 transitions. [2020-10-21 23:15:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:15:22,788 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:22,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:22,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:15:22,788 INFO L429 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]=== [2020-10-21 23:15:22,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1611335451, now seen corresponding path program 1 times [2020-10-21 23:15:22,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:22,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792912370] [2020-10-21 23:15:22,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:23,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792912370] [2020-10-21 23:15:23,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:23,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:15:23,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155232219] [2020-10-21 23:15:23,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:15:23,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:23,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:15:23,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:15:23,151 INFO L87 Difference]: Start difference. First operand 1713 states and 3812 transitions. Second operand 12 states. [2020-10-21 23:15:24,654 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2020-10-21 23:15:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:26,195 INFO L93 Difference]: Finished difference Result 2553 states and 5715 transitions. [2020-10-21 23:15:26,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-21 23:15:26,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-21 23:15:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:26,209 INFO L225 Difference]: With dead ends: 2553 [2020-10-21 23:15:26,210 INFO L226 Difference]: Without dead ends: 2553 [2020-10-21 23:15:26,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2020-10-21 23:15:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2020-10-21 23:15:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 1811. [2020-10-21 23:15:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2020-10-21 23:15:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 4071 transitions. [2020-10-21 23:15:26,258 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 4071 transitions. Word has length 15 [2020-10-21 23:15:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:26,258 INFO L481 AbstractCegarLoop]: Abstraction has 1811 states and 4071 transitions. [2020-10-21 23:15:26,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:15:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 4071 transitions. [2020-10-21 23:15:26,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:15:26,260 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:26,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:26,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:15:26,260 INFO L429 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]=== [2020-10-21 23:15:26,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:26,261 INFO L82 PathProgramCache]: Analyzing trace with hash -348384689, now seen corresponding path program 1 times [2020-10-21 23:15:26,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:26,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153938103] [2020-10-21 23:15:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:26,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153938103] [2020-10-21 23:15:26,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:26,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:15:26,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990610721] [2020-10-21 23:15:26,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 23:15:26,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:26,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 23:15:26,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:15:26,415 INFO L87 Difference]: Start difference. First operand 1811 states and 4071 transitions. Second operand 11 states. [2020-10-21 23:15:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:28,345 INFO L93 Difference]: Finished difference Result 2648 states and 5891 transitions. [2020-10-21 23:15:28,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-21 23:15:28,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2020-10-21 23:15:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:28,354 INFO L225 Difference]: With dead ends: 2648 [2020-10-21 23:15:28,354 INFO L226 Difference]: Without dead ends: 2648 [2020-10-21 23:15:28,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2020-10-21 23:15:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2020-10-21 23:15:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1839. [2020-10-21 23:15:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2020-10-21 23:15:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 4135 transitions. [2020-10-21 23:15:28,401 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 4135 transitions. Word has length 15 [2020-10-21 23:15:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:28,401 INFO L481 AbstractCegarLoop]: Abstraction has 1839 states and 4135 transitions. [2020-10-21 23:15:28,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 23:15:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 4135 transitions. [2020-10-21 23:15:28,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:15:28,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:28,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:28,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:15:28,403 INFO L429 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]=== [2020-10-21 23:15:28,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:28,404 INFO L82 PathProgramCache]: Analyzing trace with hash 655530697, now seen corresponding path program 2 times [2020-10-21 23:15:28,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:28,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97324778] [2020-10-21 23:15:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:28,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97324778] [2020-10-21 23:15:28,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:28,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:15:28,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984276578] [2020-10-21 23:15:28,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:15:28,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:28,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:15:28,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:15:28,779 INFO L87 Difference]: Start difference. First operand 1839 states and 4135 transitions. Second operand 12 states. [2020-10-21 23:15:30,417 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2020-10-21 23:15:30,682 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2020-10-21 23:15:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:32,430 INFO L93 Difference]: Finished difference Result 2917 states and 6558 transitions. [2020-10-21 23:15:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-21 23:15:32,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-21 23:15:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:32,437 INFO L225 Difference]: With dead ends: 2917 [2020-10-21 23:15:32,438 INFO L226 Difference]: Without dead ends: 2917 [2020-10-21 23:15:32,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2020-10-21 23:15:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-10-21 23:15:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1825. [2020-10-21 23:15:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2020-10-21 23:15:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 4089 transitions. [2020-10-21 23:15:32,486 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 4089 transitions. Word has length 15 [2020-10-21 23:15:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:32,487 INFO L481 AbstractCegarLoop]: Abstraction has 1825 states and 4089 transitions. [2020-10-21 23:15:32,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:15:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 4089 transitions. [2020-10-21 23:15:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:15:32,489 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:32,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:32,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:15:32,489 INFO L429 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]=== [2020-10-21 23:15:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:32,490 INFO L82 PathProgramCache]: Analyzing trace with hash 577185919, now seen corresponding path program 3 times [2020-10-21 23:15:32,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:32,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962394034] [2020-10-21 23:15:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:32,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962394034] [2020-10-21 23:15:32,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:32,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:15:32,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129756032] [2020-10-21 23:15:32,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:15:32,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:32,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:15:32,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:15:32,871 INFO L87 Difference]: Start difference. First operand 1825 states and 4089 transitions. Second operand 12 states. [2020-10-21 23:15:34,031 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2020-10-21 23:15:34,565 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2020-10-21 23:15:34,812 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2020-10-21 23:15:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:36,295 INFO L93 Difference]: Finished difference Result 2602 states and 5834 transitions. [2020-10-21 23:15:36,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-21 23:15:36,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-21 23:15:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:36,302 INFO L225 Difference]: With dead ends: 2602 [2020-10-21 23:15:36,303 INFO L226 Difference]: Without dead ends: 2602 [2020-10-21 23:15:36,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2020-10-21 23:15:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-10-21 23:15:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 1783. [2020-10-21 23:15:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1783 states. [2020-10-21 23:15:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 3979 transitions. [2020-10-21 23:15:36,346 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 3979 transitions. Word has length 15 [2020-10-21 23:15:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:36,347 INFO L481 AbstractCegarLoop]: Abstraction has 1783 states and 3979 transitions. [2020-10-21 23:15:36,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:15:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 3979 transitions. [2020-10-21 23:15:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:15:36,348 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:36,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:36,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:15:36,349 INFO L429 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]=== [2020-10-21 23:15:36,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash -851397507, now seen corresponding path program 4 times [2020-10-21 23:15:36,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:36,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285991064] [2020-10-21 23:15:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:36,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285991064] [2020-10-21 23:15:36,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:36,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:15:36,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625706902] [2020-10-21 23:15:36,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:15:36,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:36,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:15:36,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:15:36,678 INFO L87 Difference]: Start difference. First operand 1783 states and 3979 transitions. Second operand 12 states. [2020-10-21 23:15:37,946 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2020-10-21 23:15:38,377 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2020-10-21 23:15:38,621 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2020-10-21 23:15:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:39,863 INFO L93 Difference]: Finished difference Result 2289 states and 5114 transitions. [2020-10-21 23:15:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-21 23:15:39,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-21 23:15:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:39,870 INFO L225 Difference]: With dead ends: 2289 [2020-10-21 23:15:39,870 INFO L226 Difference]: Without dead ends: 2289 [2020-10-21 23:15:39,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=252, Invalid=560, Unknown=0, NotChecked=0, Total=812 [2020-10-21 23:15:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2020-10-21 23:15:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1769. [2020-10-21 23:15:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1769 states. [2020-10-21 23:15:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 3947 transitions. [2020-10-21 23:15:39,909 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 3947 transitions. Word has length 15 [2020-10-21 23:15:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:39,909 INFO L481 AbstractCegarLoop]: Abstraction has 1769 states and 3947 transitions. [2020-10-21 23:15:39,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:15:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 3947 transitions. [2020-10-21 23:15:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:15:39,910 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:39,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:39,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:15:39,911 INFO L429 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]=== [2020-10-21 23:15:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash -802041889, now seen corresponding path program 5 times [2020-10-21 23:15:39,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:39,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201600116] [2020-10-21 23:15:39,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:40,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201600116] [2020-10-21 23:15:40,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:40,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:15:40,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559381133] [2020-10-21 23:15:40,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:15:40,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:40,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:15:40,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:15:40,218 INFO L87 Difference]: Start difference. First operand 1769 states and 3947 transitions. Second operand 12 states. [2020-10-21 23:15:41,974 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2020-10-21 23:15:42,197 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2020-10-21 23:15:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:43,641 INFO L93 Difference]: Finished difference Result 2231 states and 4987 transitions. [2020-10-21 23:15:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-21 23:15:43,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-21 23:15:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:43,647 INFO L225 Difference]: With dead ends: 2231 [2020-10-21 23:15:43,647 INFO L226 Difference]: Without dead ends: 2231 [2020-10-21 23:15:43,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=282, Invalid=710, Unknown=0, NotChecked=0, Total=992 [2020-10-21 23:15:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2020-10-21 23:15:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1757. [2020-10-21 23:15:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1757 states. [2020-10-21 23:15:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 3919 transitions. [2020-10-21 23:15:43,690 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 3919 transitions. Word has length 15 [2020-10-21 23:15:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:43,690 INFO L481 AbstractCegarLoop]: Abstraction has 1757 states and 3919 transitions. [2020-10-21 23:15:43,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:15:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3919 transitions. [2020-10-21 23:15:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:15:43,692 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:43,692 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:43,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:15:43,692 INFO L429 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]=== [2020-10-21 23:15:43,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:43,693 INFO L82 PathProgramCache]: Analyzing trace with hash -401473033, now seen corresponding path program 2 times [2020-10-21 23:15:43,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:43,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983868376] [2020-10-21 23:15:43,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:43,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983868376] [2020-10-21 23:15:43,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:43,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:15:43,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382773203] [2020-10-21 23:15:43,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:15:43,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:43,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:15:43,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:15:43,877 INFO L87 Difference]: Start difference. First operand 1757 states and 3919 transitions. Second operand 10 states. [2020-10-21 23:15:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:46,130 INFO L93 Difference]: Finished difference Result 2273 states and 5036 transitions. [2020-10-21 23:15:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-21 23:15:46,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-21 23:15:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:46,134 INFO L225 Difference]: With dead ends: 2273 [2020-10-21 23:15:46,134 INFO L226 Difference]: Without dead ends: 2273 [2020-10-21 23:15:46,135 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2020-10-21 23:15:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2020-10-21 23:15:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 1743. [2020-10-21 23:15:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2020-10-21 23:15:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 3887 transitions. [2020-10-21 23:15:46,174 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 3887 transitions. Word has length 15 [2020-10-21 23:15:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:46,175 INFO L481 AbstractCegarLoop]: Abstraction has 1743 states and 3887 transitions. [2020-10-21 23:15:46,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:15:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 3887 transitions. [2020-10-21 23:15:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:15:46,176 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:46,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:46,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:15:46,177 INFO L429 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]=== [2020-10-21 23:15:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:46,177 INFO L82 PathProgramCache]: Analyzing trace with hash -388390821, now seen corresponding path program 3 times [2020-10-21 23:15:46,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:46,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704706573] [2020-10-21 23:15:46,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:46,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704706573] [2020-10-21 23:15:46,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:46,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:15:46,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676582344] [2020-10-21 23:15:46,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:15:46,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:46,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:15:46,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:15:46,327 INFO L87 Difference]: Start difference. First operand 1743 states and 3887 transitions. Second operand 10 states. [2020-10-21 23:15:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:48,131 INFO L93 Difference]: Finished difference Result 2136 states and 4744 transitions. [2020-10-21 23:15:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-21 23:15:48,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-21 23:15:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:48,136 INFO L225 Difference]: With dead ends: 2136 [2020-10-21 23:15:48,137 INFO L226 Difference]: Without dead ends: 2136 [2020-10-21 23:15:48,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-10-21 23:15:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2020-10-21 23:15:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1738. [2020-10-21 23:15:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2020-10-21 23:15:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 3875 transitions. [2020-10-21 23:15:48,167 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 3875 transitions. Word has length 15 [2020-10-21 23:15:48,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:48,167 INFO L481 AbstractCegarLoop]: Abstraction has 1738 states and 3875 transitions. [2020-10-21 23:15:48,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:15:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 3875 transitions. [2020-10-21 23:15:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:15:48,169 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:48,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:48,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:15:48,169 INFO L429 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]=== [2020-10-21 23:15:48,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:48,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2085397490, now seen corresponding path program 1 times [2020-10-21 23:15:48,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:48,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526678904] [2020-10-21 23:15:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:48,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526678904] [2020-10-21 23:15:48,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:48,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:15:48,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033472417] [2020-10-21 23:15:48,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:15:48,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:48,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:15:48,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:15:48,317 INFO L87 Difference]: Start difference. First operand 1738 states and 3875 transitions. Second operand 12 states. [2020-10-21 23:15:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:50,114 INFO L93 Difference]: Finished difference Result 2805 states and 6227 transitions. [2020-10-21 23:15:50,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-21 23:15:50,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-10-21 23:15:50,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:50,124 INFO L225 Difference]: With dead ends: 2805 [2020-10-21 23:15:50,124 INFO L226 Difference]: Without dead ends: 2805 [2020-10-21 23:15:50,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2020-10-21 23:15:50,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2020-10-21 23:15:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 1780. [2020-10-21 23:15:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2020-10-21 23:15:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 3971 transitions. [2020-10-21 23:15:50,160 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 3971 transitions. Word has length 16 [2020-10-21 23:15:50,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:50,160 INFO L481 AbstractCegarLoop]: Abstraction has 1780 states and 3971 transitions. [2020-10-21 23:15:50,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:15:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 3971 transitions. [2020-10-21 23:15:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:15:50,162 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:50,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:50,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:15:50,162 INFO L429 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]=== [2020-10-21 23:15:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash -119025523, now seen corresponding path program 1 times [2020-10-21 23:15:50,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:50,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072018222] [2020-10-21 23:15:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:50,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072018222] [2020-10-21 23:15:50,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:50,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:15:50,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954458554] [2020-10-21 23:15:50,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 23:15:50,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:50,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 23:15:50,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:15:50,407 INFO L87 Difference]: Start difference. First operand 1780 states and 3971 transitions. Second operand 11 states. [2020-10-21 23:15:51,306 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2020-10-21 23:15:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:53,888 INFO L93 Difference]: Finished difference Result 2247 states and 5062 transitions. [2020-10-21 23:15:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-21 23:15:53,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2020-10-21 23:15:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:53,893 INFO L225 Difference]: With dead ends: 2247 [2020-10-21 23:15:53,893 INFO L226 Difference]: Without dead ends: 2247 [2020-10-21 23:15:53,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=282, Invalid=710, Unknown=0, NotChecked=0, Total=992 [2020-10-21 23:15:53,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2020-10-21 23:15:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1782. [2020-10-21 23:15:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1782 states. [2020-10-21 23:15:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 3977 transitions. [2020-10-21 23:15:53,919 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 3977 transitions. Word has length 16 [2020-10-21 23:15:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:53,920 INFO L481 AbstractCegarLoop]: Abstraction has 1782 states and 3977 transitions. [2020-10-21 23:15:53,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 23:15:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 3977 transitions. [2020-10-21 23:15:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:15:53,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:53,922 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:53,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:15:53,922 INFO L429 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]=== [2020-10-21 23:15:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:53,922 INFO L82 PathProgramCache]: Analyzing trace with hash 439658826, now seen corresponding path program 2 times [2020-10-21 23:15:53,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:53,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607313508] [2020-10-21 23:15:53,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:54,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607313508] [2020-10-21 23:15:54,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:54,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:15:54,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847511667] [2020-10-21 23:15:54,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 23:15:54,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:54,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 23:15:54,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:15:54,056 INFO L87 Difference]: Start difference. First operand 1782 states and 3977 transitions. Second operand 11 states. [2020-10-21 23:15:56,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:56,132 INFO L93 Difference]: Finished difference Result 2343 states and 5191 transitions. [2020-10-21 23:15:56,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-21 23:15:56,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2020-10-21 23:15:56,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:56,136 INFO L225 Difference]: With dead ends: 2343 [2020-10-21 23:15:56,136 INFO L226 Difference]: Without dead ends: 2343 [2020-10-21 23:15:56,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2020-10-21 23:15:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2020-10-21 23:15:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 1768. [2020-10-21 23:15:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1768 states. [2020-10-21 23:15:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 3945 transitions. [2020-10-21 23:15:56,160 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 3945 transitions. Word has length 16 [2020-10-21 23:15:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:56,160 INFO L481 AbstractCegarLoop]: Abstraction has 1768 states and 3945 transitions. [2020-10-21 23:15:56,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 23:15:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 3945 transitions. [2020-10-21 23:15:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:15:56,161 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:56,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:56,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 23:15:56,162 INFO L429 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]=== [2020-10-21 23:15:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:56,162 INFO L82 PathProgramCache]: Analyzing trace with hash 845207398, now seen corresponding path program 3 times [2020-10-21 23:15:56,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:56,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102647627] [2020-10-21 23:15:56,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:56,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102647627] [2020-10-21 23:15:56,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:56,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:15:56,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129922194] [2020-10-21 23:15:56,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 23:15:56,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:56,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 23:15:56,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:15:56,324 INFO L87 Difference]: Start difference. First operand 1768 states and 3945 transitions. Second operand 11 states. [2020-10-21 23:15:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:15:58,328 INFO L93 Difference]: Finished difference Result 2349 states and 5198 transitions. [2020-10-21 23:15:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-21 23:15:58,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2020-10-21 23:15:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:15:58,332 INFO L225 Difference]: With dead ends: 2349 [2020-10-21 23:15:58,332 INFO L226 Difference]: Without dead ends: 2349 [2020-10-21 23:15:58,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2020-10-21 23:15:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2020-10-21 23:15:58,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1758. [2020-10-21 23:15:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1758 states. [2020-10-21 23:15:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 3921 transitions. [2020-10-21 23:15:58,356 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 3921 transitions. Word has length 16 [2020-10-21 23:15:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:15:58,356 INFO L481 AbstractCegarLoop]: Abstraction has 1758 states and 3921 transitions. [2020-10-21 23:15:58,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 23:15:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3921 transitions. [2020-10-21 23:15:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:15:58,357 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:15:58,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:15:58,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-21 23:15:58,358 INFO L429 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]=== [2020-10-21 23:15:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:15:58,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1784687491, now seen corresponding path program 1 times [2020-10-21 23:15:58,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:15:58,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74355246] [2020-10-21 23:15:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:15:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:15:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:15:58,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74355246] [2020-10-21 23:15:58,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:15:58,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:15:58,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317598748] [2020-10-21 23:15:58,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:15:58,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:15:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:15:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:15:58,677 INFO L87 Difference]: Start difference. First operand 1758 states and 3921 transitions. Second operand 12 states. [2020-10-21 23:15:59,200 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2020-10-21 23:15:59,875 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2020-10-21 23:16:00,035 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2020-10-21 23:16:00,243 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2020-10-21 23:16:00,593 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2020-10-21 23:16:00,841 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 58 [2020-10-21 23:16:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:02,433 INFO L93 Difference]: Finished difference Result 3041 states and 6806 transitions. [2020-10-21 23:16:02,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-21 23:16:02,434 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-10-21 23:16:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:02,438 INFO L225 Difference]: With dead ends: 3041 [2020-10-21 23:16:02,438 INFO L226 Difference]: Without dead ends: 3041 [2020-10-21 23:16:02,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-10-21 23:16:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2020-10-21 23:16:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 1933. [2020-10-21 23:16:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1933 states. [2020-10-21 23:16:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 4363 transitions. [2020-10-21 23:16:02,466 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 4363 transitions. Word has length 17 [2020-10-21 23:16:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:02,466 INFO L481 AbstractCegarLoop]: Abstraction has 1933 states and 4363 transitions. [2020-10-21 23:16:02,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:16:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 4363 transitions. [2020-10-21 23:16:02,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:16:02,468 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:02,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:02,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-21 23:16:02,468 INFO L429 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]=== [2020-10-21 23:16:02,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:02,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1330492557, now seen corresponding path program 1 times [2020-10-21 23:16:02,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:02,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553303458] [2020-10-21 23:16:02,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:16:02,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553303458] [2020-10-21 23:16:02,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:16:02,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:16:02,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554178423] [2020-10-21 23:16:02,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:16:02,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:16:02,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:16:02,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:16:02,553 INFO L87 Difference]: Start difference. First operand 1933 states and 4363 transitions. Second operand 6 states. [2020-10-21 23:16:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:03,183 INFO L93 Difference]: Finished difference Result 2182 states and 4906 transitions. [2020-10-21 23:16:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:16:03,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-21 23:16:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:03,187 INFO L225 Difference]: With dead ends: 2182 [2020-10-21 23:16:03,187 INFO L226 Difference]: Without dead ends: 2182 [2020-10-21 23:16:03,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:16:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2020-10-21 23:16:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2032. [2020-10-21 23:16:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2032 states. [2020-10-21 23:16:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 4591 transitions. [2020-10-21 23:16:03,217 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 4591 transitions. Word has length 17 [2020-10-21 23:16:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:03,218 INFO L481 AbstractCegarLoop]: Abstraction has 2032 states and 4591 transitions. [2020-10-21 23:16:03,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:16:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 4591 transitions. [2020-10-21 23:16:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:16:03,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:03,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:03,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-21 23:16:03,220 INFO L429 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]=== [2020-10-21 23:16:03,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1600330649, now seen corresponding path program 2 times [2020-10-21 23:16:03,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:03,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239927793] [2020-10-21 23:16:03,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:16:03,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239927793] [2020-10-21 23:16:03,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:16:03,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:16:03,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091011014] [2020-10-21 23:16:03,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:16:03,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:16:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:16:03,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:16:03,516 INFO L87 Difference]: Start difference. First operand 2032 states and 4591 transitions. Second operand 12 states. [2020-10-21 23:16:04,679 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2020-10-21 23:16:05,028 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2020-10-21 23:16:05,420 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2020-10-21 23:16:05,697 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 58 [2020-10-21 23:16:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:07,420 INFO L93 Difference]: Finished difference Result 3343 states and 7506 transitions. [2020-10-21 23:16:07,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-21 23:16:07,421 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-10-21 23:16:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:07,426 INFO L225 Difference]: With dead ends: 3343 [2020-10-21 23:16:07,426 INFO L226 Difference]: Without dead ends: 3343 [2020-10-21 23:16:07,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2020-10-21 23:16:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2020-10-21 23:16:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 2018. [2020-10-21 23:16:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2020-10-21 23:16:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 4545 transitions. [2020-10-21 23:16:07,461 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 4545 transitions. Word has length 17 [2020-10-21 23:16:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:07,462 INFO L481 AbstractCegarLoop]: Abstraction has 2018 states and 4545 transitions. [2020-10-21 23:16:07,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:16:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 4545 transitions. [2020-10-21 23:16:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:16:07,464 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:07,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:07,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-21 23:16:07,464 INFO L429 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]=== [2020-10-21 23:16:07,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:07,465 INFO L82 PathProgramCache]: Analyzing trace with hash 419749021, now seen corresponding path program 3 times [2020-10-21 23:16:07,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:07,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790296648] [2020-10-21 23:16:07,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:16:07,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790296648] [2020-10-21 23:16:07,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:16:07,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:16:07,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910397093] [2020-10-21 23:16:07,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:16:07,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:16:07,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:16:07,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:16:07,824 INFO L87 Difference]: Start difference. First operand 2018 states and 4545 transitions. Second operand 12 states. [2020-10-21 23:16:09,052 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2020-10-21 23:16:09,386 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2020-10-21 23:16:09,735 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2020-10-21 23:16:09,999 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 58 [2020-10-21 23:16:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:11,608 INFO L93 Difference]: Finished difference Result 3056 states and 6849 transitions. [2020-10-21 23:16:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-21 23:16:11,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-10-21 23:16:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:11,613 INFO L225 Difference]: With dead ends: 3056 [2020-10-21 23:16:11,613 INFO L226 Difference]: Without dead ends: 3056 [2020-10-21 23:16:11,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2020-10-21 23:16:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2020-10-21 23:16:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 1976. [2020-10-21 23:16:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2020-10-21 23:16:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 4435 transitions. [2020-10-21 23:16:11,646 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 4435 transitions. Word has length 17 [2020-10-21 23:16:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:11,647 INFO L481 AbstractCegarLoop]: Abstraction has 1976 states and 4435 transitions. [2020-10-21 23:16:11,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:16:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 4435 transitions. [2020-10-21 23:16:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:16:11,648 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:11,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:11,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-21 23:16:11,649 INFO L429 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]=== [2020-10-21 23:16:11,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:11,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1940611355, now seen corresponding path program 4 times [2020-10-21 23:16:11,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:11,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328610927] [2020-10-21 23:16:11,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:16:11,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328610927] [2020-10-21 23:16:11,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:16:11,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:16:11,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967999580] [2020-10-21 23:16:11,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:16:11,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:16:11,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:16:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:16:11,921 INFO L87 Difference]: Start difference. First operand 1976 states and 4435 transitions. Second operand 12 states. [2020-10-21 23:16:13,222 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2020-10-21 23:16:13,437 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 [2020-10-21 23:16:13,700 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-10-21 23:16:13,911 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 [2020-10-21 23:16:14,167 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2020-10-21 23:16:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:15,779 INFO L93 Difference]: Finished difference Result 2810 states and 6280 transitions. [2020-10-21 23:16:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-21 23:16:15,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-10-21 23:16:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:15,788 INFO L225 Difference]: With dead ends: 2810 [2020-10-21 23:16:15,788 INFO L226 Difference]: Without dead ends: 2810 [2020-10-21 23:16:15,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=268, Invalid=662, Unknown=0, NotChecked=0, Total=930 [2020-10-21 23:16:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2020-10-21 23:16:15,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 1962. [2020-10-21 23:16:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-10-21 23:16:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 4403 transitions. [2020-10-21 23:16:15,818 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 4403 transitions. Word has length 17 [2020-10-21 23:16:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:15,818 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 4403 transitions. [2020-10-21 23:16:15,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:16:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 4403 transitions. [2020-10-21 23:16:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:16:15,820 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:15,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:15,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-21 23:16:15,820 INFO L429 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]=== [2020-10-21 23:16:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2126719997, now seen corresponding path program 5 times [2020-10-21 23:16:15,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:15,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15329880] [2020-10-21 23:16:15,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:16:16,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15329880] [2020-10-21 23:16:16,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:16:16,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:16:16,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069884665] [2020-10-21 23:16:16,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:16:16,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:16:16,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:16:16,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:16:16,070 INFO L87 Difference]: Start difference. First operand 1962 states and 4403 transitions. Second operand 12 states. [2020-10-21 23:16:17,528 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2020-10-21 23:16:17,677 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-10-21 23:16:17,880 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-10-21 23:16:18,034 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 [2020-10-21 23:16:18,352 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-10-21 23:16:18,543 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-10-21 23:16:18,749 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2020-10-21 23:16:18,968 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2020-10-21 23:16:19,183 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2020-10-21 23:16:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:21,358 INFO L93 Difference]: Finished difference Result 2833 states and 6327 transitions. [2020-10-21 23:16:21,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-10-21 23:16:21,359 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-10-21 23:16:21,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:21,363 INFO L225 Difference]: With dead ends: 2833 [2020-10-21 23:16:21,363 INFO L226 Difference]: Without dead ends: 2833 [2020-10-21 23:16:21,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2020-10-21 23:16:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2020-10-21 23:16:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 1941. [2020-10-21 23:16:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2020-10-21 23:16:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 4355 transitions. [2020-10-21 23:16:21,392 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 4355 transitions. Word has length 17 [2020-10-21 23:16:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:21,392 INFO L481 AbstractCegarLoop]: Abstraction has 1941 states and 4355 transitions. [2020-10-21 23:16:21,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:16:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 4355 transitions. [2020-10-21 23:16:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:16:21,393 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:21,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:21,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-21 23:16:21,394 INFO L429 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]=== [2020-10-21 23:16:21,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:21,394 INFO L82 PathProgramCache]: Analyzing trace with hash 242653291, now seen corresponding path program 6 times [2020-10-21 23:16:21,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:21,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883892033] [2020-10-21 23:16:21,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:16:21,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883892033] [2020-10-21 23:16:21,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:16:21,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:16:21,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945373789] [2020-10-21 23:16:21,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:16:21,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:16:21,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:16:21,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:16:21,669 INFO L87 Difference]: Start difference. First operand 1941 states and 4355 transitions. Second operand 12 states. [2020-10-21 23:16:23,108 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2020-10-21 23:16:23,261 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-10-21 23:16:23,464 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-10-21 23:16:23,784 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-10-21 23:16:23,973 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-10-21 23:16:24,198 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2020-10-21 23:16:24,416 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2020-10-21 23:16:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:26,639 INFO L93 Difference]: Finished difference Result 3105 states and 6949 transitions. [2020-10-21 23:16:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-10-21 23:16:26,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-10-21 23:16:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:26,645 INFO L225 Difference]: With dead ends: 3105 [2020-10-21 23:16:26,645 INFO L226 Difference]: Without dead ends: 3105 [2020-10-21 23:16:26,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=374, Invalid=1032, Unknown=0, NotChecked=0, Total=1406 [2020-10-21 23:16:26,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2020-10-21 23:16:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 1946. [2020-10-21 23:16:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-10-21 23:16:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 4356 transitions. [2020-10-21 23:16:26,678 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 4356 transitions. Word has length 17 [2020-10-21 23:16:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:26,678 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 4356 transitions. [2020-10-21 23:16:26,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:16:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 4356 transitions. [2020-10-21 23:16:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:16:26,679 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:26,679 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:26,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-21 23:16:26,680 INFO L429 AbstractCegarLoop]: === Iteration 28 === [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]=== [2020-10-21 23:16:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:26,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1800007828, now seen corresponding path program 1 times [2020-10-21 23:16:26,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:26,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872672268] [2020-10-21 23:16:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:16:26,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872672268] [2020-10-21 23:16:26,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:16:26,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:16:26,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935776536] [2020-10-21 23:16:26,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:16:26,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:16:26,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:16:26,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:16:26,982 INFO L87 Difference]: Start difference. First operand 1946 states and 4356 transitions. Second operand 14 states. [2020-10-21 23:16:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:31,046 INFO L93 Difference]: Finished difference Result 2978 states and 6674 transitions. [2020-10-21 23:16:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-21 23:16:31,047 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-21 23:16:31,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:31,051 INFO L225 Difference]: With dead ends: 2978 [2020-10-21 23:16:31,052 INFO L226 Difference]: Without dead ends: 2978 [2020-10-21 23:16:31,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=436, Invalid=970, Unknown=0, NotChecked=0, Total=1406 [2020-10-21 23:16:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-10-21 23:16:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2002. [2020-10-21 23:16:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2020-10-21 23:16:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4491 transitions. [2020-10-21 23:16:31,076 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4491 transitions. Word has length 18 [2020-10-21 23:16:31,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:31,076 INFO L481 AbstractCegarLoop]: Abstraction has 2002 states and 4491 transitions. [2020-10-21 23:16:31,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:16:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4491 transitions. [2020-10-21 23:16:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:16:31,078 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:31,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:31,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-21 23:16:31,078 INFO L429 AbstractCegarLoop]: === Iteration 29 === [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]=== [2020-10-21 23:16:31,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:31,079 INFO L82 PathProgramCache]: Analyzing trace with hash -635521939, now seen corresponding path program 1 times [2020-10-21 23:16:31,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:31,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736580519] [2020-10-21 23:16:31,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:16:31,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736580519] [2020-10-21 23:16:31,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:16:31,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-21 23:16:31,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085509342] [2020-10-21 23:16:31,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-21 23:16:31,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:16:31,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-21 23:16:31,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-10-21 23:16:31,588 INFO L87 Difference]: Start difference. First operand 2002 states and 4491 transitions. Second operand 15 states. [2020-10-21 23:16:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:34,574 INFO L93 Difference]: Finished difference Result 3399 states and 7570 transitions. [2020-10-21 23:16:34,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-21 23:16:34,575 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-10-21 23:16:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:34,579 INFO L225 Difference]: With dead ends: 3399 [2020-10-21 23:16:34,579 INFO L226 Difference]: Without dead ends: 3399 [2020-10-21 23:16:34,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2020-10-21 23:16:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2020-10-21 23:16:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 1992. [2020-10-21 23:16:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2020-10-21 23:16:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 4460 transitions. [2020-10-21 23:16:34,617 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 4460 transitions. Word has length 18 [2020-10-21 23:16:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:34,617 INFO L481 AbstractCegarLoop]: Abstraction has 1992 states and 4460 transitions. [2020-10-21 23:16:34,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-21 23:16:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 4460 transitions. [2020-10-21 23:16:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:16:34,619 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:34,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:34,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-21 23:16:34,620 INFO L429 AbstractCegarLoop]: === Iteration 30 === [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]=== [2020-10-21 23:16:34,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:34,620 INFO L82 PathProgramCache]: Analyzing trace with hash 793116652, now seen corresponding path program 2 times [2020-10-21 23:16:34,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:34,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562113348] [2020-10-21 23:16:34,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:16:34,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562113348] [2020-10-21 23:16:34,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:16:34,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-21 23:16:34,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659957331] [2020-10-21 23:16:34,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-21 23:16:34,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:16:34,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-21 23:16:34,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:16:34,911 INFO L87 Difference]: Start difference. First operand 1992 states and 4460 transitions. Second operand 13 states. [2020-10-21 23:16:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:38,481 INFO L93 Difference]: Finished difference Result 2470 states and 5519 transitions. [2020-10-21 23:16:38,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-21 23:16:38,483 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-21 23:16:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:38,487 INFO L225 Difference]: With dead ends: 2470 [2020-10-21 23:16:38,487 INFO L226 Difference]: Without dead ends: 2470 [2020-10-21 23:16:38,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2020-10-21 23:16:38,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2020-10-21 23:16:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 1978. [2020-10-21 23:16:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2020-10-21 23:16:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 4428 transitions. [2020-10-21 23:16:38,511 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 4428 transitions. Word has length 18 [2020-10-21 23:16:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:38,512 INFO L481 AbstractCegarLoop]: Abstraction has 1978 states and 4428 transitions. [2020-10-21 23:16:38,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-21 23:16:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 4428 transitions. [2020-10-21 23:16:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:16:38,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:38,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:38,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-21 23:16:38,514 INFO L429 AbstractCegarLoop]: === Iteration 31 === [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]=== [2020-10-21 23:16:38,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:38,514 INFO L82 PathProgramCache]: Analyzing trace with hash -316729592, now seen corresponding path program 3 times [2020-10-21 23:16:38,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:38,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935532561] [2020-10-21 23:16:38,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:16:38,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935532561] [2020-10-21 23:16:38,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:16:38,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-21 23:16:38,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423953455] [2020-10-21 23:16:38,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-21 23:16:38,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:16:38,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-21 23:16:38,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:16:38,874 INFO L87 Difference]: Start difference. First operand 1978 states and 4428 transitions. Second operand 13 states. [2020-10-21 23:16:41,020 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2020-10-21 23:16:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:42,519 INFO L93 Difference]: Finished difference Result 2550 states and 5685 transitions. [2020-10-21 23:16:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-21 23:16:42,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-21 23:16:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:42,523 INFO L225 Difference]: With dead ends: 2550 [2020-10-21 23:16:42,523 INFO L226 Difference]: Without dead ends: 2550 [2020-10-21 23:16:42,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=265, Invalid=665, Unknown=0, NotChecked=0, Total=930 [2020-10-21 23:16:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2020-10-21 23:16:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 1964. [2020-10-21 23:16:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2020-10-21 23:16:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 4396 transitions. [2020-10-21 23:16:42,545 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 4396 transitions. Word has length 18 [2020-10-21 23:16:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:42,545 INFO L481 AbstractCegarLoop]: Abstraction has 1964 states and 4396 transitions. [2020-10-21 23:16:42,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-21 23:16:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 4396 transitions. [2020-10-21 23:16:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:16:42,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:42,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:42,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-21 23:16:42,547 INFO L429 AbstractCegarLoop]: === Iteration 32 === [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]=== [2020-10-21 23:16:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1741722670, now seen corresponding path program 4 times [2020-10-21 23:16:42,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:42,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985493610] [2020-10-21 23:16:42,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:16:42,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985493610] [2020-10-21 23:16:42,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:16:42,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-21 23:16:42,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576576515] [2020-10-21 23:16:42,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-21 23:16:42,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:16:42,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-21 23:16:42,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:16:42,864 INFO L87 Difference]: Start difference. First operand 1964 states and 4396 transitions. Second operand 13 states. [2020-10-21 23:16:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:46,540 INFO L93 Difference]: Finished difference Result 2514 states and 5608 transitions. [2020-10-21 23:16:46,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-21 23:16:46,541 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-21 23:16:46,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:46,545 INFO L225 Difference]: With dead ends: 2514 [2020-10-21 23:16:46,545 INFO L226 Difference]: Without dead ends: 2514 [2020-10-21 23:16:46,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2020-10-21 23:16:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2020-10-21 23:16:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 1964. [2020-10-21 23:16:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2020-10-21 23:16:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 4396 transitions. [2020-10-21 23:16:46,567 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 4396 transitions. Word has length 18 [2020-10-21 23:16:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:46,567 INFO L481 AbstractCegarLoop]: Abstraction has 1964 states and 4396 transitions. [2020-10-21 23:16:46,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-21 23:16:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 4396 transitions. [2020-10-21 23:16:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:16:46,568 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:46,568 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:46,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-21 23:16:46,569 INFO L429 AbstractCegarLoop]: === Iteration 33 === [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]=== [2020-10-21 23:16:46,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1692367052, now seen corresponding path program 5 times [2020-10-21 23:16:46,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:46,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981347151] [2020-10-21 23:16:46,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:16:46,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981347151] [2020-10-21 23:16:46,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:16:46,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-21 23:16:46,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722028492] [2020-10-21 23:16:46,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-21 23:16:46,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:16:46,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-21 23:16:46,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:16:46,855 INFO L87 Difference]: Start difference. First operand 1964 states and 4396 transitions. Second operand 13 states. [2020-10-21 23:16:49,599 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2020-10-21 23:16:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:16:51,716 INFO L93 Difference]: Finished difference Result 2578 states and 5774 transitions. [2020-10-21 23:16:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-10-21 23:16:51,717 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-21 23:16:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:16:51,721 INFO L225 Difference]: With dead ends: 2578 [2020-10-21 23:16:51,721 INFO L226 Difference]: Without dead ends: 2578 [2020-10-21 23:16:51,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=453, Invalid=1107, Unknown=0, NotChecked=0, Total=1560 [2020-10-21 23:16:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2020-10-21 23:16:51,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1968. [2020-10-21 23:16:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1968 states. [2020-10-21 23:16:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 4406 transitions. [2020-10-21 23:16:51,746 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 4406 transitions. Word has length 18 [2020-10-21 23:16:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:16:51,747 INFO L481 AbstractCegarLoop]: Abstraction has 1968 states and 4406 transitions. [2020-10-21 23:16:51,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-21 23:16:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 4406 transitions. [2020-10-21 23:16:51,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:16:51,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:16:51,749 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:16:51,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-21 23:16:51,749 INFO L429 AbstractCegarLoop]: === Iteration 34 === [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]=== [2020-10-21 23:16:51,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:16:51,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1339854879, now seen corresponding path program 1 times [2020-10-21 23:16:51,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:16:51,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935666305] [2020-10-21 23:16:51,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:16:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:16:51,794 ERROR L253 erpolLogProxyWrapper]: Interpolant 11 not inductive [2020-10-21 23:16:51,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-21 23:16:51,799 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-10-21 23:16:51,803 INFO L168 Benchmark]: Toolchain (without parser) took 119739.09 ms. Allocated memory was 140.5 MB in the beginning and 734.5 MB in the end (delta: 594.0 MB). Free memory was 101.3 MB in the beginning and 394.8 MB in the end (delta: -293.5 MB). Peak memory consumption was 300.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:16:51,804 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-21 23:16:51,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1187.78 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 100.4 MB in the beginning and 127.7 MB in the end (delta: -27.2 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2020-10-21 23:16:51,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.34 ms. Allocated memory is still 202.9 MB. Free memory was 127.7 MB in the beginning and 122.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:16:51,805 INFO L168 Benchmark]: Boogie Preprocessor took 99.10 ms. Allocated memory is still 202.9 MB. Free memory was 122.9 MB in the beginning and 118.8 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-10-21 23:16:51,806 INFO L168 Benchmark]: RCFGBuilder took 1068.33 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 118.8 MB in the beginning and 143.8 MB in the end (delta: -25.0 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:16:51,806 INFO L168 Benchmark]: TraceAbstraction took 117251.30 ms. Allocated memory was 236.5 MB in the beginning and 734.5 MB in the end (delta: 498.1 MB). Free memory was 142.4 MB in the beginning and 394.8 MB in the end (delta: -252.4 MB). Peak memory consumption was 245.6 MB. Max. memory is 7.1 GB. [2020-10-21 23:16:51,808 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1187.78 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 100.4 MB in the beginning and 127.7 MB in the end (delta: -27.2 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 120.34 ms. Allocated memory is still 202.9 MB. Free memory was 127.7 MB in the beginning and 122.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.10 ms. Allocated memory is still 202.9 MB. Free memory was 122.9 MB in the beginning and 118.8 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1068.33 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 118.8 MB in the beginning and 143.8 MB in the end (delta: -25.0 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117251.30 ms. Allocated memory was 236.5 MB in the beginning and 734.5 MB in the end (delta: 498.1 MB). Free memory was 142.4 MB in the beginning and 394.8 MB in the end (delta: -252.4 MB). Peak memory consumption was 245.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 18420 VarBasedMoverChecksPositive, 257 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 745 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 20.9s, 459 PlacesBefore, 109 PlacesAfterwards, 498 TransitionsBefore, 126 TransitionsAfterwards, 34102 CoEnabledTransitionPairs, 7 FixpointIterations, 155 TrivialSequentialCompositions, 261 ConcurrentSequentialCompositions, 31 TrivialYvCompositions, 70 ConcurrentYvCompositions, 22 ChoiceCompositions, 539 TotalNumberOfCompositions, 79858 MoverChecksTotal - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...