/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-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:10:08,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:10:08,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:10:08,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:10:08,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:10:08,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:10:08,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:10:08,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:10:08,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:10:08,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:10:08,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:10:08,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:10:08,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:10:08,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:10:08,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:10:08,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:10:08,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:10:08,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:10:08,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:10:08,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:10:08,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:10:08,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:10:08,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:10:08,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:10:08,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:10:08,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:10:08,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:10:08,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:10:08,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:10:08,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:10:08,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:10:08,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:10:08,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:10:08,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:10:08,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:10:08,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:10:08,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:10:08,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:10:08,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:10:08,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:10:08,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:10:08,317 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:08,337 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:10:08,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:10:08,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:10:08,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:10:08,339 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:10:08,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:10:08,339 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:10:08,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:10:08,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:10:08,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:10:08,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:10:08,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:10:08,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:10:08,341 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:10:08,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:10:08,341 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:10:08,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:10:08,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:10:08,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:10:08,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:10:08,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:10:08,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:10:08,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:10:08,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:10:08,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:10:08,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:10:08,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:10:08,343 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:10:08,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:10:08,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:10:08,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:10:08,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:10:08,657 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:10:08,657 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:10:08,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-10-21 23:10:08,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8b48102/622cb036a1ab4451883e92deac1a3b5e/FLAGba7c4a67b [2020-10-21 23:10:09,308 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:10:09,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-10-21 23:10:09,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8b48102/622cb036a1ab4451883e92deac1a3b5e/FLAGba7c4a67b [2020-10-21 23:10:09,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8b48102/622cb036a1ab4451883e92deac1a3b5e [2020-10-21 23:10:09,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:10:09,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:10:09,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:10:09,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:10:09,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:10:09,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:10:09" (1/1) ... [2020-10-21 23:10:09,528 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:09, skipping insertion in model container [2020-10-21 23:10:09,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:10:09" (1/1) ... [2020-10-21 23:10:09,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:10:09,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:10:10,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:10:10,376 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:10:10,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:10:10,852 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:10:10,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:10 WrapperNode [2020-10-21 23:10:10,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:10:10,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:10:10,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:10:10,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:10:10,866 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:10" (1/1) ... [2020-10-21 23:10:10,930 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:10" (1/1) ... [2020-10-21 23:10:10,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:10:10,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:10:10,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:10:10,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:10:10,984 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:10" (1/1) ... [2020-10-21 23:10:10,985 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:10" (1/1) ... [2020-10-21 23:10:10,989 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:10" (1/1) ... [2020-10-21 23:10:10,989 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:10" (1/1) ... [2020-10-21 23:10:11,005 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:10" (1/1) ... [2020-10-21 23:10:11,008 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:10" (1/1) ... [2020-10-21 23:10:11,015 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:10" (1/1) ... [2020-10-21 23:10:11,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:10:11,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:10:11,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:10:11,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:10:11,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:10" (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:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:10:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-21 23:10:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-21 23:10:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-21 23:10:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:10:11,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:10:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-21 23:10:11,092 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-21 23:10:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:10:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:10:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:10:11,094 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:11,743 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:10:11,743 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-10-21 23:10:11,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:10:11 BoogieIcfgContainer [2020-10-21 23:10:11,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:10:11,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:10:11,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:10:11,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:10:11,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:10:09" (1/3) ... [2020-10-21 23:10:11,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0b6bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:10:11, skipping insertion in model container [2020-10-21 23:10:11,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:10:10" (2/3) ... [2020-10-21 23:10:11,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0b6bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:10:11, skipping insertion in model container [2020-10-21 23:10:11,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:10:11" (3/3) ... [2020-10-21 23:10:11,758 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2020-10-21 23:10:11,771 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:10:11,771 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:10:11,781 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-21 23:10:11,782 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:10:11,839 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:11,840 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:11,840 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,840 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,841 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,841 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,841 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,841 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,841 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:11,842 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:11,842 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,842 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,842 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:11,842 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:11,843 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:11,843 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:11,843 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:11,843 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:11,844 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:11,844 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:11,844 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,844 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,844 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:11,845 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:11,847 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:11,848 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:11,848 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,848 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:11,848 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,848 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:11,849 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,850 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:11,850 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:11,851 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,851 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,851 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:11,852 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:11,852 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,852 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,854 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,854 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,854 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,854 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,855 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:11,855 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:11,855 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,856 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,856 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:11,856 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:11,856 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:11,856 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:11,856 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:11,857 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:11,857 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:11,857 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:11,857 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,857 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,858 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:11,858 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:11,858 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:11,858 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:11,859 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,859 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:11,859 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,859 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:11,860 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,860 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:11,860 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:11,861 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,861 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,865 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,865 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:11,865 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,865 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,866 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,866 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:11,866 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:11,866 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,867 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:11,867 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,873 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:11,873 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,873 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:11,874 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,874 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,874 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,874 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:11,875 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:11,875 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,875 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,876 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,876 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:10:11,885 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-10-21 23:10:11,899 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-21 23:10:11,921 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:10:11,921 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:10:11,921 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:10:11,922 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:10:11,922 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:10:11,922 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:10:11,922 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:10:11,922 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:10:11,960 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:10:11,961 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 189 transitions, 400 flow [2020-10-21 23:10:11,964 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 189 transitions, 400 flow [2020-10-21 23:10:11,966 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 179 places, 189 transitions, 400 flow [2020-10-21 23:10:12,049 INFO L129 PetriNetUnfolder]: 19/237 cut-off events. [2020-10-21 23:10:12,049 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-21 23:10:12,055 INFO L80 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 237 events. 19/237 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 508 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2020-10-21 23:10:12,060 INFO L116 LiptonReduction]: Number of co-enabled transitions 3444 [2020-10-21 23:10:12,706 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:12,726 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:12,731 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:12,746 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:12,748 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:12,749 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-21 23:10:15,523 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-10-21 23:10:15,710 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:15,730 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:15,733 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:15,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:15,758 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:15,759 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-21 23:10:16,001 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2020-10-21 23:10:17,217 WARN L193 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 135 [2020-10-21 23:10:17,558 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-21 23:10:17,996 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-10-21 23:10:19,771 WARN L193 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 168 DAG size of output: 164 [2020-10-21 23:10:19,812 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:20,700 WARN L193 SmtUtils]: Spent 887.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-10-21 23:10:20,701 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:20,723 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:21,363 WARN L193 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2020-10-21 23:10:21,364 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-21 23:10:21,365 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:21,365 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-10-21 23:10:22,009 WARN L193 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2020-10-21 23:10:22,830 WARN L193 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 158 [2020-10-21 23:10:23,277 WARN L193 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2020-10-21 23:10:23,302 INFO L131 LiptonReduction]: Checked pairs total: 7933 [2020-10-21 23:10:23,303 INFO L133 LiptonReduction]: Total number of compositions: 237 [2020-10-21 23:10:23,309 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-10-21 23:10:23,340 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2020-10-21 23:10:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2020-10-21 23:10:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-21 23:10:23,349 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:23,349 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-21 23:10:23,350 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:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:23,356 INFO L82 PathProgramCache]: Analyzing trace with hash 723, now seen corresponding path program 1 times [2020-10-21 23:10:23,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:23,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898758343] [2020-10-21 23:10:23,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:23,652 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:23,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898758343] [2020-10-21 23:10:23,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:23,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-21 23:10:23,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985718977] [2020-10-21 23:10:23,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-21 23:10:23,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:23,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-21 23:10:23,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-21 23:10:23,671 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2020-10-21 23:10:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:23,704 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-10-21 23:10:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-21 23:10:23,706 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-21 23:10:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:23,722 INFO L225 Difference]: With dead ends: 423 [2020-10-21 23:10:23,723 INFO L226 Difference]: Without dead ends: 385 [2020-10-21 23:10:23,724 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:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-10-21 23:10:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-10-21 23:10:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-10-21 23:10:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-10-21 23:10:23,801 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-10-21 23:10:23,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:23,802 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-10-21 23:10:23,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-21 23:10:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-10-21 23:10:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-21 23:10:23,803 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:23,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-21 23:10:23,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:10:23,804 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:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:23,804 INFO L82 PathProgramCache]: Analyzing trace with hash 22064617, now seen corresponding path program 1 times [2020-10-21 23:10:23,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:23,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488220110] [2020-10-21 23:10:23,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:24,034 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:24,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488220110] [2020-10-21 23:10:24,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:24,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:10:24,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030159708] [2020-10-21 23:10:24,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:10:24,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:24,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:10:24,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:10:24,038 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2020-10-21 23:10:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:24,205 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-10-21 23:10:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:10:24,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-21 23:10:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:24,218 INFO L225 Difference]: With dead ends: 540 [2020-10-21 23:10:24,219 INFO L226 Difference]: Without dead ends: 540 [2020-10-21 23:10:24,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:10:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-10-21 23:10:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-10-21 23:10:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-21 23:10:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-10-21 23:10:24,290 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-10-21 23:10:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:24,290 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-10-21 23:10:24,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:10:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-10-21 23:10:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-21 23:10:24,291 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:24,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-21 23:10:24,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:10:24,292 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:24,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash -270739087, now seen corresponding path program 1 times [2020-10-21 23:10:24,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:24,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857528448] [2020-10-21 23:10:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:24,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:24,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857528448] [2020-10-21 23:10:24,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:24,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:10:24,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010113208] [2020-10-21 23:10:24,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:10:24,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:24,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:10:24,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:10:24,449 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 5 states. [2020-10-21 23:10:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:24,631 INFO L93 Difference]: Finished difference Result 600 states and 1430 transitions. [2020-10-21 23:10:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:10:24,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-10-21 23:10:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:24,636 INFO L225 Difference]: With dead ends: 600 [2020-10-21 23:10:24,636 INFO L226 Difference]: Without dead ends: 514 [2020-10-21 23:10:24,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:10:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-10-21 23:10:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-10-21 23:10:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-21 23:10:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-10-21 23:10:24,654 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-10-21 23:10:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:24,655 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-10-21 23:10:24,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:10:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-10-21 23:10:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:10:24,657 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:24,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:24,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:10:24,657 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:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1711454574, now seen corresponding path program 1 times [2020-10-21 23:10:24,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:24,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599393866] [2020-10-21 23:10:24,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:24,725 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:24,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599393866] [2020-10-21 23:10:24,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:24,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:10:24,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907645135] [2020-10-21 23:10:24,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:10:24,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:24,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:10:24,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:10:24,727 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2020-10-21 23:10:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:24,746 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-21 23:10:24,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:10:24,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-21 23:10:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:24,748 INFO L225 Difference]: With dead ends: 162 [2020-10-21 23:10:24,748 INFO L226 Difference]: Without dead ends: 162 [2020-10-21 23:10:24,749 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:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-21 23:10:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-21 23:10:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-21 23:10:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-21 23:10:24,754 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-21 23:10:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:24,754 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-21 23:10:24,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:10:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-21 23:10:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:24,756 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:24,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:24,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:10:24,784 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:24,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:24,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1613525791, now seen corresponding path program 1 times [2020-10-21 23:10:24,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:24,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984877568] [2020-10-21 23:10:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:25,003 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:25,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984877568] [2020-10-21 23:10:25,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:25,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:10:25,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099090589] [2020-10-21 23:10:25,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:10:25,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:25,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:10:25,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:10:25,009 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 9 states. [2020-10-21 23:10:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:25,449 INFO L93 Difference]: Finished difference Result 194 states and 403 transitions. [2020-10-21 23:10:25,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-21 23:10:25,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 23:10:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:25,451 INFO L225 Difference]: With dead ends: 194 [2020-10-21 23:10:25,452 INFO L226 Difference]: Without dead ends: 194 [2020-10-21 23:10:25,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2020-10-21 23:10:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-21 23:10:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2020-10-21 23:10:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-21 23:10:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 389 transitions. [2020-10-21 23:10:25,459 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 389 transitions. Word has length 22 [2020-10-21 23:10:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:25,459 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 389 transitions. [2020-10-21 23:10:25,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:10:25,460 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 389 transitions. [2020-10-21 23:10:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:25,466 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:25,466 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:25,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:10:25,467 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:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:25,467 INFO L82 PathProgramCache]: Analyzing trace with hash -721777329, now seen corresponding path program 1 times [2020-10-21 23:10:25,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:25,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358189820] [2020-10-21 23:10:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:25,664 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:25,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358189820] [2020-10-21 23:10:25,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:25,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:10:25,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603848510] [2020-10-21 23:10:25,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:10:25,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:25,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:10:25,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:10:25,667 INFO L87 Difference]: Start difference. First operand 186 states and 389 transitions. Second operand 6 states. [2020-10-21 23:10:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:25,775 INFO L93 Difference]: Finished difference Result 226 states and 457 transitions. [2020-10-21 23:10:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:10:25,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-21 23:10:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:25,781 INFO L225 Difference]: With dead ends: 226 [2020-10-21 23:10:25,782 INFO L226 Difference]: Without dead ends: 226 [2020-10-21 23:10:25,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:10:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-10-21 23:10:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 198. [2020-10-21 23:10:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-10-21 23:10:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 409 transitions. [2020-10-21 23:10:25,797 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 409 transitions. Word has length 22 [2020-10-21 23:10:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:25,798 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 409 transitions. [2020-10-21 23:10:25,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:10:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 409 transitions. [2020-10-21 23:10:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:25,799 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:25,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:25,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:10:25,800 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:25,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:25,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1148795979, now seen corresponding path program 2 times [2020-10-21 23:10:25,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:25,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040489566] [2020-10-21 23:10:25,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:26,591 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2020-10-21 23:10:26,987 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:26,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040489566] [2020-10-21 23:10:26,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:26,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:26,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826309523] [2020-10-21 23:10:26,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:26,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:26,989 INFO L87 Difference]: Start difference. First operand 198 states and 409 transitions. Second operand 14 states. [2020-10-21 23:10:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:27,976 INFO L93 Difference]: Finished difference Result 227 states and 452 transitions. [2020-10-21 23:10:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:10:27,978 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:27,980 INFO L225 Difference]: With dead ends: 227 [2020-10-21 23:10:27,980 INFO L226 Difference]: Without dead ends: 227 [2020-10-21 23:10:27,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-10-21 23:10:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2020-10-21 23:10:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-10-21 23:10:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 452 transitions. [2020-10-21 23:10:27,987 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 452 transitions. Word has length 22 [2020-10-21 23:10:27,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:27,988 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 452 transitions. [2020-10-21 23:10:27,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:27,988 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 452 transitions. [2020-10-21 23:10:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:27,989 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:27,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:27,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:10:27,990 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:27,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:27,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1148795934, now seen corresponding path program 1 times [2020-10-21 23:10:27,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:27,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377649158] [2020-10-21 23:10:27,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:28,207 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:28,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377649158] [2020-10-21 23:10:28,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:28,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:10:28,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150122329] [2020-10-21 23:10:28,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:10:28,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:28,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:10:28,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:10:28,210 INFO L87 Difference]: Start difference. First operand 226 states and 452 transitions. Second operand 9 states. [2020-10-21 23:10:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:28,629 INFO L93 Difference]: Finished difference Result 295 states and 565 transitions. [2020-10-21 23:10:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:10:28,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 23:10:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:28,631 INFO L225 Difference]: With dead ends: 295 [2020-10-21 23:10:28,631 INFO L226 Difference]: Without dead ends: 265 [2020-10-21 23:10:28,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-10-21 23:10:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 227. [2020-10-21 23:10:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2020-10-21 23:10:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 456 transitions. [2020-10-21 23:10:28,639 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 456 transitions. Word has length 22 [2020-10-21 23:10:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:28,639 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 456 transitions. [2020-10-21 23:10:28,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:10:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 456 transitions. [2020-10-21 23:10:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:28,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:28,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:28,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:10:28,641 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:28,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:28,641 INFO L82 PathProgramCache]: Analyzing trace with hash 235549017, now seen corresponding path program 3 times [2020-10-21 23:10:28,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:28,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558866474] [2020-10-21 23:10:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:29,600 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:29,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558866474] [2020-10-21 23:10:29,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:29,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:29,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634525017] [2020-10-21 23:10:29,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:29,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:29,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:29,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:29,603 INFO L87 Difference]: Start difference. First operand 227 states and 456 transitions. Second operand 14 states. [2020-10-21 23:10:30,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:30,597 INFO L93 Difference]: Finished difference Result 257 states and 502 transitions. [2020-10-21 23:10:30,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 23:10:30,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:30,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:30,599 INFO L225 Difference]: With dead ends: 257 [2020-10-21 23:10:30,600 INFO L226 Difference]: Without dead ends: 229 [2020-10-21 23:10:30,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:30,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-10-21 23:10:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2020-10-21 23:10:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-10-21 23:10:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 459 transitions. [2020-10-21 23:10:30,606 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 459 transitions. Word has length 22 [2020-10-21 23:10:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:30,607 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 459 transitions. [2020-10-21 23:10:30,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 459 transitions. [2020-10-21 23:10:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:30,608 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:30,608 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:30,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:10:30,608 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:30,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:30,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1400369243, now seen corresponding path program 4 times [2020-10-21 23:10:30,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:30,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572187531] [2020-10-21 23:10:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:31,450 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:31,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572187531] [2020-10-21 23:10:31,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:31,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:31,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258932932] [2020-10-21 23:10:31,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:31,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:31,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:31,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:31,452 INFO L87 Difference]: Start difference. First operand 229 states and 459 transitions. Second operand 14 states. [2020-10-21 23:10:32,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:32,410 INFO L93 Difference]: Finished difference Result 280 states and 545 transitions. [2020-10-21 23:10:32,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 23:10:32,411 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:32,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:32,413 INFO L225 Difference]: With dead ends: 280 [2020-10-21 23:10:32,413 INFO L226 Difference]: Without dead ends: 253 [2020-10-21 23:10:32,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:32,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-10-21 23:10:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 233. [2020-10-21 23:10:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-10-21 23:10:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 465 transitions. [2020-10-21 23:10:32,420 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 465 transitions. Word has length 22 [2020-10-21 23:10:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:32,421 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 465 transitions. [2020-10-21 23:10:32,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 465 transitions. [2020-10-21 23:10:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:32,422 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:32,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:32,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:10:32,422 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:32,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:32,423 INFO L82 PathProgramCache]: Analyzing trace with hash -223372275, now seen corresponding path program 5 times [2020-10-21 23:10:32,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:32,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21695618] [2020-10-21 23:10:32,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:33,229 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:33,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21695618] [2020-10-21 23:10:33,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:33,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:33,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816411105] [2020-10-21 23:10:33,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:33,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:33,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:33,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:33,231 INFO L87 Difference]: Start difference. First operand 233 states and 465 transitions. Second operand 14 states. [2020-10-21 23:10:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:34,148 INFO L93 Difference]: Finished difference Result 273 states and 529 transitions. [2020-10-21 23:10:34,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:10:34,149 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:34,151 INFO L225 Difference]: With dead ends: 273 [2020-10-21 23:10:34,151 INFO L226 Difference]: Without dead ends: 273 [2020-10-21 23:10:34,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-10-21 23:10:34,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 266. [2020-10-21 23:10:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-10-21 23:10:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 518 transitions. [2020-10-21 23:10:34,159 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 518 transitions. Word has length 22 [2020-10-21 23:10:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:34,159 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 518 transitions. [2020-10-21 23:10:34,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 518 transitions. [2020-10-21 23:10:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:34,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:34,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:34,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:10:34,161 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:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:34,161 INFO L82 PathProgramCache]: Analyzing trace with hash -223372320, now seen corresponding path program 2 times [2020-10-21 23:10:34,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:34,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217505225] [2020-10-21 23:10:34,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:34,349 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:34,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217505225] [2020-10-21 23:10:34,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:34,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:10:34,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610275181] [2020-10-21 23:10:34,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:10:34,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:34,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:10:34,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:10:34,351 INFO L87 Difference]: Start difference. First operand 266 states and 518 transitions. Second operand 9 states. [2020-10-21 23:10:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:34,706 INFO L93 Difference]: Finished difference Result 367 states and 686 transitions. [2020-10-21 23:10:34,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:10:34,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 23:10:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:34,710 INFO L225 Difference]: With dead ends: 367 [2020-10-21 23:10:34,710 INFO L226 Difference]: Without dead ends: 338 [2020-10-21 23:10:34,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-10-21 23:10:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 258. [2020-10-21 23:10:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-10-21 23:10:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 514 transitions. [2020-10-21 23:10:34,718 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 514 transitions. Word has length 22 [2020-10-21 23:10:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:34,718 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 514 transitions. [2020-10-21 23:10:34,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:10:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 514 transitions. [2020-10-21 23:10:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:34,719 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:34,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:34,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:10:34,720 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:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:34,720 INFO L82 PathProgramCache]: Analyzing trace with hash 783436301, now seen corresponding path program 6 times [2020-10-21 23:10:34,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:34,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372661640] [2020-10-21 23:10:34,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:35,122 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2020-10-21 23:10:35,681 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:35,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372661640] [2020-10-21 23:10:35,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:35,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:35,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438969582] [2020-10-21 23:10:35,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:35,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:35,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:35,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:35,684 INFO L87 Difference]: Start difference. First operand 258 states and 514 transitions. Second operand 14 states. [2020-10-21 23:10:36,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:36,617 INFO L93 Difference]: Finished difference Result 284 states and 551 transitions. [2020-10-21 23:10:36,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-21 23:10:36,617 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:36,620 INFO L225 Difference]: With dead ends: 284 [2020-10-21 23:10:36,620 INFO L226 Difference]: Without dead ends: 267 [2020-10-21 23:10:36,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-10-21 23:10:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-10-21 23:10:36,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 262. [2020-10-21 23:10:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-10-21 23:10:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 520 transitions. [2020-10-21 23:10:36,627 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 520 transitions. Word has length 22 [2020-10-21 23:10:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:36,627 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 520 transitions. [2020-10-21 23:10:36,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 520 transitions. [2020-10-21 23:10:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:36,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:36,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:36,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:10:36,629 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:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash -617705459, now seen corresponding path program 7 times [2020-10-21 23:10:36,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:36,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630500477] [2020-10-21 23:10:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:37,439 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:37,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630500477] [2020-10-21 23:10:37,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:37,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:37,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25968109] [2020-10-21 23:10:37,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:37,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:37,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:37,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:37,444 INFO L87 Difference]: Start difference. First operand 262 states and 520 transitions. Second operand 14 states. [2020-10-21 23:10:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:38,243 INFO L93 Difference]: Finished difference Result 273 states and 531 transitions. [2020-10-21 23:10:38,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 23:10:38,244 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:38,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:38,246 INFO L225 Difference]: With dead ends: 273 [2020-10-21 23:10:38,246 INFO L226 Difference]: Without dead ends: 244 [2020-10-21 23:10:38,247 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-10-21 23:10:38,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2020-10-21 23:10:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-10-21 23:10:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 491 transitions. [2020-10-21 23:10:38,257 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 491 transitions. Word has length 22 [2020-10-21 23:10:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:38,257 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 491 transitions. [2020-10-21 23:10:38,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 491 transitions. [2020-10-21 23:10:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:38,259 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:38,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:38,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:10:38,259 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:38,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:38,260 INFO L82 PathProgramCache]: Analyzing trace with hash 207084251, now seen corresponding path program 8 times [2020-10-21 23:10:38,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:38,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820447792] [2020-10-21 23:10:38,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:39,122 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:39,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820447792] [2020-10-21 23:10:39,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:39,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:39,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805289431] [2020-10-21 23:10:39,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:39,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:39,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:39,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:39,124 INFO L87 Difference]: Start difference. First operand 244 states and 491 transitions. Second operand 14 states. [2020-10-21 23:10:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:40,145 INFO L93 Difference]: Finished difference Result 290 states and 574 transitions. [2020-10-21 23:10:40,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:10:40,145 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:40,147 INFO L225 Difference]: With dead ends: 290 [2020-10-21 23:10:40,147 INFO L226 Difference]: Without dead ends: 262 [2020-10-21 23:10:40,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-10-21 23:10:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 243. [2020-10-21 23:10:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-10-21 23:10:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 489 transitions. [2020-10-21 23:10:40,157 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 489 transitions. Word has length 22 [2020-10-21 23:10:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:40,157 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 489 transitions. [2020-10-21 23:10:40,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 489 transitions. [2020-10-21 23:10:40,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:40,158 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:40,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:40,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:10:40,159 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:40,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:40,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1428834009, now seen corresponding path program 9 times [2020-10-21 23:10:40,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:40,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488021163] [2020-10-21 23:10:40,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:41,053 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:41,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488021163] [2020-10-21 23:10:41,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:41,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:41,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705519160] [2020-10-21 23:10:41,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:41,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:41,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:41,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:41,055 INFO L87 Difference]: Start difference. First operand 243 states and 489 transitions. Second operand 14 states. [2020-10-21 23:10:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:41,979 INFO L93 Difference]: Finished difference Result 313 states and 617 transitions. [2020-10-21 23:10:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:10:41,979 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:41,982 INFO L225 Difference]: With dead ends: 313 [2020-10-21 23:10:41,982 INFO L226 Difference]: Without dead ends: 286 [2020-10-21 23:10:41,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-10-21 23:10:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 247. [2020-10-21 23:10:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-10-21 23:10:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 495 transitions. [2020-10-21 23:10:41,990 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 495 transitions. Word has length 22 [2020-10-21 23:10:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:41,991 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 495 transitions. [2020-10-21 23:10:41,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 495 transitions. [2020-10-21 23:10:41,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:41,992 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:41,992 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:41,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:10:41,992 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:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:41,993 INFO L82 PathProgramCache]: Analyzing trace with hash -251837041, now seen corresponding path program 10 times [2020-10-21 23:10:41,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:41,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517971739] [2020-10-21 23:10:41,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:42,779 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:42,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517971739] [2020-10-21 23:10:42,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:42,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:42,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207298113] [2020-10-21 23:10:42,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:42,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:42,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:42,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:42,781 INFO L87 Difference]: Start difference. First operand 247 states and 495 transitions. Second operand 14 states. [2020-10-21 23:10:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:43,689 INFO L93 Difference]: Finished difference Result 305 states and 600 transitions. [2020-10-21 23:10:43,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:10:43,690 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:43,692 INFO L225 Difference]: With dead ends: 305 [2020-10-21 23:10:43,692 INFO L226 Difference]: Without dead ends: 276 [2020-10-21 23:10:43,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-10-21 23:10:43,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 251. [2020-10-21 23:10:43,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-10-21 23:10:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 501 transitions. [2020-10-21 23:10:43,699 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 501 transitions. Word has length 22 [2020-10-21 23:10:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:43,700 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 501 transitions. [2020-10-21 23:10:43,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 501 transitions. [2020-10-21 23:10:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:43,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:43,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:43,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:10:43,701 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:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:43,702 INFO L82 PathProgramCache]: Analyzing trace with hash 754971535, now seen corresponding path program 11 times [2020-10-21 23:10:43,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:43,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412914866] [2020-10-21 23:10:43,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:44,490 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,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412914866] [2020-10-21 23:10:44,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:44,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:44,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12547704] [2020-10-21 23:10:44,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:44,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:44,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:44,492 INFO L87 Difference]: Start difference. First operand 251 states and 501 transitions. Second operand 14 states. [2020-10-21 23:10:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:45,478 INFO L93 Difference]: Finished difference Result 296 states and 580 transitions. [2020-10-21 23:10:45,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-21 23:10:45,479 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:45,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:45,481 INFO L225 Difference]: With dead ends: 296 [2020-10-21 23:10:45,482 INFO L226 Difference]: Without dead ends: 279 [2020-10-21 23:10:45,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-10-21 23:10:45,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-10-21 23:10:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 255. [2020-10-21 23:10:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2020-10-21 23:10:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 507 transitions. [2020-10-21 23:10:45,489 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 507 transitions. Word has length 22 [2020-10-21 23:10:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:45,489 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 507 transitions. [2020-10-21 23:10:45,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 507 transitions. [2020-10-21 23:10:45,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:45,490 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:45,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:45,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:10:45,491 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:45,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:45,491 INFO L82 PathProgramCache]: Analyzing trace with hash -646170225, now seen corresponding path program 12 times [2020-10-21 23:10:45,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:45,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062300211] [2020-10-21 23:10:45,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:46,276 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,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062300211] [2020-10-21 23:10:46,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:46,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:46,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147509292] [2020-10-21 23:10:46,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:46,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:46,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:46,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:46,279 INFO L87 Difference]: Start difference. First operand 255 states and 507 transitions. Second operand 14 states. [2020-10-21 23:10:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:47,064 INFO L93 Difference]: Finished difference Result 285 states and 560 transitions. [2020-10-21 23:10:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:10:47,065 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:47,066 INFO L225 Difference]: With dead ends: 285 [2020-10-21 23:10:47,066 INFO L226 Difference]: Without dead ends: 260 [2020-10-21 23:10:47,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-10-21 23:10:47,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 241. [2020-10-21 23:10:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-10-21 23:10:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 485 transitions. [2020-10-21 23:10:47,073 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 485 transitions. Word has length 22 [2020-10-21 23:10:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:47,073 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 485 transitions. [2020-10-21 23:10:47,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 485 transitions. [2020-10-21 23:10:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:47,074 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:47,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:47,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 23:10:47,074 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:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:47,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1326801883, now seen corresponding path program 13 times [2020-10-21 23:10:47,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:47,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947778608] [2020-10-21 23:10:47,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:47,905 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,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947778608] [2020-10-21 23:10:47,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:47,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:47,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855340206] [2020-10-21 23:10:47,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:47,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:47,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:47,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:47,907 INFO L87 Difference]: Start difference. First operand 241 states and 485 transitions. Second operand 14 states. [2020-10-21 23:10:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:48,896 INFO L93 Difference]: Finished difference Result 351 states and 690 transitions. [2020-10-21 23:10:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:10:48,897 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:48,899 INFO L225 Difference]: With dead ends: 351 [2020-10-21 23:10:48,900 INFO L226 Difference]: Without dead ends: 324 [2020-10-21 23:10:48,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-10-21 23:10:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 242. [2020-10-21 23:10:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-10-21 23:10:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 486 transitions. [2020-10-21 23:10:48,907 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 486 transitions. Word has length 22 [2020-10-21 23:10:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:48,907 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 486 transitions. [2020-10-21 23:10:48,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 486 transitions. [2020-10-21 23:10:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:48,908 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:48,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:48,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-21 23:10:48,908 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:48,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash -149804915, now seen corresponding path program 14 times [2020-10-21 23:10:48,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:48,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139252142] [2020-10-21 23:10:48,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:49,673 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,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139252142] [2020-10-21 23:10:49,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:49,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:49,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140064320] [2020-10-21 23:10:49,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:49,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:49,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:49,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:49,675 INFO L87 Difference]: Start difference. First operand 242 states and 486 transitions. Second operand 14 states. [2020-10-21 23:10:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:50,712 INFO L93 Difference]: Finished difference Result 343 states and 673 transitions. [2020-10-21 23:10:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:10:50,713 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:50,716 INFO L225 Difference]: With dead ends: 343 [2020-10-21 23:10:50,716 INFO L226 Difference]: Without dead ends: 314 [2020-10-21 23:10:50,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-10-21 23:10:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 246. [2020-10-21 23:10:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-10-21 23:10:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 492 transitions. [2020-10-21 23:10:50,723 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 492 transitions. Word has length 22 [2020-10-21 23:10:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:50,723 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 492 transitions. [2020-10-21 23:10:50,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 492 transitions. [2020-10-21 23:10:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:50,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:50,724 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:50,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-21 23:10:50,725 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:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash 857003661, now seen corresponding path program 15 times [2020-10-21 23:10:50,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:50,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238762689] [2020-10-21 23:10:50,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:51,482 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,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238762689] [2020-10-21 23:10:51,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:51,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:51,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992141317] [2020-10-21 23:10:51,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:51,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:51,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:51,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:51,484 INFO L87 Difference]: Start difference. First operand 246 states and 492 transitions. Second operand 14 states. [2020-10-21 23:10:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:52,473 INFO L93 Difference]: Finished difference Result 334 states and 653 transitions. [2020-10-21 23:10:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-21 23:10:52,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:52,476 INFO L225 Difference]: With dead ends: 334 [2020-10-21 23:10:52,476 INFO L226 Difference]: Without dead ends: 317 [2020-10-21 23:10:52,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-10-21 23:10:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-10-21 23:10:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 250. [2020-10-21 23:10:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-21 23:10:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 498 transitions. [2020-10-21 23:10:52,482 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 498 transitions. Word has length 22 [2020-10-21 23:10:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:52,482 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 498 transitions. [2020-10-21 23:10:52,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:52,482 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 498 transitions. [2020-10-21 23:10:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:52,483 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:52,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:52,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-21 23:10:52,484 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:52,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:52,484 INFO L82 PathProgramCache]: Analyzing trace with hash -544138099, now seen corresponding path program 16 times [2020-10-21 23:10:52,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:52,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979440366] [2020-10-21 23:10:52,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:53,249 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,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979440366] [2020-10-21 23:10:53,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:53,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:53,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108418382] [2020-10-21 23:10:53,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:53,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:53,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:53,251 INFO L87 Difference]: Start difference. First operand 250 states and 498 transitions. Second operand 14 states. [2020-10-21 23:10:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:54,092 INFO L93 Difference]: Finished difference Result 323 states and 633 transitions. [2020-10-21 23:10:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:10:54,093 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:54,094 INFO L225 Difference]: With dead ends: 323 [2020-10-21 23:10:54,095 INFO L226 Difference]: Without dead ends: 290 [2020-10-21 23:10:54,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:54,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-10-21 23:10:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 228. [2020-10-21 23:10:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2020-10-21 23:10:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 463 transitions. [2020-10-21 23:10:54,100 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 463 transitions. Word has length 22 [2020-10-21 23:10:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:54,100 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 463 transitions. [2020-10-21 23:10:54,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 463 transitions. [2020-10-21 23:10:54,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:54,100 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:54,100 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:54,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-21 23:10:54,101 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:10:54,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:54,101 INFO L82 PathProgramCache]: Analyzing trace with hash -618210351, now seen corresponding path program 17 times [2020-10-21 23:10:54,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:54,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357701069] [2020-10-21 23:10:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:10:54,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357701069] [2020-10-21 23:10:54,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:54,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:10:54,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797771241] [2020-10-21 23:10:54,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:10:54,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:54,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:10:54,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:10:54,189 INFO L87 Difference]: Start difference. First operand 228 states and 463 transitions. Second operand 6 states. [2020-10-21 23:10:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:54,268 INFO L93 Difference]: Finished difference Result 128 states and 203 transitions. [2020-10-21 23:10:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:10:54,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-21 23:10:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:54,269 INFO L225 Difference]: With dead ends: 128 [2020-10-21 23:10:54,269 INFO L226 Difference]: Without dead ends: 128 [2020-10-21 23:10:54,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:10:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-10-21 23:10:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-10-21 23:10:54,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-21 23:10:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2020-10-21 23:10:54,273 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 203 transitions. Word has length 22 [2020-10-21 23:10:54,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:54,273 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 203 transitions. [2020-10-21 23:10:54,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:10:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 203 transitions. [2020-10-21 23:10:54,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:54,274 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:54,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:54,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-21 23:10:54,274 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:10:54,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1321574743, now seen corresponding path program 18 times [2020-10-21 23:10:54,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:54,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072232317] [2020-10-21 23:10:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:55,076 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,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072232317] [2020-10-21 23:10:55,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:55,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:55,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306236792] [2020-10-21 23:10:55,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:55,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:55,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:55,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:55,078 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. Second operand 14 states. [2020-10-21 23:10:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:55,945 INFO L93 Difference]: Finished difference Result 159 states and 248 transitions. [2020-10-21 23:10:55,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 23:10:55,945 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:55,946 INFO L225 Difference]: With dead ends: 159 [2020-10-21 23:10:55,946 INFO L226 Difference]: Without dead ends: 129 [2020-10-21 23:10:55,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-21 23:10:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2020-10-21 23:10:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-21 23:10:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 201 transitions. [2020-10-21 23:10:55,950 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 201 transitions. Word has length 22 [2020-10-21 23:10:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:55,950 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 201 transitions. [2020-10-21 23:10:55,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 201 transitions. [2020-10-21 23:10:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:55,951 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:55,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:55,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-21 23:10:55,952 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:10:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:55,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1537379531, now seen corresponding path program 19 times [2020-10-21 23:10:55,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:55,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571603160] [2020-10-21 23:10:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:56,682 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,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571603160] [2020-10-21 23:10:56,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:56,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:56,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621946217] [2020-10-21 23:10:56,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:56,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:56,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:56,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:56,684 INFO L87 Difference]: Start difference. First operand 128 states and 201 transitions. Second operand 14 states. [2020-10-21 23:10:57,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:57,471 INFO L93 Difference]: Finished difference Result 156 states and 243 transitions. [2020-10-21 23:10:57,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 23:10:57,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:57,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:57,472 INFO L225 Difference]: With dead ends: 156 [2020-10-21 23:10:57,472 INFO L226 Difference]: Without dead ends: 128 [2020-10-21 23:10:57,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:57,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-10-21 23:10:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-10-21 23:10:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-21 23:10:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 200 transitions. [2020-10-21 23:10:57,476 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 200 transitions. Word has length 22 [2020-10-21 23:10:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:57,477 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 200 transitions. [2020-10-21 23:10:57,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 200 transitions. [2020-10-21 23:10:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:57,477 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:57,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:57,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-21 23:10:57,478 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:10:57,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash -98538729, now seen corresponding path program 20 times [2020-10-21 23:10:57,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:57,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701884491] [2020-10-21 23:10:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:58,189 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,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701884491] [2020-10-21 23:10:58,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:58,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:58,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299070074] [2020-10-21 23:10:58,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:58,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:58,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:58,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:58,191 INFO L87 Difference]: Start difference. First operand 128 states and 200 transitions. Second operand 14 states. [2020-10-21 23:10:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:10:58,985 INFO L93 Difference]: Finished difference Result 167 states and 262 transitions. [2020-10-21 23:10:58,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 23:10:58,992 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:10:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:10:58,993 INFO L225 Difference]: With dead ends: 167 [2020-10-21 23:10:58,993 INFO L226 Difference]: Without dead ends: 140 [2020-10-21 23:10:58,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:10:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-21 23:10:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2020-10-21 23:10:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-21 23:10:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 198 transitions. [2020-10-21 23:10:58,996 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 198 transitions. Word has length 22 [2020-10-21 23:10:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:10:58,997 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 198 transitions. [2020-10-21 23:10:58,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:10:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 198 transitions. [2020-10-21 23:10:58,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:10:58,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:10:58,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:10:58,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-21 23:10:58,998 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:10:58,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:10:58,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1078458239, now seen corresponding path program 21 times [2020-10-21 23:10:58,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:10:58,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262792466] [2020-10-21 23:10:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:10:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:10:59,910 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,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262792466] [2020-10-21 23:10:59,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:10:59,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:10:59,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404685910] [2020-10-21 23:10:59,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:10:59,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:10:59,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:10:59,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:10:59,912 INFO L87 Difference]: Start difference. First operand 128 states and 198 transitions. Second operand 14 states. [2020-10-21 23:11:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:00,771 INFO L93 Difference]: Finished difference Result 159 states and 245 transitions. [2020-10-21 23:11:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 23:11:00,771 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:11:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:00,772 INFO L225 Difference]: With dead ends: 159 [2020-10-21 23:11:00,772 INFO L226 Difference]: Without dead ends: 130 [2020-10-21 23:11:00,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:11:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-21 23:11:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2020-10-21 23:11:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-21 23:11:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2020-10-21 23:11:00,776 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 22 [2020-10-21 23:11:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:00,776 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2020-10-21 23:11:00,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:11:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2020-10-21 23:11:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:00,777 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:00,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:00,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-21 23:11:00,777 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:00,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:00,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2085266815, now seen corresponding path program 22 times [2020-10-21 23:11:00,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:00,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900289957] [2020-10-21 23:11:00,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:01,576 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,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900289957] [2020-10-21 23:11:01,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:01,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:11:01,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743652848] [2020-10-21 23:11:01,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:11:01,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:01,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:11:01,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:01,578 INFO L87 Difference]: Start difference. First operand 127 states and 194 transitions. Second operand 14 states. [2020-10-21 23:11:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:02,485 INFO L93 Difference]: Finished difference Result 151 states and 225 transitions. [2020-10-21 23:11:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-21 23:11:02,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:11:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:02,487 INFO L225 Difference]: With dead ends: 151 [2020-10-21 23:11:02,488 INFO L226 Difference]: Without dead ends: 134 [2020-10-21 23:11:02,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-21 23:11:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-21 23:11:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2020-10-21 23:11:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-21 23:11:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2020-10-21 23:11:02,493 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 22 [2020-10-21 23:11:02,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:02,493 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2020-10-21 23:11:02,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:11:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2020-10-21 23:11:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:02,494 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:02,494 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:02,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-21 23:11:02,494 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:02,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:02,495 INFO L82 PathProgramCache]: Analyzing trace with hash 684125055, now seen corresponding path program 23 times [2020-10-21 23:11:02,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:02,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168050572] [2020-10-21 23:11:02,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:03,190 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,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168050572] [2020-10-21 23:11:03,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:03,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:11:03,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594891067] [2020-10-21 23:11:03,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:11:03,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:03,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:11:03,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:03,194 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand 14 states. [2020-10-21 23:11:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:03,934 INFO L93 Difference]: Finished difference Result 139 states and 204 transitions. [2020-10-21 23:11:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:11:03,935 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:11:03,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:03,935 INFO L225 Difference]: With dead ends: 139 [2020-10-21 23:11:03,935 INFO L226 Difference]: Without dead ends: 110 [2020-10-21 23:11:03,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:11:03,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-21 23:11:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-10-21 23:11:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-21 23:11:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2020-10-21 23:11:03,940 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 22 [2020-10-21 23:11:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:03,940 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2020-10-21 23:11:03,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:11:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2020-10-21 23:11:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:03,941 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:03,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:03,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-21 23:11:03,941 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:03,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:03,941 INFO L82 PathProgramCache]: Analyzing trace with hash 374516555, now seen corresponding path program 24 times [2020-10-21 23:11:03,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:03,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374884756] [2020-10-21 23:11:03,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:04,793 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,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374884756] [2020-10-21 23:11:04,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:04,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:11:04,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420157086] [2020-10-21 23:11:04,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:11:04,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:04,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:11:04,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:04,795 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand 14 states. [2020-10-21 23:11:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:05,613 INFO L93 Difference]: Finished difference Result 101 states and 151 transitions. [2020-10-21 23:11:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 23:11:05,614 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:11:05,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:05,615 INFO L225 Difference]: With dead ends: 101 [2020-10-21 23:11:05,615 INFO L226 Difference]: Without dead ends: 71 [2020-10-21 23:11:05,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:11:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-21 23:11:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-21 23:11:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-21 23:11:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2020-10-21 23:11:05,618 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 22 [2020-10-21 23:11:05,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:05,618 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2020-10-21 23:11:05,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:11:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2020-10-21 23:11:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:05,618 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:05,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:05,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-21 23:11:05,619 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:05,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:05,619 INFO L82 PathProgramCache]: Analyzing trace with hash -983508743, now seen corresponding path program 25 times [2020-10-21 23:11:05,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:05,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713684923] [2020-10-21 23:11:05,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:06,438 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,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713684923] [2020-10-21 23:11:06,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:06,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:11:06,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17421229] [2020-10-21 23:11:06,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:11:06,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:06,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:11:06,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:06,439 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand 14 states. [2020-10-21 23:11:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:07,211 INFO L93 Difference]: Finished difference Result 87 states and 121 transitions. [2020-10-21 23:11:07,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:11:07,212 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:11:07,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:07,213 INFO L225 Difference]: With dead ends: 87 [2020-10-21 23:11:07,214 INFO L226 Difference]: Without dead ends: 87 [2020-10-21 23:11:07,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:11:07,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-21 23:11:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2020-10-21 23:11:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-21 23:11:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2020-10-21 23:11:07,217 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 22 [2020-10-21 23:11:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:07,217 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2020-10-21 23:11:07,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:11:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2020-10-21 23:11:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:07,218 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:07,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:07,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-21 23:11:07,218 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,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash -983508788, now seen corresponding path program 3 times [2020-10-21 23:11:07,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:07,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417964877] [2020-10-21 23:11:07,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:07,399 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,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417964877] [2020-10-21 23:11:07,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:07,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:11:07,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489617956] [2020-10-21 23:11:07,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:11:07,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:07,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:11:07,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:11:07,401 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand 9 states. [2020-10-21 23:11:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:07,714 INFO L93 Difference]: Finished difference Result 111 states and 158 transitions. [2020-10-21 23:11:07,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:07,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 23:11:07,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:07,715 INFO L225 Difference]: With dead ends: 111 [2020-10-21 23:11:07,715 INFO L226 Difference]: Without dead ends: 95 [2020-10-21 23:11:07,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:07,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-21 23:11:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-10-21 23:11:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-21 23:11:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2020-10-21 23:11:07,719 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 22 [2020-10-21 23:11:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:07,720 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2020-10-21 23:11:07,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:11:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2020-10-21 23:11:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:07,720 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:07,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:07,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-21 23:11:07,721 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:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:07,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1609619909, now seen corresponding path program 26 times [2020-10-21 23:11:07,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:07,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121982634] [2020-10-21 23:11:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:08,479 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,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121982634] [2020-10-21 23:11:08,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:08,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:11:08,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645845463] [2020-10-21 23:11:08,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:11:08,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:08,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:11:08,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:08,481 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand 14 states. [2020-10-21 23:11:09,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:09,300 INFO L93 Difference]: Finished difference Result 126 states and 188 transitions. [2020-10-21 23:11:09,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 23:11:09,301 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:11:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:09,302 INFO L225 Difference]: With dead ends: 126 [2020-10-21 23:11:09,302 INFO L226 Difference]: Without dead ends: 84 [2020-10-21 23:11:09,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:11:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-21 23:11:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-10-21 23:11:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-21 23:11:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2020-10-21 23:11:09,306 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 22 [2020-10-21 23:11:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:09,306 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2020-10-21 23:11:09,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:11:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2020-10-21 23:11:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:09,307 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:09,307 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:09,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-21 23:11:09,307 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,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:09,307 INFO L82 PathProgramCache]: Analyzing trace with hash 468200473, now seen corresponding path program 2 times [2020-10-21 23:11:09,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:09,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68642191] [2020-10-21 23:11:09,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:09,401 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,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68642191] [2020-10-21 23:11:09,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:09,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:11:09,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036632273] [2020-10-21 23:11:09,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:11:09,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:09,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:11:09,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:11:09,403 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand 8 states. [2020-10-21 23:11:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:09,660 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2020-10-21 23:11:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:11:09,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-21 23:11:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:09,661 INFO L225 Difference]: With dead ends: 69 [2020-10-21 23:11:09,662 INFO L226 Difference]: Without dead ends: 69 [2020-10-21 23:11:09,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:11:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-21 23:11:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2020-10-21 23:11:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-21 23:11:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2020-10-21 23:11:09,664 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 22 [2020-10-21 23:11:09,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:09,664 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2020-10-21 23:11:09,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:11:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2020-10-21 23:11:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:09,665 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:09,665 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:09,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-21 23:11:09,666 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,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:09,666 INFO L82 PathProgramCache]: Analyzing trace with hash -411053783, now seen corresponding path program 27 times [2020-10-21 23:11:09,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:09,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119555241] [2020-10-21 23:11:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:10,550 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,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119555241] [2020-10-21 23:11:10,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:10,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:11:10,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142666359] [2020-10-21 23:11:10,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:11:10,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:11:10,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:10,551 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand 14 states. [2020-10-21 23:11:11,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:11,396 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2020-10-21 23:11:11,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-21 23:11:11,397 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:11:11,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:11,397 INFO L225 Difference]: With dead ends: 79 [2020-10-21 23:11:11,398 INFO L226 Difference]: Without dead ends: 66 [2020-10-21 23:11:11,398 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2020-10-21 23:11:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-21 23:11:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-10-21 23:11:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-21 23:11:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2020-10-21 23:11:11,401 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 22 [2020-10-21 23:11:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:11,401 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2020-10-21 23:11:11,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:11:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2020-10-21 23:11:11,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:11,402 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:11,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:11,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-21 23:11:11,404 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:11,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:11,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2098826979, now seen corresponding path program 28 times [2020-10-21 23:11:11,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:11,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810842762] [2020-10-21 23:11:11,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:12,164 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,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810842762] [2020-10-21 23:11:12,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:12,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:11:12,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486467786] [2020-10-21 23:11:12,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:11:12,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:12,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:11:12,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:12,166 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 14 states. [2020-10-21 23:11:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:12,946 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2020-10-21 23:11:12,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:11:12,947 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:11:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:12,948 INFO L225 Difference]: With dead ends: 66 [2020-10-21 23:11:12,948 INFO L226 Difference]: Without dead ends: 54 [2020-10-21 23:11:12,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-21 23:11:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-21 23:11:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-21 23:11:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-21 23:11:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2020-10-21 23:11:12,951 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 22 [2020-10-21 23:11:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:12,951 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2020-10-21 23:11:12,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:11:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2020-10-21 23:11:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:12,952 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:12,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:12,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-21 23:11:12,952 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:12,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:12,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1088468309, now seen corresponding path program 29 times [2020-10-21 23:11:12,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:12,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725549396] [2020-10-21 23:11:12,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:13,699 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:13,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725549396] [2020-10-21 23:11:13,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:13,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:11:13,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852195490] [2020-10-21 23:11:13,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:11:13,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:13,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:11:13,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:13,701 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand 14 states. [2020-10-21 23:11:14,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:14,409 INFO L93 Difference]: Finished difference Result 72 states and 101 transitions. [2020-10-21 23:11:14,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:11:14,410 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:11:14,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:14,411 INFO L225 Difference]: With dead ends: 72 [2020-10-21 23:11:14,411 INFO L226 Difference]: Without dead ends: 72 [2020-10-21 23:11:14,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:11:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-21 23:11:14,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-10-21 23:11:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-21 23:11:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2020-10-21 23:11:14,414 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 22 [2020-10-21 23:11:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:14,415 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2020-10-21 23:11:14,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:11:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2020-10-21 23:11:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:14,415 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:14,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:14,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-21 23:11:14,416 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:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:14,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1088468264, now seen corresponding path program 4 times [2020-10-21 23:11:14,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:14,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975356285] [2020-10-21 23:11:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:14,601 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:14,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975356285] [2020-10-21 23:11:14,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:14,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:11:14,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140816291] [2020-10-21 23:11:14,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:11:14,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:14,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:11:14,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:11:14,603 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand 9 states. [2020-10-21 23:11:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:14,837 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2020-10-21 23:11:14,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:11:14,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 23:11:14,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:14,838 INFO L225 Difference]: With dead ends: 70 [2020-10-21 23:11:14,838 INFO L226 Difference]: Without dead ends: 44 [2020-10-21 23:11:14,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-21 23:11:14,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-10-21 23:11:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-21 23:11:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2020-10-21 23:11:14,840 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 22 [2020-10-21 23:11:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:14,841 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2020-10-21 23:11:14,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:11:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2020-10-21 23:11:14,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:14,841 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:14,841 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:14,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-21 23:11:14,841 INFO L429 AbstractCegarLoop]: === Iteration 40 === [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:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:14,842 INFO L82 PathProgramCache]: Analyzing trace with hash 22133125, now seen corresponding path program 3 times [2020-10-21 23:11:14,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:14,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021059660] [2020-10-21 23:11:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:15,062 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:15,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021059660] [2020-10-21 23:11:15,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:15,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:11:15,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474838832] [2020-10-21 23:11:15,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-21 23:11:15,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:15,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-21 23:11:15,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:11:15,063 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand 13 states. [2020-10-21 23:11:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:15,455 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2020-10-21 23:11:15,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-21 23:11:15,456 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-10-21 23:11:15,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:15,456 INFO L225 Difference]: With dead ends: 44 [2020-10-21 23:11:15,456 INFO L226 Difference]: Without dead ends: 35 [2020-10-21 23:11:15,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2020-10-21 23:11:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-21 23:11:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-21 23:11:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-21 23:11:15,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2020-10-21 23:11:15,459 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 22 [2020-10-21 23:11:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:15,459 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-10-21 23:11:15,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-21 23:11:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2020-10-21 23:11:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:15,460 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:15,460 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:15,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-21 23:11:15,460 INFO L429 AbstractCegarLoop]: === Iteration 41 === [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:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:15,461 INFO L82 PathProgramCache]: Analyzing trace with hash 913881587, now seen corresponding path program 30 times [2020-10-21 23:11:15,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:15,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591434209] [2020-10-21 23:11:15,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:16,189 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:16,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591434209] [2020-10-21 23:11:16,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:16,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:11:16,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734665351] [2020-10-21 23:11:16,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:11:16,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:16,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:11:16,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:16,190 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 14 states. [2020-10-21 23:11:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:16,853 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-10-21 23:11:16,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:11:16,854 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:11:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:16,854 INFO L225 Difference]: With dead ends: 42 [2020-10-21 23:11:16,855 INFO L226 Difference]: Without dead ends: 34 [2020-10-21 23:11:16,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:11:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-21 23:11:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-21 23:11:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-21 23:11:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-10-21 23:11:16,857 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 22 [2020-10-21 23:11:16,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:16,857 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-21 23:11:16,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:11:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-10-21 23:11:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:11:16,858 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:11:16,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:11:16,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-21 23:11:16,858 INFO L429 AbstractCegarLoop]: === Iteration 42 === [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:16,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:11:16,859 INFO L82 PathProgramCache]: Analyzing trace with hash -92005337, now seen corresponding path program 31 times [2020-10-21 23:11:16,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:11:16,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266289769] [2020-10-21 23:11:16,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:11:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:11:17,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:17,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266289769] [2020-10-21 23:11:17,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:11:17,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-21 23:11:17,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575931150] [2020-10-21 23:11:17,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-21 23:11:17,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:11:17,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-21 23:11:17,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:11:17,540 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 14 states. [2020-10-21 23:11:18,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:11:18,126 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-10-21 23:11:18,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 23:11:18,127 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-21 23:11:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:11:18,127 INFO L225 Difference]: With dead ends: 33 [2020-10-21 23:11:18,127 INFO L226 Difference]: Without dead ends: 0 [2020-10-21 23:11:18,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-10-21 23:11:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-21 23:11:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-21 23:11:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-21 23:11:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-21 23:11:18,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-21 23:11:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:11:18,129 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-21 23:11:18,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-21 23:11:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-21 23:11:18,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-21 23:11:18,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-21 23:11:18,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:11:18 BasicIcfg [2020-10-21 23:11:18,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:11:18,135 INFO L168 Benchmark]: Toolchain (without parser) took 68629.23 ms. Allocated memory was 147.8 MB in the beginning and 583.5 MB in the end (delta: 435.7 MB). Free memory was 100.0 MB in the beginning and 134.4 MB in the end (delta: -34.4 MB). Peak memory consumption was 401.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:11:18,135 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 147.8 MB. Free memory was 121.3 MB in the beginning and 121.1 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:18,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1342.24 ms. Allocated memory was 147.8 MB in the beginning and 235.9 MB in the end (delta: 88.1 MB). Free memory was 99.1 MB in the beginning and 163.6 MB in the end (delta: -64.4 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. [2020-10-21 23:11:18,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.79 ms. Allocated memory is still 235.9 MB. Free memory was 163.6 MB in the beginning and 160.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:11:18,136 INFO L168 Benchmark]: Boogie Preprocessor took 49.03 ms. Allocated memory is still 235.9 MB. Free memory was 160.8 MB in the beginning and 156.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:11:18,136 INFO L168 Benchmark]: RCFGBuilder took 723.00 ms. Allocated memory is still 235.9 MB. Free memory was 156.6 MB in the beginning and 105.1 MB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:11:18,137 INFO L168 Benchmark]: TraceAbstraction took 66385.85 ms. Allocated memory was 235.9 MB in the beginning and 583.5 MB in the end (delta: 347.6 MB). Free memory was 105.1 MB in the beginning and 134.4 MB in the end (delta: -29.2 MB). Peak memory consumption was 318.4 MB. Max. memory is 7.1 GB. [2020-10-21 23:11:18,138 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.23 ms. Allocated memory is still 147.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1342.24 ms. Allocated memory was 147.8 MB in the beginning and 235.9 MB in the end (delta: 88.1 MB). Free memory was 99.1 MB in the beginning and 163.6 MB in the end (delta: -64.4 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 117.79 ms. Allocated memory is still 235.9 MB. Free memory was 163.6 MB in the beginning and 160.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.03 ms. Allocated memory is still 235.9 MB. Free memory was 160.8 MB in the beginning and 156.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 723.00 ms. Allocated memory is still 235.9 MB. Free memory was 156.6 MB in the beginning and 105.1 MB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66385.85 ms. Allocated memory was 235.9 MB in the beginning and 583.5 MB in the end (delta: 347.6 MB). Free memory was 105.1 MB in the beginning and 134.4 MB in the end (delta: -29.2 MB). Peak memory consumption was 318.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1911 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 79 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.3s, 179 PlacesBefore, 41 PlacesAfterwards, 189 TransitionsBefore, 40 TransitionsAfterwards, 3444 CoEnabledTransitionPairs, 8 FixpointIterations, 116 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 27 ConcurrentYvCompositions, 11 ChoiceCompositions, 237 TotalNumberOfCompositions, 7933 MoverChecksTotal - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: 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, 158 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 66.2s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.4s, HoareTripleCheckerStatistics: 1035 SDtfs, 1801 SDslu, 4544 SDs, 0 SdLazy, 11406 SolverSat, 879 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 27 SyntacticMatches, 69 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 33.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred 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.3s AutomataMinimizationTime, 42 MinimizatonAttempts, 758 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 857 NumberOfCodeBlocks, 857 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 383250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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...