/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/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:10:26,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:10:26,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:10:26,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:10:26,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:10:26,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:10:26,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:10:26,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:10:26,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:10:26,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:10:26,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:10:26,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:10:26,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:10:26,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:10:26,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:10:26,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:10:26,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:10:26,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:10:26,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:10:26,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:10:26,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:10:26,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:10:26,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:10:26,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:10:26,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:10:26,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:10:26,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:10:26,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:10:26,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:10:26,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:10:26,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:10:26,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:10:26,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:10:26,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:10:26,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:10:26,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:10:26,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:10:26,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:10:26,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:10:26,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:10:26,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:10:26,736 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:10:26,775 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:10:26,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:10:26,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:10:26,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:10:26,777 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:10:26,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:10:26,778 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:10:26,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:10:26,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:10:26,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:10:26,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:10:26,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:10:26,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:10:26,780 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:10:26,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:10:26,781 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:10:26,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:10:26,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:10:26,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:10:26,781 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:10:26,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:10:26,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:10:26,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:10:26,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:10:26,782 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:10:26,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:10:26,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:10:26,783 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:10:26,783 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:10:27,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:10:27,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:10:27,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:10:27,087 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:10:27,088 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:10:27,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-21 23:10:27,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8cdba4b4/19c3e2cc25994e358bf0adb670b82b03/FLAG7af18c489 [2020-10-21 23:10:27,752 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:10:27,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-21 23:10:27,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8cdba4b4/19c3e2cc25994e358bf0adb670b82b03/FLAG7af18c489 [2020-10-21 23:10:27,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8cdba4b4/19c3e2cc25994e358bf0adb670b82b03 [2020-10-21 23:10:27,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:10:27,957 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:10:27,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:10:27,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:10:27,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:10:27,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:10:27" (1/1) ... [2020-10-21 23:10:27,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d1e96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:27, skipping insertion in model container [2020-10-21 23:10:27,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:10:27" (1/1) ... [2020-10-21 23:10:27,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:10:28,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:10:28,207 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-10-21 23:10:28,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:10:28,764 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:10:28,784 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-10-21 23:10:28,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:10:29,339 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:10:29,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:29 WrapperNode [2020-10-21 23:10:29,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:10:29,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:10:29,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:10:29,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:10:29,353 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:10:29" (1/1) ... [2020-10-21 23:10:29,406 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:10:29" (1/1) ... [2020-10-21 23:10:29,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:10:29,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:10:29,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:10:29,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:10:29,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:29" (1/1) ... [2020-10-21 23:10:29,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:29" (1/1) ... [2020-10-21 23:10:29,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:29" (1/1) ... [2020-10-21 23:10:29,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:29" (1/1) ... [2020-10-21 23:10:29,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:29" (1/1) ... [2020-10-21 23:10:29,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:29" (1/1) ... [2020-10-21 23:10:29,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:29" (1/1) ... [2020-10-21 23:10:29,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:10:29,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:10:29,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:10:29,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:10:29,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:29" (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:10:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:10:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:10:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:10:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-21 23:10:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-21 23:10:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:10:29,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:10:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-21 23:10:29,583 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-21 23:10:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:10:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:10:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:10:29,585 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:10:30,330 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:10:30,330 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-10-21 23:10:30,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:10:30 BoogieIcfgContainer [2020-10-21 23:10:30,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:10:30,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:10:30,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:10:30,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:10:30,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:10:27" (1/3) ... [2020-10-21 23:10:30,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd20c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:10:30, skipping insertion in model container [2020-10-21 23:10:30,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:29" (2/3) ... [2020-10-21 23:10:30,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd20c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:10:30, skipping insertion in model container [2020-10-21 23:10:30,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:10:30" (3/3) ... [2020-10-21 23:10:30,343 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-10-21 23:10:30,356 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:10:30,356 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:10:30,365 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-21 23:10:30,366 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:10:30,400 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,400 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,400 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,401 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,401 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,401 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,402 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,402 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,402 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,402 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,402 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,402 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,403 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,403 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,403 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,403 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,403 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,404 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,404 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,404 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,404 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,404 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,405 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,405 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,405 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,405 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,405 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,406 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,406 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,406 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,406 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,406 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,407 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,407 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,407 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,407 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,408 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,408 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,411 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,412 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,412 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,412 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,413 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,413 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,413 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,413 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,413 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,417 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,417 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,418 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,418 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,418 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,418 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,418 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,419 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,419 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:30,432 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-10-21 23:10:30,447 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-21 23:10:30,465 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:10:30,465 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:10:30,466 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:10:30,466 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:10:30,466 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:10:30,466 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:10:30,466 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:10:30,466 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:10:30,483 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:10:30,484 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 178 transitions, 378 flow [2020-10-21 23:10:30,487 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 178 transitions, 378 flow [2020-10-21 23:10:30,489 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 168 places, 178 transitions, 378 flow [2020-10-21 23:10:30,576 INFO L129 PetriNetUnfolder]: 19/226 cut-off events. [2020-10-21 23:10:30,576 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-21 23:10:30,582 INFO L80 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 226 events. 19/226 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 444 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 126. Up to 4 conditions per place. [2020-10-21 23:10:30,588 INFO L116 LiptonReduction]: Number of co-enabled transitions 1872 [2020-10-21 23:10:32,143 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:10:32,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:32,167 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-21 23:10:32,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:32,182 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-21 23:10:32,183 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-21 23:10:32,955 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-10-21 23:10:34,207 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-10-21 23:10:34,905 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2020-10-21 23:10:34,923 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:10:35,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:35,023 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-21 23:10:35,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:35,100 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-21 23:10:35,100 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:135 [2020-10-21 23:10:35,414 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2020-10-21 23:10:35,431 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:10:35,526 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:35,532 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-21 23:10:35,625 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:35,626 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-21 23:10:35,627 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:172, output treesize:144 [2020-10-21 23:10:35,742 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-21 23:10:36,964 WARN L193 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 144 [2020-10-21 23:10:37,286 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-10-21 23:10:37,481 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2020-10-21 23:10:39,365 WARN L193 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 173 DAG size of output: 171 [2020-10-21 23:10:39,406 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:10:40,375 WARN L193 SmtUtils]: Spent 967.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-10-21 23:10:40,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:40,397 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-21 23:10:41,196 WARN L193 SmtUtils]: Spent 797.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-21 23:10:41,197 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:41,199 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-21 23:10:41,199 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-10-21 23:10:41,967 WARN L193 SmtUtils]: Spent 766.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-21 23:10:42,861 WARN L193 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2020-10-21 23:10:43,288 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-21 23:10:43,298 INFO L131 LiptonReduction]: Checked pairs total: 3600 [2020-10-21 23:10:43,298 INFO L133 LiptonReduction]: Total number of compositions: 222 [2020-10-21 23:10:43,304 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 32 transitions, 86 flow [2020-10-21 23:10:43,320 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 121 states. [2020-10-21 23:10:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2020-10-21 23:10:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-21 23:10:43,328 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:43,328 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-21 23:10:43,329 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:43,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:43,335 INFO L82 PathProgramCache]: Analyzing trace with hash 688, now seen corresponding path program 1 times [2020-10-21 23:10:43,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:43,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159788227] [2020-10-21 23:10:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:43,631 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:10:43,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159788227] [2020-10-21 23:10:43,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:43,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-21 23:10:43,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723532542] [2020-10-21 23:10:43,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-21 23:10:43,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:43,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-21 23:10:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-21 23:10:43,652 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 2 states. [2020-10-21 23:10:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:43,670 INFO L93 Difference]: Finished difference Result 119 states and 236 transitions. [2020-10-21 23:10:43,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-21 23:10:43,672 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-21 23:10:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:43,682 INFO L225 Difference]: With dead ends: 119 [2020-10-21 23:10:43,682 INFO L226 Difference]: Without dead ends: 108 [2020-10-21 23:10:43,684 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:10:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-10-21 23:10:43,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-10-21 23:10:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-10-21 23:10:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 213 transitions. [2020-10-21 23:10:43,732 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 213 transitions. Word has length 1 [2020-10-21 23:10:43,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:43,733 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 213 transitions. [2020-10-21 23:10:43,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-21 23:10:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 213 transitions. [2020-10-21 23:10:43,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 23:10:43,734 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:43,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 23:10:43,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:10:43,735 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:43,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:43,735 INFO L82 PathProgramCache]: Analyzing trace with hash 654434250, now seen corresponding path program 1 times [2020-10-21 23:10:43,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:43,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994755010] [2020-10-21 23:10:43,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:43,949 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:10:43,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994755010] [2020-10-21 23:10:43,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:43,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:10:43,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840805477] [2020-10-21 23:10:43,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:10:43,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:43,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:10:43,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:10:43,953 INFO L87 Difference]: Start difference. First operand 108 states and 213 transitions. Second operand 4 states. [2020-10-21 23:10:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:44,111 INFO L93 Difference]: Finished difference Result 146 states and 291 transitions. [2020-10-21 23:10:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:10:44,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-10-21 23:10:44,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:44,118 INFO L225 Difference]: With dead ends: 146 [2020-10-21 23:10:44,119 INFO L226 Difference]: Without dead ends: 146 [2020-10-21 23:10:44,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:10:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-10-21 23:10:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2020-10-21 23:10:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-21 23:10:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 263 transitions. [2020-10-21 23:10:44,161 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 263 transitions. Word has length 5 [2020-10-21 23:10:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:44,161 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 263 transitions. [2020-10-21 23:10:44,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:10:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 263 transitions. [2020-10-21 23:10:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 23:10:44,162 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:44,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 23:10:44,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:10:44,163 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:44,164 INFO L82 PathProgramCache]: Analyzing trace with hash 654434302, now seen corresponding path program 1 times [2020-10-21 23:10:44,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:44,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291160765] [2020-10-21 23:10:44,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:44,309 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:10:44,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291160765] [2020-10-21 23:10:44,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:44,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:10:44,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063480480] [2020-10-21 23:10:44,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:10:44,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:44,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:10:44,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:10:44,313 INFO L87 Difference]: Start difference. First operand 130 states and 263 transitions. Second operand 3 states. [2020-10-21 23:10:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:44,405 INFO L93 Difference]: Finished difference Result 160 states and 315 transitions. [2020-10-21 23:10:44,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:10:44,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 23:10:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:44,409 INFO L225 Difference]: With dead ends: 160 [2020-10-21 23:10:44,410 INFO L226 Difference]: Without dead ends: 153 [2020-10-21 23:10:44,410 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:10:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-21 23:10:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2020-10-21 23:10:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-10-21 23:10:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 297 transitions. [2020-10-21 23:10:44,438 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 297 transitions. Word has length 5 [2020-10-21 23:10:44,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:44,439 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 297 transitions. [2020-10-21 23:10:44,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:10:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 297 transitions. [2020-10-21 23:10:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:10:44,444 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:44,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:44,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:10:44,445 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:44,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1212118520, now seen corresponding path program 1 times [2020-10-21 23:10:44,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:44,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551684770] [2020-10-21 23:10:44,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:44,534 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:10:44,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551684770] [2020-10-21 23:10:44,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:44,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:10:44,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235078199] [2020-10-21 23:10:44,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:10:44,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:44,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:10:44,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:10:44,537 INFO L87 Difference]: Start difference. First operand 145 states and 297 transitions. Second operand 3 states. [2020-10-21 23:10:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:44,553 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2020-10-21 23:10:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:10:44,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-21 23:10:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:44,556 INFO L225 Difference]: With dead ends: 57 [2020-10-21 23:10:44,556 INFO L226 Difference]: Without dead ends: 57 [2020-10-21 23:10:44,556 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:10:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-21 23:10:44,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-21 23:10:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-21 23:10:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 101 transitions. [2020-10-21 23:10:44,567 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 101 transitions. Word has length 10 [2020-10-21 23:10:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:44,567 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 101 transitions. [2020-10-21 23:10:44,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:10:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 101 transitions. [2020-10-21 23:10:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:44,568 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:44,568 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:10:44,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:10:44,569 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:44,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:44,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1197590593, now seen corresponding path program 1 times [2020-10-21 23:10:44,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:44,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616996257] [2020-10-21 23:10:44,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:44,992 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:10:44,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616996257] [2020-10-21 23:10:44,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:44,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:10:44,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920247714] [2020-10-21 23:10:44,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:10:44,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:10:44,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:10:44,995 INFO L87 Difference]: Start difference. First operand 57 states and 101 transitions. Second operand 7 states. [2020-10-21 23:10:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:45,353 INFO L93 Difference]: Finished difference Result 98 states and 161 transitions. [2020-10-21 23:10:45,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:45,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-21 23:10:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:45,355 INFO L225 Difference]: With dead ends: 98 [2020-10-21 23:10:45,355 INFO L226 Difference]: Without dead ends: 98 [2020-10-21 23:10:45,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:10:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-21 23:10:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 74. [2020-10-21 23:10:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-21 23:10:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 124 transitions. [2020-10-21 23:10:45,365 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 124 transitions. Word has length 16 [2020-10-21 23:10:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:45,368 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 124 transitions. [2020-10-21 23:10:45,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:10:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 124 transitions. [2020-10-21 23:10:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:45,370 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:45,370 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:10:45,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:10:45,370 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:45,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:45,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1197590631, now seen corresponding path program 1 times [2020-10-21 23:10:45,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:45,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439933842] [2020-10-21 23:10:45,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:45,974 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:10:45,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439933842] [2020-10-21 23:10:45,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:45,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:45,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885899172] [2020-10-21 23:10:45,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:45,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:45,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:45,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:45,977 INFO L87 Difference]: Start difference. First operand 74 states and 124 transitions. Second operand 10 states. [2020-10-21 23:10:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:46,394 INFO L93 Difference]: Finished difference Result 88 states and 141 transitions. [2020-10-21 23:10:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:46,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:46,396 INFO L225 Difference]: With dead ends: 88 [2020-10-21 23:10:46,396 INFO L226 Difference]: Without dead ends: 77 [2020-10-21 23:10:46,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-21 23:10:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2020-10-21 23:10:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-21 23:10:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2020-10-21 23:10:46,401 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 16 [2020-10-21 23:10:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:46,401 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2020-10-21 23:10:46,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2020-10-21 23:10:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:46,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:46,403 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:10:46,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:10:46,403 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:46,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1365975115, now seen corresponding path program 2 times [2020-10-21 23:10:46,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:46,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807947503] [2020-10-21 23:10:46,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:46,968 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:10:46,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807947503] [2020-10-21 23:10:46,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:46,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:46,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994913863] [2020-10-21 23:10:46,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:46,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:46,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:46,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:46,970 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 10 states. [2020-10-21 23:10:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:47,366 INFO L93 Difference]: Finished difference Result 77 states and 127 transitions. [2020-10-21 23:10:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:10:47,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:47,367 INFO L225 Difference]: With dead ends: 77 [2020-10-21 23:10:47,367 INFO L226 Difference]: Without dead ends: 62 [2020-10-21 23:10:47,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-21 23:10:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2020-10-21 23:10:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-21 23:10:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2020-10-21 23:10:47,372 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 16 [2020-10-21 23:10:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:47,372 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2020-10-21 23:10:47,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2020-10-21 23:10:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:47,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:47,373 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:10:47,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:10:47,374 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:47,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:47,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1825504767, now seen corresponding path program 2 times [2020-10-21 23:10:47,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:47,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605797171] [2020-10-21 23:10:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:47,608 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:10:47,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605797171] [2020-10-21 23:10:47,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:47,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:10:47,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129374133] [2020-10-21 23:10:47,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:10:47,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:47,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:10:47,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:10:47,612 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand 7 states. [2020-10-21 23:10:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:47,902 INFO L93 Difference]: Finished difference Result 86 states and 145 transitions. [2020-10-21 23:10:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:10:47,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-21 23:10:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:47,904 INFO L225 Difference]: With dead ends: 86 [2020-10-21 23:10:47,904 INFO L226 Difference]: Without dead ends: 86 [2020-10-21 23:10:47,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:10:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-21 23:10:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2020-10-21 23:10:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-21 23:10:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 116 transitions. [2020-10-21 23:10:47,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 116 transitions. Word has length 16 [2020-10-21 23:10:47,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:47,914 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 116 transitions. [2020-10-21 23:10:47,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:10:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 116 transitions. [2020-10-21 23:10:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:47,916 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:47,916 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:10:47,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:10:47,916 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:47,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:47,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1825504729, now seen corresponding path program 3 times [2020-10-21 23:10:47,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:47,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421759802] [2020-10-21 23:10:47,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:48,432 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:10:48,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421759802] [2020-10-21 23:10:48,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:48,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:48,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765870642] [2020-10-21 23:10:48,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:48,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:48,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:48,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:48,434 INFO L87 Difference]: Start difference. First operand 70 states and 116 transitions. Second operand 10 states. [2020-10-21 23:10:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:48,858 INFO L93 Difference]: Finished difference Result 91 states and 146 transitions. [2020-10-21 23:10:48,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:48,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:48,860 INFO L225 Difference]: With dead ends: 91 [2020-10-21 23:10:48,860 INFO L226 Difference]: Without dead ends: 70 [2020-10-21 23:10:48,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:48,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-21 23:10:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2020-10-21 23:10:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-21 23:10:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 108 transitions. [2020-10-21 23:10:48,864 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 108 transitions. Word has length 16 [2020-10-21 23:10:48,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:48,865 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 108 transitions. [2020-10-21 23:10:48,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:48,865 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 108 transitions. [2020-10-21 23:10:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:48,866 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:48,866 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:10:48,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:10:48,866 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:48,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:48,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1400756409, now seen corresponding path program 3 times [2020-10-21 23:10:48,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:48,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47311258] [2020-10-21 23:10:48,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:49,161 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:10:49,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47311258] [2020-10-21 23:10:49,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:49,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:10:49,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439342422] [2020-10-21 23:10:49,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:10:49,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:49,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:10:49,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:10:49,164 INFO L87 Difference]: Start difference. First operand 66 states and 108 transitions. Second operand 9 states. [2020-10-21 23:10:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:49,661 INFO L93 Difference]: Finished difference Result 118 states and 181 transitions. [2020-10-21 23:10:49,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-21 23:10:49,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-21 23:10:49,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:49,662 INFO L225 Difference]: With dead ends: 118 [2020-10-21 23:10:49,663 INFO L226 Difference]: Without dead ends: 118 [2020-10-21 23:10:49,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2020-10-21 23:10:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-21 23:10:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 77. [2020-10-21 23:10:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-21 23:10:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 128 transitions. [2020-10-21 23:10:49,666 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 128 transitions. Word has length 16 [2020-10-21 23:10:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:49,667 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 128 transitions. [2020-10-21 23:10:49,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:10:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 128 transitions. [2020-10-21 23:10:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:49,668 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:49,668 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:10:49,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:10:49,668 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:49,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:49,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1400756371, now seen corresponding path program 4 times [2020-10-21 23:10:49,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:49,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198664774] [2020-10-21 23:10:49,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:50,113 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:10:50,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198664774] [2020-10-21 23:10:50,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:50,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:50,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380085415] [2020-10-21 23:10:50,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:50,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:50,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:50,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:50,115 INFO L87 Difference]: Start difference. First operand 77 states and 128 transitions. Second operand 10 states. [2020-10-21 23:10:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:50,458 INFO L93 Difference]: Finished difference Result 110 states and 181 transitions. [2020-10-21 23:10:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:50,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:50,459 INFO L225 Difference]: With dead ends: 110 [2020-10-21 23:10:50,459 INFO L226 Difference]: Without dead ends: 99 [2020-10-21 23:10:50,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-21 23:10:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2020-10-21 23:10:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-21 23:10:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 136 transitions. [2020-10-21 23:10:50,463 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 136 transitions. Word has length 16 [2020-10-21 23:10:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:50,464 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 136 transitions. [2020-10-21 23:10:50,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 136 transitions. [2020-10-21 23:10:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:50,465 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:50,465 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:10:50,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:10:50,465 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:50,466 INFO L82 PathProgramCache]: Analyzing trace with hash 330645179, now seen corresponding path program 5 times [2020-10-21 23:10:50,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:50,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456190515] [2020-10-21 23:10:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:50,957 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:10:50,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456190515] [2020-10-21 23:10:50,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:50,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:50,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65118169] [2020-10-21 23:10:50,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:50,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:50,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:50,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:50,960 INFO L87 Difference]: Start difference. First operand 81 states and 136 transitions. Second operand 10 states. [2020-10-21 23:10:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:51,353 INFO L93 Difference]: Finished difference Result 116 states and 191 transitions. [2020-10-21 23:10:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:10:51,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:51,354 INFO L225 Difference]: With dead ends: 116 [2020-10-21 23:10:51,355 INFO L226 Difference]: Without dead ends: 101 [2020-10-21 23:10:51,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:51,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-21 23:10:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2020-10-21 23:10:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-21 23:10:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 132 transitions. [2020-10-21 23:10:51,359 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 132 transitions. Word has length 16 [2020-10-21 23:10:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:51,359 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 132 transitions. [2020-10-21 23:10:51,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:51,359 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 132 transitions. [2020-10-21 23:10:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:51,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:51,360 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:10:51,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:10:51,361 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:51,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1002549257, now seen corresponding path program 6 times [2020-10-21 23:10:51,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:51,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550656211] [2020-10-21 23:10:51,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:51,750 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:10:51,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550656211] [2020-10-21 23:10:51,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:51,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:51,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460222203] [2020-10-21 23:10:51,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:51,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:51,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:51,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:51,752 INFO L87 Difference]: Start difference. First operand 79 states and 132 transitions. Second operand 10 states. [2020-10-21 23:10:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:52,080 INFO L93 Difference]: Finished difference Result 104 states and 167 transitions. [2020-10-21 23:10:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:52,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:52,081 INFO L225 Difference]: With dead ends: 104 [2020-10-21 23:10:52,082 INFO L226 Difference]: Without dead ends: 93 [2020-10-21 23:10:52,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-21 23:10:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2020-10-21 23:10:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-21 23:10:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 134 transitions. [2020-10-21 23:10:52,086 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 134 transitions. Word has length 16 [2020-10-21 23:10:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:52,086 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 134 transitions. [2020-10-21 23:10:52,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 134 transitions. [2020-10-21 23:10:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:52,087 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:52,087 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:10:52,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:10:52,087 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:52,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash 615893921, now seen corresponding path program 7 times [2020-10-21 23:10:52,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:52,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130956926] [2020-10-21 23:10:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:52,538 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:10:52,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130956926] [2020-10-21 23:10:52,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:52,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:52,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012716902] [2020-10-21 23:10:52,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:52,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:52,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:52,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:52,541 INFO L87 Difference]: Start difference. First operand 81 states and 134 transitions. Second operand 10 states. [2020-10-21 23:10:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:52,949 INFO L93 Difference]: Finished difference Result 110 states and 177 transitions. [2020-10-21 23:10:52,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:10:52,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:52,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:52,951 INFO L225 Difference]: With dead ends: 110 [2020-10-21 23:10:52,951 INFO L226 Difference]: Without dead ends: 95 [2020-10-21 23:10:52,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:52,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-21 23:10:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2020-10-21 23:10:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-21 23:10:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 130 transitions. [2020-10-21 23:10:52,955 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 130 transitions. Word has length 16 [2020-10-21 23:10:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:52,955 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 130 transitions. [2020-10-21 23:10:52,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 130 transitions. [2020-10-21 23:10:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:52,956 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:52,956 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:10:52,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:10:52,956 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:52,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:52,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1037223855, now seen corresponding path program 8 times [2020-10-21 23:10:52,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:52,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709455118] [2020-10-21 23:10:52,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:53,445 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:10:53,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709455118] [2020-10-21 23:10:53,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:53,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:53,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373623250] [2020-10-21 23:10:53,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:53,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:53,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:53,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:53,448 INFO L87 Difference]: Start difference. First operand 79 states and 130 transitions. Second operand 10 states. [2020-10-21 23:10:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:54,060 INFO L93 Difference]: Finished difference Result 99 states and 159 transitions. [2020-10-21 23:10:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:54,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:54,062 INFO L225 Difference]: With dead ends: 99 [2020-10-21 23:10:54,062 INFO L226 Difference]: Without dead ends: 86 [2020-10-21 23:10:54,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-21 23:10:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2020-10-21 23:10:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-21 23:10:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 131 transitions. [2020-10-21 23:10:54,071 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 131 transitions. Word has length 16 [2020-10-21 23:10:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:54,073 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 131 transitions. [2020-10-21 23:10:54,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 131 transitions. [2020-10-21 23:10:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:54,074 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:54,075 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:10:54,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:10:54,075 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:54,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1150182227, now seen corresponding path program 9 times [2020-10-21 23:10:54,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:54,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515521027] [2020-10-21 23:10:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:54,604 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:10:54,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515521027] [2020-10-21 23:10:54,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:54,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:54,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480466468] [2020-10-21 23:10:54,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:54,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:54,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:54,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:54,606 INFO L87 Difference]: Start difference. First operand 80 states and 131 transitions. Second operand 10 states. [2020-10-21 23:10:55,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:55,037 INFO L93 Difference]: Finished difference Result 95 states and 151 transitions. [2020-10-21 23:10:55,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:55,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:55,039 INFO L225 Difference]: With dead ends: 95 [2020-10-21 23:10:55,039 INFO L226 Difference]: Without dead ends: 79 [2020-10-21 23:10:55,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-21 23:10:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2020-10-21 23:10:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-21 23:10:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 126 transitions. [2020-10-21 23:10:55,045 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 126 transitions. Word has length 16 [2020-10-21 23:10:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:55,045 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 126 transitions. [2020-10-21 23:10:55,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 126 transitions. [2020-10-21 23:10:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:55,046 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:55,046 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:10:55,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:10:55,047 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash -123632883, now seen corresponding path program 10 times [2020-10-21 23:10:55,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:55,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035912616] [2020-10-21 23:10:55,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:55,478 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:10:55,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035912616] [2020-10-21 23:10:55,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:55,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:55,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350928565] [2020-10-21 23:10:55,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:55,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:55,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:55,480 INFO L87 Difference]: Start difference. First operand 77 states and 126 transitions. Second operand 10 states. [2020-10-21 23:10:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:55,901 INFO L93 Difference]: Finished difference Result 99 states and 158 transitions. [2020-10-21 23:10:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:55,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:55,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:55,903 INFO L225 Difference]: With dead ends: 99 [2020-10-21 23:10:55,903 INFO L226 Difference]: Without dead ends: 82 [2020-10-21 23:10:55,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-21 23:10:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2020-10-21 23:10:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-21 23:10:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 125 transitions. [2020-10-21 23:10:55,907 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 125 transitions. Word has length 16 [2020-10-21 23:10:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:55,907 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 125 transitions. [2020-10-21 23:10:55,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 125 transitions. [2020-10-21 23:10:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:55,908 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:55,908 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:10:55,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:10:55,908 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1031972303, now seen corresponding path program 11 times [2020-10-21 23:10:55,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:55,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997840787] [2020-10-21 23:10:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:56,365 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:10:56,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997840787] [2020-10-21 23:10:56,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:56,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:56,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232196021] [2020-10-21 23:10:56,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:56,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:56,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:56,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:56,368 INFO L87 Difference]: Start difference. First operand 77 states and 125 transitions. Second operand 10 states. [2020-10-21 23:10:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:56,744 INFO L93 Difference]: Finished difference Result 96 states and 152 transitions. [2020-10-21 23:10:56,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:56,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:56,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:56,746 INFO L225 Difference]: With dead ends: 96 [2020-10-21 23:10:56,746 INFO L226 Difference]: Without dead ends: 83 [2020-10-21 23:10:56,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-21 23:10:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2020-10-21 23:10:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-21 23:10:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 126 transitions. [2020-10-21 23:10:56,750 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 126 transitions. Word has length 16 [2020-10-21 23:10:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:56,751 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 126 transitions. [2020-10-21 23:10:56,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 126 transitions. [2020-10-21 23:10:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:56,751 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:56,752 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:10:56,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:10:56,752 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:56,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1144930675, now seen corresponding path program 12 times [2020-10-21 23:10:56,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:56,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635719424] [2020-10-21 23:10:56,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:57,181 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:10:57,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635719424] [2020-10-21 23:10:57,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:57,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:57,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146608746] [2020-10-21 23:10:57,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:57,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:57,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:57,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:57,184 INFO L87 Difference]: Start difference. First operand 78 states and 126 transitions. Second operand 10 states. [2020-10-21 23:10:57,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:57,616 INFO L93 Difference]: Finished difference Result 96 states and 151 transitions. [2020-10-21 23:10:57,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:57,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:57,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:57,618 INFO L225 Difference]: With dead ends: 96 [2020-10-21 23:10:57,618 INFO L226 Difference]: Without dead ends: 77 [2020-10-21 23:10:57,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-21 23:10:57,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2020-10-21 23:10:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-21 23:10:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions. [2020-10-21 23:10:57,621 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 116 transitions. Word has length 16 [2020-10-21 23:10:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:57,621 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 116 transitions. [2020-10-21 23:10:57,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 116 transitions. [2020-10-21 23:10:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:57,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:57,622 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:10:57,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 23:10:57,622 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:57,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:57,623 INFO L82 PathProgramCache]: Analyzing trace with hash 23037531, now seen corresponding path program 13 times [2020-10-21 23:10:57,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:57,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181397602] [2020-10-21 23:10:57,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:57,981 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:10:57,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181397602] [2020-10-21 23:10:57,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:57,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:57,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225734903] [2020-10-21 23:10:57,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:57,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:57,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:57,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:57,983 INFO L87 Difference]: Start difference. First operand 72 states and 116 transitions. Second operand 10 states. [2020-10-21 23:10:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:58,327 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2020-10-21 23:10:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:58,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:58,328 INFO L225 Difference]: With dead ends: 95 [2020-10-21 23:10:58,328 INFO L226 Difference]: Without dead ends: 84 [2020-10-21 23:10:58,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:10:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-21 23:10:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2020-10-21 23:10:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-21 23:10:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 118 transitions. [2020-10-21 23:10:58,331 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 118 transitions. Word has length 16 [2020-10-21 23:10:58,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:58,332 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 118 transitions. [2020-10-21 23:10:58,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:58,332 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 118 transitions. [2020-10-21 23:10:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:58,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:58,332 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:10:58,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-21 23:10:58,333 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:58,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:58,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1641480709, now seen corresponding path program 14 times [2020-10-21 23:10:58,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:58,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936037339] [2020-10-21 23:10:58,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:58,721 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:10:58,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936037339] [2020-10-21 23:10:58,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:58,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:58,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199262690] [2020-10-21 23:10:58,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:58,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:58,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:58,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:58,723 INFO L87 Difference]: Start difference. First operand 74 states and 118 transitions. Second operand 10 states. [2020-10-21 23:10:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:59,097 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-10-21 23:10:59,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:10:59,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:10:59,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:59,098 INFO L225 Difference]: With dead ends: 97 [2020-10-21 23:10:59,098 INFO L226 Difference]: Without dead ends: 82 [2020-10-21 23:10:59,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:10:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-21 23:10:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2020-10-21 23:10:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-21 23:10:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 114 transitions. [2020-10-21 23:10:59,102 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 114 transitions. Word has length 16 [2020-10-21 23:10:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:59,102 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 114 transitions. [2020-10-21 23:10:59,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:10:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 114 transitions. [2020-10-21 23:10:59,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:59,103 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:59,103 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:10:59,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-21 23:10:59,104 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:59,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1892099271, now seen corresponding path program 1 times [2020-10-21 23:10:59,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:59,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146598296] [2020-10-21 23:10:59,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:59,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:10:59,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146598296] [2020-10-21 23:10:59,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:59,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:10:59,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924761375] [2020-10-21 23:10:59,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:10:59,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:59,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:10:59,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:10:59,208 INFO L87 Difference]: Start difference. First operand 72 states and 114 transitions. Second operand 8 states. [2020-10-21 23:10:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:59,494 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2020-10-21 23:10:59,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:59,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-21 23:10:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:59,495 INFO L225 Difference]: With dead ends: 63 [2020-10-21 23:10:59,496 INFO L226 Difference]: Without dead ends: 63 [2020-10-21 23:10:59,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:10:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-21 23:10:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2020-10-21 23:10:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-21 23:10:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2020-10-21 23:10:59,500 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 16 [2020-10-21 23:10:59,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:59,500 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2020-10-21 23:10:59,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:10:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2020-10-21 23:10:59,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:10:59,501 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:59,501 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:10:59,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-21 23:10:59,501 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:10:59,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:59,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1908784089, now seen corresponding path program 15 times [2020-10-21 23:10:59,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:59,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632706431] [2020-10-21 23:10:59,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:59,841 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:10:59,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632706431] [2020-10-21 23:10:59,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:59,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:59,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568554880] [2020-10-21 23:10:59,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:10:59,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:59,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:10:59,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:10:59,843 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 10 states. [2020-10-21 23:11:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:00,207 INFO L93 Difference]: Finished difference Result 68 states and 97 transitions. [2020-10-21 23:11:00,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:00,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:00,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:00,212 INFO L225 Difference]: With dead ends: 68 [2020-10-21 23:11:00,212 INFO L226 Difference]: Without dead ends: 58 [2020-10-21 23:11:00,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-21 23:11:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-10-21 23:11:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-21 23:11:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2020-10-21 23:11:00,214 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 16 [2020-10-21 23:11:00,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:00,215 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2020-10-21 23:11:00,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2020-10-21 23:11:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:00,215 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:00,216 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:11:00,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-21 23:11:00,216 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:00,216 INFO L82 PathProgramCache]: Analyzing trace with hash -899896281, now seen corresponding path program 16 times [2020-10-21 23:11:00,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:00,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160100832] [2020-10-21 23:11:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:00,577 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:11:00,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160100832] [2020-10-21 23:11:00,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:00,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:00,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200692469] [2020-10-21 23:11:00,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:00,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:00,580 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand 10 states. [2020-10-21 23:11:00,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:00,982 INFO L93 Difference]: Finished difference Result 79 states and 113 transitions. [2020-10-21 23:11:00,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:00,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:00,984 INFO L225 Difference]: With dead ends: 79 [2020-10-21 23:11:00,985 INFO L226 Difference]: Without dead ends: 68 [2020-10-21 23:11:00,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-21 23:11:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2020-10-21 23:11:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-21 23:11:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2020-10-21 23:11:00,989 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 16 [2020-10-21 23:11:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:00,989 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2020-10-21 23:11:00,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:00,990 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2020-10-21 23:11:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:00,991 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:00,991 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:11:00,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-21 23:11:00,991 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:00,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:00,992 INFO L82 PathProgramCache]: Analyzing trace with hash 831505269, now seen corresponding path program 17 times [2020-10-21 23:11:00,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:00,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988001187] [2020-10-21 23:11:00,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:01,456 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:11:01,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988001187] [2020-10-21 23:11:01,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:01,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:01,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151110465] [2020-10-21 23:11:01,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:01,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:01,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:01,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:01,458 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand 10 states. [2020-10-21 23:11:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:01,894 INFO L93 Difference]: Finished difference Result 79 states and 112 transitions. [2020-10-21 23:11:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:11:01,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:01,895 INFO L225 Difference]: With dead ends: 79 [2020-10-21 23:11:01,895 INFO L226 Difference]: Without dead ends: 64 [2020-10-21 23:11:01,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-21 23:11:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2020-10-21 23:11:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-21 23:11:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2020-10-21 23:11:01,899 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 16 [2020-10-21 23:11:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:01,899 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2020-10-21 23:11:01,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2020-10-21 23:11:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:01,900 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:01,900 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:11:01,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-21 23:11:01,900 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:01,900 INFO L82 PathProgramCache]: Analyzing trace with hash -501689167, now seen corresponding path program 18 times [2020-10-21 23:11:01,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:01,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230297292] [2020-10-21 23:11:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:02,288 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:11:02,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230297292] [2020-10-21 23:11:02,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:02,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:02,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977181831] [2020-10-21 23:11:02,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:02,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:02,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:02,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:02,291 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand 10 states. [2020-10-21 23:11:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:02,681 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2020-10-21 23:11:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:02,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:02,682 INFO L225 Difference]: With dead ends: 70 [2020-10-21 23:11:02,683 INFO L226 Difference]: Without dead ends: 59 [2020-10-21 23:11:02,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-21 23:11:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2020-10-21 23:11:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-21 23:11:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2020-10-21 23:11:02,685 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 16 [2020-10-21 23:11:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:02,685 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2020-10-21 23:11:02,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2020-10-21 23:11:02,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:02,687 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:02,688 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:11:02,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-21 23:11:02,688 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:02,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1116754011, now seen corresponding path program 19 times [2020-10-21 23:11:02,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:02,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677413625] [2020-10-21 23:11:02,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:03,047 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:11:03,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677413625] [2020-10-21 23:11:03,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:03,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:03,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718487938] [2020-10-21 23:11:03,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:03,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:03,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:03,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:03,049 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 10 states. [2020-10-21 23:11:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:03,420 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2020-10-21 23:11:03,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:11:03,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:03,421 INFO L225 Difference]: With dead ends: 66 [2020-10-21 23:11:03,421 INFO L226 Difference]: Without dead ends: 57 [2020-10-21 23:11:03,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-21 23:11:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2020-10-21 23:11:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-21 23:11:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2020-10-21 23:11:03,424 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 16 [2020-10-21 23:11:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:03,425 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2020-10-21 23:11:03,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2020-10-21 23:11:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:03,425 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:03,426 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:11:03,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-21 23:11:03,426 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:03,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:03,426 INFO L82 PathProgramCache]: Analyzing trace with hash -536363765, now seen corresponding path program 20 times [2020-10-21 23:11:03,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:03,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807275477] [2020-10-21 23:11:03,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:03,850 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:11:03,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807275477] [2020-10-21 23:11:03,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:03,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:03,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580530029] [2020-10-21 23:11:03,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:03,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:03,853 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand 10 states. [2020-10-21 23:11:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:04,266 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2020-10-21 23:11:04,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:04,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:04,267 INFO L225 Difference]: With dead ends: 59 [2020-10-21 23:11:04,267 INFO L226 Difference]: Without dead ends: 49 [2020-10-21 23:11:04,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-21 23:11:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-10-21 23:11:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-21 23:11:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2020-10-21 23:11:04,270 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 16 [2020-10-21 23:11:04,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:04,270 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2020-10-21 23:11:04,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2020-10-21 23:11:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:04,271 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:04,271 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:11:04,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-21 23:11:04,271 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:04,272 INFO L82 PathProgramCache]: Analyzing trace with hash -649322137, now seen corresponding path program 21 times [2020-10-21 23:11:04,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:04,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359843351] [2020-10-21 23:11:04,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:04,623 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:11:04,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359843351] [2020-10-21 23:11:04,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:04,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:04,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765673452] [2020-10-21 23:11:04,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:04,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:04,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:04,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:04,626 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand 10 states. [2020-10-21 23:11:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:05,021 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2020-10-21 23:11:05,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:05,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:05,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:05,023 INFO L225 Difference]: With dead ends: 55 [2020-10-21 23:11:05,023 INFO L226 Difference]: Without dead ends: 45 [2020-10-21 23:11:05,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-21 23:11:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2020-10-21 23:11:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-21 23:11:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2020-10-21 23:11:05,026 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 16 [2020-10-21 23:11:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:05,026 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2020-10-21 23:11:05,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2020-10-21 23:11:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:05,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:05,027 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:11:05,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-21 23:11:05,027 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:05,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:05,028 INFO L82 PathProgramCache]: Analyzing trace with hash -822569829, now seen corresponding path program 22 times [2020-10-21 23:11:05,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:05,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681419568] [2020-10-21 23:11:05,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:05,486 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:11:05,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681419568] [2020-10-21 23:11:05,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:05,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:05,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291139881] [2020-10-21 23:11:05,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:05,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:05,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:05,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:05,489 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2020-10-21 23:11:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:06,024 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2020-10-21 23:11:06,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:06,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:06,026 INFO L225 Difference]: With dead ends: 51 [2020-10-21 23:11:06,026 INFO L226 Difference]: Without dead ends: 43 [2020-10-21 23:11:06,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-21 23:11:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-21 23:11:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-21 23:11:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-10-21 23:11:06,030 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2020-10-21 23:11:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:06,030 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-21 23:11:06,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2020-10-21 23:11:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:06,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:06,031 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:11:06,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-21 23:11:06,032 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:06,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:06,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1074577193, now seen corresponding path program 23 times [2020-10-21 23:11:06,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:06,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308243439] [2020-10-21 23:11:06,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:06,543 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:11:06,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308243439] [2020-10-21 23:11:06,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:06,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:06,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549635619] [2020-10-21 23:11:06,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:06,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:06,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:06,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:06,545 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 10 states. [2020-10-21 23:11:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:07,025 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2020-10-21 23:11:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:07,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:07,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:07,027 INFO L225 Difference]: With dead ends: 53 [2020-10-21 23:11:07,027 INFO L226 Difference]: Without dead ends: 43 [2020-10-21 23:11:07,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-21 23:11:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-21 23:11:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-21 23:11:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2020-10-21 23:11:07,030 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 16 [2020-10-21 23:11:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:07,030 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-10-21 23:11:07,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2020-10-21 23:11:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:07,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:07,031 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:11:07,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-21 23:11:07,031 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:07,032 INFO L82 PathProgramCache]: Analyzing trace with hash 961618821, now seen corresponding path program 24 times [2020-10-21 23:11:07,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:07,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262531925] [2020-10-21 23:11:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:07,369 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:11:07,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262531925] [2020-10-21 23:11:07,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:07,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:07,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889820751] [2020-10-21 23:11:07,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:07,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:07,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:07,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:07,371 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand 10 states. [2020-10-21 23:11:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:07,774 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2020-10-21 23:11:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:07,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:07,775 INFO L225 Difference]: With dead ends: 49 [2020-10-21 23:11:07,776 INFO L226 Difference]: Without dead ends: 38 [2020-10-21 23:11:07,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-21 23:11:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-10-21 23:11:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-21 23:11:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2020-10-21 23:11:07,778 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 16 [2020-10-21 23:11:07,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:07,778 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2020-10-21 23:11:07,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2020-10-21 23:11:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:07,779 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:07,779 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:11:07,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-21 23:11:07,779 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:07,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:07,779 INFO L82 PathProgramCache]: Analyzing trace with hash 540025319, now seen corresponding path program 25 times [2020-10-21 23:11:07,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:07,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271536442] [2020-10-21 23:11:07,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:08,180 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:11:08,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271536442] [2020-10-21 23:11:08,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:08,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:08,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349324811] [2020-10-21 23:11:08,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:08,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:08,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:08,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:08,182 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand 10 states. [2020-10-21 23:11:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:08,548 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-10-21 23:11:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:08,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:08,550 INFO L225 Difference]: With dead ends: 38 [2020-10-21 23:11:08,550 INFO L226 Difference]: Without dead ends: 24 [2020-10-21 23:11:08,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-21 23:11:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-21 23:11:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-21 23:11:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-10-21 23:11:08,553 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2020-10-21 23:11:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:08,553 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-10-21 23:11:08,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-10-21 23:11:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:08,554 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:08,554 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:11:08,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-21 23:11:08,554 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:08,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:08,554 INFO L82 PathProgramCache]: Analyzing trace with hash -368314139, now seen corresponding path program 4 times [2020-10-21 23:11:08,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:08,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291412840] [2020-10-21 23:11:08,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:08,841 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:11:08,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291412840] [2020-10-21 23:11:08,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:08,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:11:08,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087386105] [2020-10-21 23:11:08,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:11:08,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:08,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:11:08,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:11:08,844 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 9 states. [2020-10-21 23:11:09,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:09,126 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-10-21 23:11:09,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:09,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-21 23:11:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:09,126 INFO L225 Difference]: With dead ends: 23 [2020-10-21 23:11:09,127 INFO L226 Difference]: Without dead ends: 23 [2020-10-21 23:11:09,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-10-21 23:11:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-10-21 23:11:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-21 23:11:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-10-21 23:11:09,130 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2020-10-21 23:11:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:09,131 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-10-21 23:11:09,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:11:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-10-21 23:11:09,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:09,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:09,131 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:11:09,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-21 23:11:09,132 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:09,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:09,132 INFO L82 PathProgramCache]: Analyzing trace with hash -368314101, now seen corresponding path program 26 times [2020-10-21 23:11:09,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:09,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854717951] [2020-10-21 23:11:09,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:09,538 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:11:09,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854717951] [2020-10-21 23:11:09,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:09,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:09,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499746132] [2020-10-21 23:11:09,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:09,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:09,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:09,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:09,540 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 10 states. [2020-10-21 23:11:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:09,853 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-10-21 23:11:09,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:09,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:09,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:09,855 INFO L225 Difference]: With dead ends: 35 [2020-10-21 23:11:09,855 INFO L226 Difference]: Without dead ends: 25 [2020-10-21 23:11:09,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-21 23:11:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-10-21 23:11:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-21 23:11:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-10-21 23:11:09,857 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2020-10-21 23:11:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:09,857 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-10-21 23:11:09,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-10-21 23:11:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:09,858 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:09,858 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:11:09,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-21 23:11:09,858 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash -481272473, now seen corresponding path program 27 times [2020-10-21 23:11:09,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:09,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075647057] [2020-10-21 23:11:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:10,202 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:11:10,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075647057] [2020-10-21 23:11:10,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:10,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:10,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72993445] [2020-10-21 23:11:10,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:10,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:10,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:10,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:10,204 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 10 states. [2020-10-21 23:11:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:10,537 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-10-21 23:11:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:10,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:10,538 INFO L225 Difference]: With dead ends: 31 [2020-10-21 23:11:10,538 INFO L226 Difference]: Without dead ends: 22 [2020-10-21 23:11:10,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-10-21 23:11:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-21 23:11:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-21 23:11:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-10-21 23:11:10,540 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2020-10-21 23:11:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:10,540 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-10-21 23:11:10,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-10-21 23:11:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:10,540 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:10,541 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:11:10,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-21 23:11:10,541 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:10,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:10,541 INFO L82 PathProgramCache]: Analyzing trace with hash -659771717, now seen corresponding path program 28 times [2020-10-21 23:11:10,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:10,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275369010] [2020-10-21 23:11:10,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:11,011 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:11:11,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275369010] [2020-10-21 23:11:11,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:11,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:11,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235737320] [2020-10-21 23:11:11,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:11,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:11,018 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 10 states. [2020-10-21 23:11:11,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:11,402 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-10-21 23:11:11,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:11,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:11,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:11,403 INFO L225 Difference]: With dead ends: 29 [2020-10-21 23:11:11,403 INFO L226 Difference]: Without dead ends: 21 [2020-10-21 23:11:11,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-10-21 23:11:11,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-21 23:11:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-21 23:11:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-10-21 23:11:11,405 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2020-10-21 23:11:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:11,407 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-10-21 23:11:11,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-10-21 23:11:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:11,408 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:11,408 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:11:11,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-21 23:11:11,408 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:11,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:11,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1237375305, now seen corresponding path program 29 times [2020-10-21 23:11:11,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:11,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044754870] [2020-10-21 23:11:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:11,755 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:11:11,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044754870] [2020-10-21 23:11:11,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:11,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:11,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905817347] [2020-10-21 23:11:11,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:11,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:11,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:11,757 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 10 states. [2020-10-21 23:11:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:12,063 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-10-21 23:11:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:12,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:12,064 INFO L225 Difference]: With dead ends: 27 [2020-10-21 23:11:12,065 INFO L226 Difference]: Without dead ends: 17 [2020-10-21 23:11:12,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-10-21 23:11:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-10-21 23:11:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-21 23:11:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2020-10-21 23:11:12,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 16 [2020-10-21 23:11:12,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:12,067 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2020-10-21 23:11:12,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:12,067 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2020-10-21 23:11:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:11:12,067 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:12,067 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:11:12,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-21 23:11:12,068 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:11:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:12,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1124416933, now seen corresponding path program 30 times [2020-10-21 23:11:12,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:12,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867730196] [2020-10-21 23:11:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:12,469 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:11:12,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867730196] [2020-10-21 23:11:12,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:12,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:11:12,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72483328] [2020-10-21 23:11:12,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:11:12,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:12,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:11:12,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:11:12,470 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand 10 states. [2020-10-21 23:11:12,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:12,864 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-10-21 23:11:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:12,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-21 23:11:12,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:12,865 INFO L225 Difference]: With dead ends: 16 [2020-10-21 23:11:12,865 INFO L226 Difference]: Without dead ends: 0 [2020-10-21 23:11:12,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-21 23:11:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-21 23:11:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-21 23:11:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-21 23:11:12,867 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-10-21 23:11:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:12,867 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-21 23:11:12,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:11:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-21 23:11:12,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-21 23:11:12,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-21 23:11:12,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:11:12 BasicIcfg [2020-10-21 23:11:12,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:11:12,875 INFO L168 Benchmark]: Toolchain (without parser) took 44922.48 ms. Allocated memory was 138.9 MB in the beginning and 525.9 MB in the end (delta: 386.9 MB). Free memory was 98.8 MB in the beginning and 392.7 MB in the end (delta: -293.9 MB). Peak memory consumption was 93.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:11:12,878 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 23:11:12,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1382.97 ms. Allocated memory was 138.9 MB in the beginning and 235.9 MB in the end (delta: 97.0 MB). Free memory was 98.0 MB in the beginning and 172.9 MB in the end (delta: -74.9 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:11:12,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.82 ms. Allocated memory is still 235.9 MB. Free memory was 172.9 MB in the beginning and 169.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:11:12,879 INFO L168 Benchmark]: Boogie Preprocessor took 60.19 ms. Allocated memory is still 235.9 MB. Free memory was 169.9 MB in the beginning and 167.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:11:12,880 INFO L168 Benchmark]: RCFGBuilder took 831.82 ms. Allocated memory is still 235.9 MB. Free memory was 167.0 MB in the beginning and 114.2 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:11:12,880 INFO L168 Benchmark]: TraceAbstraction took 42538.53 ms. Allocated memory was 235.9 MB in the beginning and 525.9 MB in the end (delta: 289.9 MB). Free memory was 114.2 MB in the beginning and 392.7 MB in the end (delta: -278.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2020-10-21 23:11:12,883 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.16 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1382.97 ms. Allocated memory was 138.9 MB in the beginning and 235.9 MB in the end (delta: 97.0 MB). Free memory was 98.0 MB in the beginning and 172.9 MB in the end (delta: -74.9 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 98.82 ms. Allocated memory is still 235.9 MB. Free memory was 172.9 MB in the beginning and 169.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.19 ms. Allocated memory is still 235.9 MB. Free memory was 169.9 MB in the beginning and 167.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 831.82 ms. Allocated memory is still 235.9 MB. Free memory was 167.0 MB in the beginning and 114.2 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42538.53 ms. Allocated memory was 235.9 MB in the beginning and 525.9 MB in the end (delta: 289.9 MB). Free memory was 114.2 MB in the beginning and 392.7 MB in the end (delta: -278.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 980 VarBasedMoverChecksPositive, 37 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 19 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.8s, 168 PlacesBefore, 34 PlacesAfterwards, 178 TransitionsBefore, 32 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 8 FixpointIterations, 112 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 22 TrivialYvCompositions, 24 ConcurrentYvCompositions, 12 ChoiceCompositions, 222 TotalNumberOfCompositions, 3600 MoverChecksTotal - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 153 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 42.4s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.8s, HoareTripleCheckerStatistics: 617 SDtfs, 551 SDslu, 1999 SDs, 0 SdLazy, 5154 SolverSat, 580 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 415 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 282 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 581 NumberOfCodeBlocks, 581 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 542 ConstructedInterpolants, 0 QuantifiedInterpolants, 185589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...