/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-770125f [2021-05-21 21:52:19,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-21 21:52:19,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-21 21:52:19,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-21 21:52:19,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-21 21:52:19,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-21 21:52:19,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-21 21:52:19,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-21 21:52:19,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-21 21:52:19,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-21 21:52:19,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-21 21:52:19,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-21 21:52:19,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-21 21:52:19,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-21 21:52:19,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-21 21:52:19,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-21 21:52:19,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-21 21:52:19,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-21 21:52:19,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-21 21:52:19,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-21 21:52:19,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-21 21:52:19,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-21 21:52:19,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-21 21:52:19,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-21 21:52:19,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-21 21:52:19,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-21 21:52:19,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-21 21:52:19,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-21 21:52:19,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-21 21:52:19,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-21 21:52:19,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-21 21:52:19,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-21 21:52:19,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-21 21:52:19,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-21 21:52:19,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-21 21:52:19,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-21 21:52:19,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-21 21:52:19,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-21 21:52:19,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-21 21:52:19,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-21 21:52:19,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-21 21:52:19,168 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-05-21 21:52:19,197 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-21 21:52:19,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-21 21:52:19,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-05-21 21:52:19,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-05-21 21:52:19,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-21 21:52:19,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-21 21:52:19,200 INFO L138 SettingsManager]: * Use SBE=true [2021-05-21 21:52:19,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-21 21:52:19,200 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-21 21:52:19,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-21 21:52:19,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-21 21:52:19,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-21 21:52:19,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-21 21:52:19,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-21 21:52:19,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-21 21:52:19,201 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-21 21:52:19,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-21 21:52:19,201 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-21 21:52:19,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-21 21:52:19,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-21 21:52:19,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-21 21:52:19,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-21 21:52:19,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-21 21:52:19,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-21 21:52:19,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-21 21:52:19,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-21 21:52:19,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-21 21:52:19,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-21 21:52:19,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-21 21:52:19,202 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-05-21 21:52:19,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-21 21:52:19,202 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-05-21 21:52:19,203 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-05-21 21:52:19,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-21 21:52:19,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-21 21:52:19,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-21 21:52:19,460 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-21 21:52:19,461 INFO L275 PluginConnector]: CDTParser initialized [2021-05-21 21:52:19,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2021-05-21 21:52:19,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e41280cc/39f4c862f8954f908654d4a5c43572d5/FLAG566ccc90a [2021-05-21 21:52:19,927 INFO L306 CDTParser]: Found 1 translation units. [2021-05-21 21:52:19,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2021-05-21 21:52:19,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e41280cc/39f4c862f8954f908654d4a5c43572d5/FLAG566ccc90a [2021-05-21 21:52:19,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e41280cc/39f4c862f8954f908654d4a5c43572d5 [2021-05-21 21:52:19,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-21 21:52:19,959 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-21 21:52:19,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-21 21:52:19,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-21 21:52:19,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-21 21:52:19,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.05 09:52:19" (1/1) ... [2021-05-21 21:52:19,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3a66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:19, skipping insertion in model container [2021-05-21 21:52:19,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.05 09:52:19" (1/1) ... [2021-05-21 21:52:19,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-21 21:52:20,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-21 21:52:20,204 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-05-21 21:52:20,391 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2021-05-21 21:52:20,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-21 21:52:20,418 INFO L203 MainTranslator]: Completed pre-run [2021-05-21 21:52:20,441 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-05-21 21:52:20,451 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2021-05-21 21:52:20,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-21 21:52:20,569 INFO L208 MainTranslator]: Completed translation [2021-05-21 21:52:20,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:20 WrapperNode [2021-05-21 21:52:20,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-21 21:52:20,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-05-21 21:52:20,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-05-21 21:52:20,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-05-21 21:52:20,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:20" (1/1) ... [2021-05-21 21:52:20,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:20" (1/1) ... [2021-05-21 21:52:20,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-05-21 21:52:20,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-21 21:52:20,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-21 21:52:20,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-21 21:52:20,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:20" (1/1) ... [2021-05-21 21:52:20,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:20" (1/1) ... [2021-05-21 21:52:20,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:20" (1/1) ... [2021-05-21 21:52:20,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:20" (1/1) ... [2021-05-21 21:52:20,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:20" (1/1) ... [2021-05-21 21:52:20,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:20" (1/1) ... [2021-05-21 21:52:20,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:20" (1/1) ... [2021-05-21 21:52:20,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-21 21:52:20,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-21 21:52:20,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-21 21:52:20,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-21 21:52:20,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:20" (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 [2021-05-21 21:52:20,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-05-21 21:52:20,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-21 21:52:20,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-21 21:52:20,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-05-21 21:52:20,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-21 21:52:20,680 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-05-21 21:52:20,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-05-21 21:52:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-05-21 21:52:20,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-05-21 21:52:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-05-21 21:52:20,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-05-21 21:52:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-05-21 21:52:20,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-05-21 21:52:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-21 21:52:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-05-21 21:52:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-21 21:52:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-21 21:52:20,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-21 21:52:20,682 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-05-21 21:52:21,056 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-21 21:52:21,056 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-05-21 21:52:21,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 09:52:21 BoogieIcfgContainer [2021-05-21 21:52:21,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-21 21:52:21,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-21 21:52:21,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-21 21:52:21,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-21 21:52:21,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.05 09:52:19" (1/3) ... [2021-05-21 21:52:21,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e58cd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 09:52:21, skipping insertion in model container [2021-05-21 21:52:21,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 09:52:20" (2/3) ... [2021-05-21 21:52:21,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e58cd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 09:52:21, skipping insertion in model container [2021-05-21 21:52:21,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 09:52:21" (3/3) ... [2021-05-21 21:52:21,064 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2021-05-21 21:52:21,068 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-05-21 21:52:21,068 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-21 21:52:21,068 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-05-21 21:52:21,068 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-05-21 21:52:21,104 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,105 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,105 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,105 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,105 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,105 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,105 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,106 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,106 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,107 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,107 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,107 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,107 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,107 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,107 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,107 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,108 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,108 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,108 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,108 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,109 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,109 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,109 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,109 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,109 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,109 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,109 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,109 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,109 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,110 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,110 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,110 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,110 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,110 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,110 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,110 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,110 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,110 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,111 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,111 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,111 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,111 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,111 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,112 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,112 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,112 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,112 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,112 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,112 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,112 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,114 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,114 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,114 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,114 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,114 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,115 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,115 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,115 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,115 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,115 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,115 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,115 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,116 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,116 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,116 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,116 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,116 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,116 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,116 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,117 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,118 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,118 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,120 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,120 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,121 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,121 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,125 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,125 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,125 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,125 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,125 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,125 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,126 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,126 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,127 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,128 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,128 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,128 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,128 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,128 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,128 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,128 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,128 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,128 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,128 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,128 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,129 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,129 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,129 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,129 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,130 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,130 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,130 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,130 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,130 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,130 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,130 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,130 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,130 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,130 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,131 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,132 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,132 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,132 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,132 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,132 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,132 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,132 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,132 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,132 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,132 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,133 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,133 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,133 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,133 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,133 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,133 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,133 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,133 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,134 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,134 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,134 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,134 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,134 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,134 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,134 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,134 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,134 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,134 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,134 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,134 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,135 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,135 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,135 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,135 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,135 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,135 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,135 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,135 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,136 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,136 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,136 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,136 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,136 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,136 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,136 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,136 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,136 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,136 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,136 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,137 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,137 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,137 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,137 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,137 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,137 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,137 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,137 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,137 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,137 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,137 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,137 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,138 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,138 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,138 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,138 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,138 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,138 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,138 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,138 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,139 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,139 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,139 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,139 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,139 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,139 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,140 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,142 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,142 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,142 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,142 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,143 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,143 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,143 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,143 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,143 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,143 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,148 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,148 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,148 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,149 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,149 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,149 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,150 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,153 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,153 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,153 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,154 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,155 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,155 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,155 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,155 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,158 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,158 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,158 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,158 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,158 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,158 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,161 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,166 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,166 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,167 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,167 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,168 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,168 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,169 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,169 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,169 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,169 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,170 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,170 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,170 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,170 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,171 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,171 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,171 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,172 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,174 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,174 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,174 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,174 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,175 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,175 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,175 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,175 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 21:52:21,320 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-05-21 21:52:21,334 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-21 21:52:21,352 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 21:52:21,352 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 21:52:21,352 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 21:52:21,352 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 21:52:21,352 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 21:52:21,352 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 21:52:21,352 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 21:52:21,352 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 21:52:21,365 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 197 places, 278 transitions, 936 flow [2021-05-21 21:52:26,720 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-21 21:52:26,812 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:52:26,813 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:52:26,813 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:52:26,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:52:26,816 INFO L82 PathProgramCache]: Analyzing trace with hash -811265628, now seen corresponding path program 1 times [2021-05-21 21:52:26,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:52:26,821 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066387544] [2021-05-21 21:52:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:52:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:52:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:52:27,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:52:27,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066387544] [2021-05-21 21:52:27,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066387544] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:52:27,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:52:27,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-21 21:52:27,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568632374] [2021-05-21 21:52:27,349 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-21 21:52:27,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:52:27,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-21 21:52:27,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-05-21 21:52:27,440 INFO L87 Difference]: Start difference. First operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:52:29,045 INFO L93 Difference]: Finished difference Result 76010 states and 329094 transitions. [2021-05-21 21:52:29,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-21 21:52:29,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-05-21 21:52:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:52:29,573 INFO L225 Difference]: With dead ends: 76010 [2021-05-21 21:52:29,573 INFO L226 Difference]: Without dead ends: 54772 [2021-05-21 21:52:29,574 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 319.6ms TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2021-05-21 21:52:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54772 states. [2021-05-21 21:52:31,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54772 to 46283. [2021-05-21 21:52:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46283 states, 46280 states have (on average 4.362337942955921) internal successors, (201889), 46282 states have internal predecessors, (201889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46283 states to 46283 states and 201889 transitions. [2021-05-21 21:52:31,326 INFO L78 Accepts]: Start accepts. Automaton has 46283 states and 201889 transitions. Word has length 41 [2021-05-21 21:52:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:52:31,327 INFO L482 AbstractCegarLoop]: Abstraction has 46283 states and 201889 transitions. [2021-05-21 21:52:31,327 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 46283 states and 201889 transitions. [2021-05-21 21:52:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-21 21:52:31,328 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:52:31,329 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:52:31,329 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-21 21:52:31,329 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:52:31,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:52:31,329 INFO L82 PathProgramCache]: Analyzing trace with hash -589683484, now seen corresponding path program 2 times [2021-05-21 21:52:31,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:52:31,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438738618] [2021-05-21 21:52:31,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:52:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:52:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:52:31,578 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:52:31,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438738618] [2021-05-21 21:52:31,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438738618] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:52:31,579 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:52:31,579 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-21 21:52:31,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685314556] [2021-05-21 21:52:31,582 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-21 21:52:31,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:52:31,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-21 21:52:31,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-05-21 21:52:31,584 INFO L87 Difference]: Start difference. First operand 46283 states and 201889 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:31,925 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-05-21 21:52:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:52:32,778 INFO L93 Difference]: Finished difference Result 54799 states and 241924 transitions. [2021-05-21 21:52:32,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-21 21:52:32,778 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-05-21 21:52:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:52:33,069 INFO L225 Difference]: With dead ends: 54799 [2021-05-21 21:52:33,070 INFO L226 Difference]: Without dead ends: 54799 [2021-05-21 21:52:33,070 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 501.7ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-05-21 21:52:33,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54799 states. [2021-05-21 21:52:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54799 to 46286. [2021-05-21 21:52:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46286 states, 46283 states have (on average 4.362120000864248) internal successors, (201892), 46285 states have internal predecessors, (201892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46286 states to 46286 states and 201892 transitions. [2021-05-21 21:52:34,641 INFO L78 Accepts]: Start accepts. Automaton has 46286 states and 201892 transitions. Word has length 41 [2021-05-21 21:52:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:52:34,641 INFO L482 AbstractCegarLoop]: Abstraction has 46286 states and 201892 transitions. [2021-05-21 21:52:34,642 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 46286 states and 201892 transitions. [2021-05-21 21:52:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-21 21:52:34,644 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:52:34,644 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:52:34,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-21 21:52:34,645 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:52:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:52:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash 325896192, now seen corresponding path program 3 times [2021-05-21 21:52:34,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:52:34,646 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551708605] [2021-05-21 21:52:34,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:52:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:52:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:52:34,859 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:52:34,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551708605] [2021-05-21 21:52:34,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551708605] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:52:34,859 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:52:34,859 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-21 21:52:34,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285669520] [2021-05-21 21:52:34,860 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-21 21:52:34,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:52:34,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-21 21:52:34,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-05-21 21:52:34,860 INFO L87 Difference]: Start difference. First operand 46286 states and 201892 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:52:35,622 INFO L93 Difference]: Finished difference Result 54743 states and 241824 transitions. [2021-05-21 21:52:35,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-21 21:52:35,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-05-21 21:52:35,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:52:35,790 INFO L225 Difference]: With dead ends: 54743 [2021-05-21 21:52:35,790 INFO L226 Difference]: Without dead ends: 54743 [2021-05-21 21:52:35,790 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 180.9ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-05-21 21:52:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54743 states. [2021-05-21 21:52:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54743 to 46227. [2021-05-21 21:52:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46227 states, 46225 states have (on average 4.365365062195782) internal successors, (201789), 46226 states have internal predecessors, (201789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46227 states to 46227 states and 201789 transitions. [2021-05-21 21:52:37,206 INFO L78 Accepts]: Start accepts. Automaton has 46227 states and 201789 transitions. Word has length 41 [2021-05-21 21:52:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:52:37,207 INFO L482 AbstractCegarLoop]: Abstraction has 46227 states and 201789 transitions. [2021-05-21 21:52:37,207 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 46227 states and 201789 transitions. [2021-05-21 21:52:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-05-21 21:52:37,209 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:52:37,209 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:52:37,209 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-21 21:52:37,209 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:52:37,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:52:37,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2119961237, now seen corresponding path program 1 times [2021-05-21 21:52:37,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:52:37,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108398673] [2021-05-21 21:52:37,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:52:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:52:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:52:37,267 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:52:37,267 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108398673] [2021-05-21 21:52:37,267 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108398673] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:52:37,267 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:52:37,267 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 21:52:37,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822778338] [2021-05-21 21:52:37,268 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 21:52:37,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:52:37,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 21:52:37,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-21 21:52:37,268 INFO L87 Difference]: Start difference. First operand 46227 states and 201789 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:52:38,108 INFO L93 Difference]: Finished difference Result 96773 states and 411557 transitions. [2021-05-21 21:52:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-21 21:52:38,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-05-21 21:52:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:52:38,291 INFO L225 Difference]: With dead ends: 96773 [2021-05-21 21:52:38,291 INFO L226 Difference]: Without dead ends: 61407 [2021-05-21 21:52:38,292 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 39.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-21 21:52:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61407 states. [2021-05-21 21:52:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61407 to 49089. [2021-05-21 21:52:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49089 states, 49087 states have (on average 4.207203536577913) internal successors, (206519), 49088 states have internal predecessors, (206519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49089 states to 49089 states and 206519 transitions. [2021-05-21 21:52:39,976 INFO L78 Accepts]: Start accepts. Automaton has 49089 states and 206519 transitions. Word has length 54 [2021-05-21 21:52:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:52:39,976 INFO L482 AbstractCegarLoop]: Abstraction has 49089 states and 206519 transitions. [2021-05-21 21:52:39,976 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 49089 states and 206519 transitions. [2021-05-21 21:52:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-21 21:52:39,983 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:52:39,983 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:52:39,983 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-21 21:52:39,984 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:52:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:52:39,984 INFO L82 PathProgramCache]: Analyzing trace with hash 319566966, now seen corresponding path program 1 times [2021-05-21 21:52:39,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:52:39,984 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521444135] [2021-05-21 21:52:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:52:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:52:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:52:40,105 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:52:40,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521444135] [2021-05-21 21:52:40,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521444135] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:52:40,106 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:52:40,106 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-21 21:52:40,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139472863] [2021-05-21 21:52:40,106 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-21 21:52:40,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:52:40,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-21 21:52:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-05-21 21:52:40,107 INFO L87 Difference]: Start difference. First operand 49089 states and 206519 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:52:40,983 INFO L93 Difference]: Finished difference Result 67425 states and 276590 transitions. [2021-05-21 21:52:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-21 21:52:40,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-05-21 21:52:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:52:41,172 INFO L225 Difference]: With dead ends: 67425 [2021-05-21 21:52:41,172 INFO L226 Difference]: Without dead ends: 61341 [2021-05-21 21:52:41,173 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 121.8ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-05-21 21:52:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61341 states. [2021-05-21 21:52:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61341 to 48869. [2021-05-21 21:52:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48869 states, 48867 states have (on average 4.211697055272475) internal successors, (205813), 48868 states have internal predecessors, (205813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48869 states to 48869 states and 205813 transitions. [2021-05-21 21:52:42,467 INFO L78 Accepts]: Start accepts. Automaton has 48869 states and 205813 transitions. Word has length 59 [2021-05-21 21:52:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:52:42,467 INFO L482 AbstractCegarLoop]: Abstraction has 48869 states and 205813 transitions. [2021-05-21 21:52:42,467 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 48869 states and 205813 transitions. [2021-05-21 21:52:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-21 21:52:42,474 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:52:42,474 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:52:42,475 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-21 21:52:42,475 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:52:42,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:52:42,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1864004856, now seen corresponding path program 1 times [2021-05-21 21:52:42,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:52:42,475 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721479896] [2021-05-21 21:52:42,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:52:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:52:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:52:42,914 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:52:42,914 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721479896] [2021-05-21 21:52:42,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721479896] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:52:42,914 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:52:42,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-21 21:52:42,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201903034] [2021-05-21 21:52:42,915 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-21 21:52:42,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:52:42,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-21 21:52:42,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-05-21 21:52:42,916 INFO L87 Difference]: Start difference. First operand 48869 states and 205813 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:52:44,622 INFO L93 Difference]: Finished difference Result 57826 states and 244284 transitions. [2021-05-21 21:52:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-21 21:52:44,622 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-05-21 21:52:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:52:44,775 INFO L225 Difference]: With dead ends: 57826 [2021-05-21 21:52:44,776 INFO L226 Difference]: Without dead ends: 57556 [2021-05-21 21:52:44,776 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 819.0ms TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2021-05-21 21:52:44,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57556 states. [2021-05-21 21:52:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57556 to 54249. [2021-05-21 21:52:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54249 states, 54247 states have (on average 4.2520139362545395) internal successors, (230659), 54248 states have internal predecessors, (230659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54249 states to 54249 states and 230659 transitions. [2021-05-21 21:52:46,431 INFO L78 Accepts]: Start accepts. Automaton has 54249 states and 230659 transitions. Word has length 60 [2021-05-21 21:52:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:52:46,432 INFO L482 AbstractCegarLoop]: Abstraction has 54249 states and 230659 transitions. [2021-05-21 21:52:46,432 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 54249 states and 230659 transitions. [2021-05-21 21:52:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-21 21:52:46,441 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:52:46,441 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:52:46,441 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-21 21:52:46,442 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:52:46,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:52:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1211952212, now seen corresponding path program 2 times [2021-05-21 21:52:46,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:52:46,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78765996] [2021-05-21 21:52:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:52:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:52:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:52:46,795 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:52:46,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78765996] [2021-05-21 21:52:46,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78765996] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:52:46,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:52:46,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-21 21:52:46,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782726953] [2021-05-21 21:52:46,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-21 21:52:46,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:52:46,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-21 21:52:46,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-05-21 21:52:46,796 INFO L87 Difference]: Start difference. First operand 54249 states and 230659 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:52:48,439 INFO L93 Difference]: Finished difference Result 63300 states and 269393 transitions. [2021-05-21 21:52:48,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-21 21:52:48,440 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-05-21 21:52:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:52:48,629 INFO L225 Difference]: With dead ends: 63300 [2021-05-21 21:52:48,629 INFO L226 Difference]: Without dead ends: 63030 [2021-05-21 21:52:48,629 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 609.7ms TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2021-05-21 21:52:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63030 states. [2021-05-21 21:52:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63030 to 54264. [2021-05-21 21:52:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54264 states, 54262 states have (on average 4.2514466846043275) internal successors, (230692), 54263 states have internal predecessors, (230692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54264 states to 54264 states and 230692 transitions. [2021-05-21 21:52:49,989 INFO L78 Accepts]: Start accepts. Automaton has 54264 states and 230692 transitions. Word has length 60 [2021-05-21 21:52:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:52:49,990 INFO L482 AbstractCegarLoop]: Abstraction has 54264 states and 230692 transitions. [2021-05-21 21:52:49,990 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 54264 states and 230692 transitions. [2021-05-21 21:52:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-21 21:52:49,997 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:52:49,997 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:52:49,998 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-21 21:52:49,998 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:52:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:52:49,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1520073798, now seen corresponding path program 3 times [2021-05-21 21:52:49,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:52:49,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542102958] [2021-05-21 21:52:49,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:52:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:52:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:52:50,279 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:52:50,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542102958] [2021-05-21 21:52:50,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542102958] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:52:50,279 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:52:50,279 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-21 21:52:50,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193544695] [2021-05-21 21:52:50,279 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-21 21:52:50,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:52:50,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-21 21:52:50,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-05-21 21:52:50,280 INFO L87 Difference]: Start difference. First operand 54264 states and 230692 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:52:51,615 INFO L93 Difference]: Finished difference Result 63260 states and 269245 transitions. [2021-05-21 21:52:51,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 21:52:51,615 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-05-21 21:52:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:52:51,799 INFO L225 Difference]: With dead ends: 63260 [2021-05-21 21:52:51,800 INFO L226 Difference]: Without dead ends: 62990 [2021-05-21 21:52:51,800 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 448.4ms TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2021-05-21 21:52:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62990 states. [2021-05-21 21:52:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62990 to 54281. [2021-05-21 21:52:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54281 states, 54279 states have (on average 4.250759962416404) internal successors, (230727), 54280 states have internal predecessors, (230727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54281 states to 54281 states and 230727 transitions. [2021-05-21 21:52:53,722 INFO L78 Accepts]: Start accepts. Automaton has 54281 states and 230727 transitions. Word has length 60 [2021-05-21 21:52:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:52:53,722 INFO L482 AbstractCegarLoop]: Abstraction has 54281 states and 230727 transitions. [2021-05-21 21:52:53,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 54281 states and 230727 transitions. [2021-05-21 21:52:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-21 21:52:53,730 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:52:53,730 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:52:53,730 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-21 21:52:53,730 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:52:53,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:52:53,731 INFO L82 PathProgramCache]: Analyzing trace with hash -181639794, now seen corresponding path program 4 times [2021-05-21 21:52:53,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:52:53,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494050350] [2021-05-21 21:52:53,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:52:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:52:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:52:54,012 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:52:54,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494050350] [2021-05-21 21:52:54,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494050350] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:52:54,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:52:54,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-21 21:52:54,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368814066] [2021-05-21 21:52:54,013 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-21 21:52:54,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:52:54,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-21 21:52:54,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-05-21 21:52:54,014 INFO L87 Difference]: Start difference. First operand 54281 states and 230727 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:54,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:52:54,875 INFO L93 Difference]: Finished difference Result 63305 states and 269323 transitions. [2021-05-21 21:52:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-21 21:52:54,875 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-05-21 21:52:54,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:52:55,047 INFO L225 Difference]: With dead ends: 63305 [2021-05-21 21:52:55,047 INFO L226 Difference]: Without dead ends: 63035 [2021-05-21 21:52:55,048 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 378.7ms TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-05-21 21:52:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63035 states. [2021-05-21 21:52:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63035 to 54310. [2021-05-21 21:52:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54310 states, 54308 states have (on average 4.249318700743905) internal successors, (230772), 54309 states have internal predecessors, (230772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54310 states to 54310 states and 230772 transitions. [2021-05-21 21:52:56,719 INFO L78 Accepts]: Start accepts. Automaton has 54310 states and 230772 transitions. Word has length 60 [2021-05-21 21:52:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:52:56,720 INFO L482 AbstractCegarLoop]: Abstraction has 54310 states and 230772 transitions. [2021-05-21 21:52:56,720 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 54310 states and 230772 transitions. [2021-05-21 21:52:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-21 21:52:56,727 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:52:56,727 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:52:56,727 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-21 21:52:56,727 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:52:56,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:52:56,728 INFO L82 PathProgramCache]: Analyzing trace with hash -994232682, now seen corresponding path program 5 times [2021-05-21 21:52:56,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:52:56,728 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106238395] [2021-05-21 21:52:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:52:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:52:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:52:56,923 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:52:56,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106238395] [2021-05-21 21:52:56,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106238395] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:52:56,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:52:56,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-21 21:52:56,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696054611] [2021-05-21 21:52:56,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-21 21:52:56,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:52:56,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-21 21:52:56,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-05-21 21:52:56,925 INFO L87 Difference]: Start difference. First operand 54310 states and 230772 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:52:57,532 INFO L93 Difference]: Finished difference Result 63086 states and 268677 transitions. [2021-05-21 21:52:57,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-21 21:52:57,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-05-21 21:52:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:52:58,062 INFO L225 Difference]: With dead ends: 63086 [2021-05-21 21:52:58,062 INFO L226 Difference]: Without dead ends: 62816 [2021-05-21 21:52:58,063 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 213.7ms TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-05-21 21:52:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62816 states. [2021-05-21 21:52:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62816 to 54062. [2021-05-21 21:52:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54062 states, 54060 states have (on average 4.256030336662967) internal successors, (230081), 54061 states have internal predecessors, (230081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54062 states to 54062 states and 230081 transitions. [2021-05-21 21:52:59,502 INFO L78 Accepts]: Start accepts. Automaton has 54062 states and 230081 transitions. Word has length 60 [2021-05-21 21:52:59,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:52:59,502 INFO L482 AbstractCegarLoop]: Abstraction has 54062 states and 230081 transitions. [2021-05-21 21:52:59,502 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:52:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 54062 states and 230081 transitions. [2021-05-21 21:52:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-21 21:52:59,513 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:52:59,513 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:52:59,513 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-21 21:52:59,513 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:52:59,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:52:59,514 INFO L82 PathProgramCache]: Analyzing trace with hash -114684342, now seen corresponding path program 1 times [2021-05-21 21:52:59,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:52:59,514 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135742872] [2021-05-21 21:52:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:52:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:52:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:52:59,933 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:52:59,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135742872] [2021-05-21 21:52:59,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135742872] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:52:59,933 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:52:59,933 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-21 21:52:59,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83254624] [2021-05-21 21:52:59,933 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-21 21:52:59,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:52:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-21 21:52:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-05-21 21:52:59,934 INFO L87 Difference]: Start difference. First operand 54062 states and 230081 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:01,560 INFO L93 Difference]: Finished difference Result 65701 states and 278957 transitions. [2021-05-21 21:53:01,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-21 21:53:01,560 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-05-21 21:53:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:01,738 INFO L225 Difference]: With dead ends: 65701 [2021-05-21 21:53:01,738 INFO L226 Difference]: Without dead ends: 65359 [2021-05-21 21:53:01,739 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 771.7ms TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 21:53:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65359 states. [2021-05-21 21:53:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65359 to 60588. [2021-05-21 21:53:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60588 states, 60586 states have (on average 4.283184233981448) internal successors, (259501), 60587 states have internal predecessors, (259501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60588 states to 60588 states and 259501 transitions. [2021-05-21 21:53:03,215 INFO L78 Accepts]: Start accepts. Automaton has 60588 states and 259501 transitions. Word has length 62 [2021-05-21 21:53:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:03,216 INFO L482 AbstractCegarLoop]: Abstraction has 60588 states and 259501 transitions. [2021-05-21 21:53:03,216 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:03,216 INFO L276 IsEmpty]: Start isEmpty. Operand 60588 states and 259501 transitions. [2021-05-21 21:53:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-21 21:53:03,229 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:03,229 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:03,229 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-21 21:53:03,229 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:03,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1301917267, now seen corresponding path program 1 times [2021-05-21 21:53:03,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:03,230 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483586847] [2021-05-21 21:53:03,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:04,149 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:04,149 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483586847] [2021-05-21 21:53:04,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483586847] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:04,150 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:04,150 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-21 21:53:04,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362105162] [2021-05-21 21:53:04,150 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-21 21:53:04,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:04,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-21 21:53:04,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-05-21 21:53:04,151 INFO L87 Difference]: Start difference. First operand 60588 states and 259501 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:05,656 INFO L93 Difference]: Finished difference Result 71101 states and 302938 transitions. [2021-05-21 21:53:05,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-21 21:53:05,657 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-05-21 21:53:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:06,178 INFO L225 Difference]: With dead ends: 71101 [2021-05-21 21:53:06,178 INFO L226 Difference]: Without dead ends: 70759 [2021-05-21 21:53:06,179 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 943.0ms TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2021-05-21 21:53:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70759 states. [2021-05-21 21:53:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70759 to 60588. [2021-05-21 21:53:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60588 states, 60586 states have (on average 4.283184233981448) internal successors, (259501), 60587 states have internal predecessors, (259501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60588 states to 60588 states and 259501 transitions. [2021-05-21 21:53:07,596 INFO L78 Accepts]: Start accepts. Automaton has 60588 states and 259501 transitions. Word has length 62 [2021-05-21 21:53:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:07,596 INFO L482 AbstractCegarLoop]: Abstraction has 60588 states and 259501 transitions. [2021-05-21 21:53:07,596 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 60588 states and 259501 transitions. [2021-05-21 21:53:07,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-21 21:53:07,609 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:07,609 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:07,609 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-21 21:53:07,609 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:07,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:07,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1765911259, now seen corresponding path program 2 times [2021-05-21 21:53:07,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:07,610 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443961617] [2021-05-21 21:53:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:07,956 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:07,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443961617] [2021-05-21 21:53:07,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443961617] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:07,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:07,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 21:53:07,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405418532] [2021-05-21 21:53:07,957 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 21:53:07,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:07,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 21:53:07,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-05-21 21:53:07,958 INFO L87 Difference]: Start difference. First operand 60588 states and 259501 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:09,530 INFO L93 Difference]: Finished difference Result 73658 states and 314685 transitions. [2021-05-21 21:53:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 21:53:09,530 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-05-21 21:53:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:09,729 INFO L225 Difference]: With dead ends: 73658 [2021-05-21 21:53:09,729 INFO L226 Difference]: Without dead ends: 73316 [2021-05-21 21:53:09,729 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 598.0ms TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2021-05-21 21:53:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73316 states. [2021-05-21 21:53:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73316 to 57618. [2021-05-21 21:53:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57618 states, 57616 states have (on average 4.267998472646487) internal successors, (245905), 57617 states have internal predecessors, (245905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57618 states to 57618 states and 245905 transitions. [2021-05-21 21:53:11,294 INFO L78 Accepts]: Start accepts. Automaton has 57618 states and 245905 transitions. Word has length 62 [2021-05-21 21:53:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:11,295 INFO L482 AbstractCegarLoop]: Abstraction has 57618 states and 245905 transitions. [2021-05-21 21:53:11,295 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 57618 states and 245905 transitions. [2021-05-21 21:53:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-21 21:53:11,307 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:11,307 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:11,307 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-21 21:53:11,308 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:11,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1261621970, now seen corresponding path program 2 times [2021-05-21 21:53:11,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:11,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264684358] [2021-05-21 21:53:11,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:11,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:11,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264684358] [2021-05-21 21:53:11,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264684358] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:11,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:11,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-21 21:53:11,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178800146] [2021-05-21 21:53:11,527 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-21 21:53:11,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:11,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-21 21:53:11,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-05-21 21:53:11,528 INFO L87 Difference]: Start difference. First operand 57618 states and 245905 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:12,853 INFO L93 Difference]: Finished difference Result 65384 states and 277429 transitions. [2021-05-21 21:53:12,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 21:53:12,854 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-05-21 21:53:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:13,029 INFO L225 Difference]: With dead ends: 65384 [2021-05-21 21:53:13,029 INFO L226 Difference]: Without dead ends: 65042 [2021-05-21 21:53:13,029 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 452.1ms TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-05-21 21:53:13,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65042 states. [2021-05-21 21:53:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65042 to 57621. [2021-05-21 21:53:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57621 states, 57619 states have (on average 4.267828320519273) internal successors, (245908), 57620 states have internal predecessors, (245908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57621 states to 57621 states and 245908 transitions. [2021-05-21 21:53:14,544 INFO L78 Accepts]: Start accepts. Automaton has 57621 states and 245908 transitions. Word has length 62 [2021-05-21 21:53:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:14,545 INFO L482 AbstractCegarLoop]: Abstraction has 57621 states and 245908 transitions. [2021-05-21 21:53:14,545 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 57621 states and 245908 transitions. [2021-05-21 21:53:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-21 21:53:14,890 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:14,890 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:14,890 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-21 21:53:14,890 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:14,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:14,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1971465376, now seen corresponding path program 3 times [2021-05-21 21:53:14,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:14,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240406944] [2021-05-21 21:53:14,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:15,163 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:15,163 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240406944] [2021-05-21 21:53:15,164 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240406944] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:15,164 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:15,164 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-21 21:53:15,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707086004] [2021-05-21 21:53:15,165 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-21 21:53:15,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:15,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-21 21:53:15,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-05-21 21:53:15,165 INFO L87 Difference]: Start difference. First operand 57621 states and 245908 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:15,930 INFO L93 Difference]: Finished difference Result 65409 states and 277466 transitions. [2021-05-21 21:53:15,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-21 21:53:15,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-05-21 21:53:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:16,110 INFO L225 Difference]: With dead ends: 65409 [2021-05-21 21:53:16,110 INFO L226 Difference]: Without dead ends: 65067 [2021-05-21 21:53:16,110 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 332.9ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-05-21 21:53:16,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65067 states. [2021-05-21 21:53:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65067 to 57649. [2021-05-21 21:53:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57649 states, 57647 states have (on average 4.266518639304734) internal successors, (245952), 57648 states have internal predecessors, (245952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57649 states to 57649 states and 245952 transitions. [2021-05-21 21:53:17,984 INFO L78 Accepts]: Start accepts. Automaton has 57649 states and 245952 transitions. Word has length 62 [2021-05-21 21:53:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:17,984 INFO L482 AbstractCegarLoop]: Abstraction has 57649 states and 245952 transitions. [2021-05-21 21:53:17,984 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 57649 states and 245952 transitions. [2021-05-21 21:53:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-21 21:53:18,014 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:18,014 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:18,014 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-21 21:53:18,014 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:18,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:18,015 INFO L82 PathProgramCache]: Analyzing trace with hash 116713492, now seen corresponding path program 4 times [2021-05-21 21:53:18,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:18,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92752165] [2021-05-21 21:53:18,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:18,209 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:18,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92752165] [2021-05-21 21:53:18,210 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92752165] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:18,210 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:18,210 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-21 21:53:18,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014891985] [2021-05-21 21:53:18,210 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-21 21:53:18,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:18,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-21 21:53:18,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-05-21 21:53:18,211 INFO L87 Difference]: Start difference. First operand 57649 states and 245952 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:18,746 INFO L93 Difference]: Finished difference Result 60948 states and 256662 transitions. [2021-05-21 21:53:18,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-21 21:53:18,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-05-21 21:53:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:18,910 INFO L225 Difference]: With dead ends: 60948 [2021-05-21 21:53:18,911 INFO L226 Difference]: Without dead ends: 60606 [2021-05-21 21:53:18,911 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 188.6ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-05-21 21:53:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60606 states. [2021-05-21 21:53:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60606 to 53160. [2021-05-21 21:53:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53160 states, 53158 states have (on average 4.234621317581549) internal successors, (225104), 53159 states have internal predecessors, (225104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53160 states to 53160 states and 225104 transitions. [2021-05-21 21:53:20,269 INFO L78 Accepts]: Start accepts. Automaton has 53160 states and 225104 transitions. Word has length 62 [2021-05-21 21:53:20,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:20,269 INFO L482 AbstractCegarLoop]: Abstraction has 53160 states and 225104 transitions. [2021-05-21 21:53:20,269 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 53160 states and 225104 transitions. [2021-05-21 21:53:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-21 21:53:20,285 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:20,285 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:20,285 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-21 21:53:20,285 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:20,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash -27681967, now seen corresponding path program 1 times [2021-05-21 21:53:20,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:20,285 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937641508] [2021-05-21 21:53:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:21,059 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:21,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937641508] [2021-05-21 21:53:21,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937641508] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:21,059 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:21,059 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-21 21:53:21,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313130201] [2021-05-21 21:53:21,061 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-21 21:53:21,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:21,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-21 21:53:21,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-05-21 21:53:21,061 INFO L87 Difference]: Start difference. First operand 53160 states and 225104 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:22,619 INFO L93 Difference]: Finished difference Result 64389 states and 274500 transitions. [2021-05-21 21:53:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-21 21:53:22,620 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-05-21 21:53:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:23,090 INFO L225 Difference]: With dead ends: 64389 [2021-05-21 21:53:23,091 INFO L226 Difference]: Without dead ends: 64119 [2021-05-21 21:53:23,091 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1223.2ms TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2021-05-21 21:53:23,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64119 states. [2021-05-21 21:53:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64119 to 54940. [2021-05-21 21:53:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54940 states, 54938 states have (on average 4.293439877680294) internal successors, (235873), 54939 states have internal predecessors, (235873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54940 states to 54940 states and 235873 transitions. [2021-05-21 21:53:24,496 INFO L78 Accepts]: Start accepts. Automaton has 54940 states and 235873 transitions. Word has length 65 [2021-05-21 21:53:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:24,497 INFO L482 AbstractCegarLoop]: Abstraction has 54940 states and 235873 transitions. [2021-05-21 21:53:24,497 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 54940 states and 235873 transitions. [2021-05-21 21:53:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-21 21:53:24,514 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:24,514 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:24,514 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-21 21:53:24,514 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:24,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:24,515 INFO L82 PathProgramCache]: Analyzing trace with hash 225742194, now seen corresponding path program 1 times [2021-05-21 21:53:24,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:24,515 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983541435] [2021-05-21 21:53:24,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:24,565 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:24,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983541435] [2021-05-21 21:53:24,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983541435] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:24,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:24,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-21 21:53:24,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85598725] [2021-05-21 21:53:24,566 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-21 21:53:24,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:24,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-21 21:53:24,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-05-21 21:53:24,566 INFO L87 Difference]: Start difference. First operand 54940 states and 235873 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:25,082 INFO L93 Difference]: Finished difference Result 74107 states and 309485 transitions. [2021-05-21 21:53:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-21 21:53:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-05-21 21:53:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:25,261 INFO L225 Difference]: With dead ends: 74107 [2021-05-21 21:53:25,262 INFO L226 Difference]: Without dead ends: 67995 [2021-05-21 21:53:25,262 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 110.5ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-05-21 21:53:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67995 states. [2021-05-21 21:53:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67995 to 55174. [2021-05-21 21:53:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55174 states, 55172 states have (on average 4.289802798520989) internal successors, (236677), 55173 states have internal predecessors, (236677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55174 states to 55174 states and 236677 transitions. [2021-05-21 21:53:27,512 INFO L78 Accepts]: Start accepts. Automaton has 55174 states and 236677 transitions. Word has length 65 [2021-05-21 21:53:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:27,512 INFO L482 AbstractCegarLoop]: Abstraction has 55174 states and 236677 transitions. [2021-05-21 21:53:27,512 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 55174 states and 236677 transitions. [2021-05-21 21:53:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-21 21:53:27,536 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:27,536 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:27,536 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-21 21:53:27,536 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:27,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:27,537 INFO L82 PathProgramCache]: Analyzing trace with hash -405027412, now seen corresponding path program 2 times [2021-05-21 21:53:27,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:27,537 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948290656] [2021-05-21 21:53:27,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:27,640 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:27,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948290656] [2021-05-21 21:53:27,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948290656] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:27,640 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:27,640 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-21 21:53:27,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626678993] [2021-05-21 21:53:27,641 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-21 21:53:27,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:27,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-21 21:53:27,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-05-21 21:53:27,642 INFO L87 Difference]: Start difference. First operand 55174 states and 236677 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:28,217 INFO L93 Difference]: Finished difference Result 72794 states and 304360 transitions. [2021-05-21 21:53:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-21 21:53:28,217 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-05-21 21:53:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:28,403 INFO L225 Difference]: With dead ends: 72794 [2021-05-21 21:53:28,403 INFO L226 Difference]: Without dead ends: 66814 [2021-05-21 21:53:28,403 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 173.3ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-05-21 21:53:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66814 states. [2021-05-21 21:53:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66814 to 54455. [2021-05-21 21:53:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54455 states, 54453 states have (on average 4.294363946889979) internal successors, (233841), 54454 states have internal predecessors, (233841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54455 states to 54455 states and 233841 transitions. [2021-05-21 21:53:30,227 INFO L78 Accepts]: Start accepts. Automaton has 54455 states and 233841 transitions. Word has length 65 [2021-05-21 21:53:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:30,228 INFO L482 AbstractCegarLoop]: Abstraction has 54455 states and 233841 transitions. [2021-05-21 21:53:30,228 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 54455 states and 233841 transitions. [2021-05-21 21:53:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-21 21:53:30,256 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:30,261 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:30,261 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-21 21:53:30,261 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:30,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:30,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1600315377, now seen corresponding path program 1 times [2021-05-21 21:53:30,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:30,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537864886] [2021-05-21 21:53:30,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:30,699 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:30,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537864886] [2021-05-21 21:53:30,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537864886] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:30,700 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:30,700 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-21 21:53:30,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516961110] [2021-05-21 21:53:30,700 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-21 21:53:30,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:30,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-21 21:53:30,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-05-21 21:53:30,701 INFO L87 Difference]: Start difference. First operand 54455 states and 233841 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:32,519 INFO L93 Difference]: Finished difference Result 60956 states and 259147 transitions. [2021-05-21 21:53:32,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-21 21:53:32,520 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-05-21 21:53:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:32,688 INFO L225 Difference]: With dead ends: 60956 [2021-05-21 21:53:32,688 INFO L226 Difference]: Without dead ends: 60614 [2021-05-21 21:53:32,688 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 882.0ms TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2021-05-21 21:53:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60614 states. [2021-05-21 21:53:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60614 to 49129. [2021-05-21 21:53:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49129 states, 49127 states have (on average 4.269749832067905) internal successors, (209760), 49128 states have internal predecessors, (209760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49129 states to 49129 states and 209760 transitions. [2021-05-21 21:53:33,977 INFO L78 Accepts]: Start accepts. Automaton has 49129 states and 209760 transitions. Word has length 67 [2021-05-21 21:53:33,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:33,977 INFO L482 AbstractCegarLoop]: Abstraction has 49129 states and 209760 transitions. [2021-05-21 21:53:33,977 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand 49129 states and 209760 transitions. [2021-05-21 21:53:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 21:53:34,004 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:34,004 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:34,004 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-21 21:53:34,004 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:34,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:34,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1860189259, now seen corresponding path program 1 times [2021-05-21 21:53:34,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:34,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669831751] [2021-05-21 21:53:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:34,470 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:34,470 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669831751] [2021-05-21 21:53:34,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669831751] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:34,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:34,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 21:53:34,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876570114] [2021-05-21 21:53:34,470 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 21:53:34,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:34,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 21:53:34,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2021-05-21 21:53:34,471 INFO L87 Difference]: Start difference. First operand 49129 states and 209760 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:36,316 INFO L93 Difference]: Finished difference Result 55018 states and 232303 transitions. [2021-05-21 21:53:36,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-21 21:53:36,317 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 21:53:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:36,470 INFO L225 Difference]: With dead ends: 55018 [2021-05-21 21:53:36,470 INFO L226 Difference]: Without dead ends: 53779 [2021-05-21 21:53:36,470 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 942.0ms TimeCoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2021-05-21 21:53:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53779 states. [2021-05-21 21:53:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53779 to 51011. [2021-05-21 21:53:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51011 states, 51009 states have (on average 4.255660765747221) internal successors, (217077), 51010 states have internal predecessors, (217077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51011 states to 51011 states and 217077 transitions. [2021-05-21 21:53:37,741 INFO L78 Accepts]: Start accepts. Automaton has 51011 states and 217077 transitions. Word has length 68 [2021-05-21 21:53:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:37,742 INFO L482 AbstractCegarLoop]: Abstraction has 51011 states and 217077 transitions. [2021-05-21 21:53:37,742 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 51011 states and 217077 transitions. [2021-05-21 21:53:37,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 21:53:37,766 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:37,766 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:37,766 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-21 21:53:37,766 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:37,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:37,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1722827065, now seen corresponding path program 2 times [2021-05-21 21:53:37,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:37,767 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564476519] [2021-05-21 21:53:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:38,145 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:38,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564476519] [2021-05-21 21:53:38,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564476519] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:38,145 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:38,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-21 21:53:38,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233371718] [2021-05-21 21:53:38,145 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-21 21:53:38,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-21 21:53:38,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-05-21 21:53:38,146 INFO L87 Difference]: Start difference. First operand 51011 states and 217077 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:39,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:39,594 INFO L93 Difference]: Finished difference Result 57017 states and 239942 transitions. [2021-05-21 21:53:39,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-21 21:53:39,595 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 21:53:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:39,746 INFO L225 Difference]: With dead ends: 57017 [2021-05-21 21:53:39,747 INFO L226 Difference]: Without dead ends: 55733 [2021-05-21 21:53:39,747 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 731.0ms TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2021-05-21 21:53:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55733 states. [2021-05-21 21:53:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55733 to 51041. [2021-05-21 21:53:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51041 states, 51039 states have (on average 4.254511256098278) internal successors, (217146), 51040 states have internal predecessors, (217146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51041 states to 51041 states and 217146 transitions. [2021-05-21 21:53:40,999 INFO L78 Accepts]: Start accepts. Automaton has 51041 states and 217146 transitions. Word has length 68 [2021-05-21 21:53:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:40,999 INFO L482 AbstractCegarLoop]: Abstraction has 51041 states and 217146 transitions. [2021-05-21 21:53:40,999 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 51041 states and 217146 transitions. [2021-05-21 21:53:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 21:53:41,023 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:41,023 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:41,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-21 21:53:41,024 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:41,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1587679323, now seen corresponding path program 3 times [2021-05-21 21:53:41,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:41,024 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955224727] [2021-05-21 21:53:41,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:41,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:41,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955224727] [2021-05-21 21:53:41,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955224727] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:41,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:41,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 21:53:41,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942553489] [2021-05-21 21:53:41,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 21:53:41,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:41,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 21:53:41,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-05-21 21:53:41,347 INFO L87 Difference]: Start difference. First operand 51041 states and 217146 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:42,737 INFO L93 Difference]: Finished difference Result 57090 states and 240097 transitions. [2021-05-21 21:53:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-21 21:53:42,737 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 21:53:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:42,887 INFO L225 Difference]: With dead ends: 57090 [2021-05-21 21:53:42,888 INFO L226 Difference]: Without dead ends: 55761 [2021-05-21 21:53:42,888 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 612.6ms TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 21:53:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55761 states. [2021-05-21 21:53:43,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55761 to 51081. [2021-05-21 21:53:44,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51081 states, 51079 states have (on average 4.252882789404648) internal successors, (217233), 51080 states have internal predecessors, (217233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51081 states to 51081 states and 217233 transitions. [2021-05-21 21:53:44,196 INFO L78 Accepts]: Start accepts. Automaton has 51081 states and 217233 transitions. Word has length 68 [2021-05-21 21:53:44,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:44,196 INFO L482 AbstractCegarLoop]: Abstraction has 51081 states and 217233 transitions. [2021-05-21 21:53:44,196 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 51081 states and 217233 transitions. [2021-05-21 21:53:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 21:53:44,221 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:44,222 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:44,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-21 21:53:44,222 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:44,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1285672051, now seen corresponding path program 4 times [2021-05-21 21:53:44,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:44,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777942398] [2021-05-21 21:53:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:44,665 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:44,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777942398] [2021-05-21 21:53:44,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777942398] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:44,666 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:44,666 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 21:53:44,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606975592] [2021-05-21 21:53:44,666 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 21:53:44,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:44,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 21:53:44,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-05-21 21:53:44,666 INFO L87 Difference]: Start difference. First operand 51081 states and 217233 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:46,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:46,478 INFO L93 Difference]: Finished difference Result 57180 states and 240266 transitions. [2021-05-21 21:53:46,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-21 21:53:46,478 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 21:53:46,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:46,627 INFO L225 Difference]: With dead ends: 57180 [2021-05-21 21:53:46,627 INFO L226 Difference]: Without dead ends: 55851 [2021-05-21 21:53:46,628 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1155.5ms TimeCoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2021-05-21 21:53:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55851 states. [2021-05-21 21:53:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55851 to 51102. [2021-05-21 21:53:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51102 states, 51100 states have (on average 4.251859099804305) internal successors, (217270), 51101 states have internal predecessors, (217270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51102 states to 51102 states and 217270 transitions. [2021-05-21 21:53:47,862 INFO L78 Accepts]: Start accepts. Automaton has 51102 states and 217270 transitions. Word has length 68 [2021-05-21 21:53:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:47,862 INFO L482 AbstractCegarLoop]: Abstraction has 51102 states and 217270 transitions. [2021-05-21 21:53:47,862 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 51102 states and 217270 transitions. [2021-05-21 21:53:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 21:53:47,888 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:47,888 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:47,888 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-21 21:53:47,888 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:47,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:47,889 INFO L82 PathProgramCache]: Analyzing trace with hash -747687525, now seen corresponding path program 5 times [2021-05-21 21:53:47,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:47,889 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123925627] [2021-05-21 21:53:47,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:48,112 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:48,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123925627] [2021-05-21 21:53:48,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123925627] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:48,112 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:48,112 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-21 21:53:48,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651585794] [2021-05-21 21:53:48,112 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-21 21:53:48,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:48,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-21 21:53:48,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-05-21 21:53:48,113 INFO L87 Difference]: Start difference. First operand 51102 states and 217270 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:49,288 INFO L93 Difference]: Finished difference Result 57173 states and 240259 transitions. [2021-05-21 21:53:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-21 21:53:49,288 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 21:53:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:49,439 INFO L225 Difference]: With dead ends: 57173 [2021-05-21 21:53:49,439 INFO L226 Difference]: Without dead ends: 55844 [2021-05-21 21:53:49,440 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 373.9ms TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-05-21 21:53:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55844 states. [2021-05-21 21:53:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55844 to 51103. [2021-05-21 21:53:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51103 states, 51101 states have (on average 4.251795463885247) internal successors, (217271), 51102 states have internal predecessors, (217271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51103 states to 51103 states and 217271 transitions. [2021-05-21 21:53:50,744 INFO L78 Accepts]: Start accepts. Automaton has 51103 states and 217271 transitions. Word has length 68 [2021-05-21 21:53:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:50,744 INFO L482 AbstractCegarLoop]: Abstraction has 51103 states and 217271 transitions. [2021-05-21 21:53:50,744 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 51103 states and 217271 transitions. [2021-05-21 21:53:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 21:53:50,770 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:50,770 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:50,770 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-21 21:53:50,770 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:50,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:50,770 INFO L82 PathProgramCache]: Analyzing trace with hash 229412969, now seen corresponding path program 6 times [2021-05-21 21:53:50,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:50,771 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998152301] [2021-05-21 21:53:50,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:51,012 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:51,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998152301] [2021-05-21 21:53:51,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998152301] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:51,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:51,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-21 21:53:51,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111823725] [2021-05-21 21:53:51,012 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-21 21:53:51,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:51,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-21 21:53:51,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-05-21 21:53:51,013 INFO L87 Difference]: Start difference. First operand 51103 states and 217271 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:52,139 INFO L93 Difference]: Finished difference Result 57203 states and 240305 transitions. [2021-05-21 21:53:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-21 21:53:52,139 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 21:53:52,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:52,305 INFO L225 Difference]: With dead ends: 57203 [2021-05-21 21:53:52,306 INFO L226 Difference]: Without dead ends: 55874 [2021-05-21 21:53:52,306 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 363.4ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-05-21 21:53:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55874 states. [2021-05-21 21:53:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55874 to 51132. [2021-05-21 21:53:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51132 states, 51130 states have (on average 4.250264032857422) internal successors, (217316), 51131 states have internal predecessors, (217316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51132 states to 51132 states and 217316 transitions. [2021-05-21 21:53:53,718 INFO L78 Accepts]: Start accepts. Automaton has 51132 states and 217316 transitions. Word has length 68 [2021-05-21 21:53:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:53,718 INFO L482 AbstractCegarLoop]: Abstraction has 51132 states and 217316 transitions. [2021-05-21 21:53:53,718 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand 51132 states and 217316 transitions. [2021-05-21 21:53:53,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-21 21:53:53,745 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:53,745 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:53,745 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-21 21:53:53,745 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:53,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:53,745 INFO L82 PathProgramCache]: Analyzing trace with hash -838870671, now seen corresponding path program 7 times [2021-05-21 21:53:53,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:53,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615679350] [2021-05-21 21:53:53,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:53,945 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:53,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615679350] [2021-05-21 21:53:53,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615679350] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:53,945 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:53,945 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-21 21:53:53,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36645345] [2021-05-21 21:53:53,945 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-21 21:53:53,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-21 21:53:53,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-05-21 21:53:53,946 INFO L87 Difference]: Start difference. First operand 51132 states and 217316 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:54,493 INFO L93 Difference]: Finished difference Result 55837 states and 234184 transitions. [2021-05-21 21:53:54,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-21 21:53:54,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-05-21 21:53:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:54,642 INFO L225 Difference]: With dead ends: 55837 [2021-05-21 21:53:54,642 INFO L226 Difference]: Without dead ends: 54508 [2021-05-21 21:53:54,643 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 237.9ms TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-05-21 21:53:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54508 states. [2021-05-21 21:53:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54508 to 49737. [2021-05-21 21:53:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49737 states, 49735 states have (on average 4.245501156127475) internal successors, (211150), 49736 states have internal predecessors, (211150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49737 states to 49737 states and 211150 transitions. [2021-05-21 21:53:55,945 INFO L78 Accepts]: Start accepts. Automaton has 49737 states and 211150 transitions. Word has length 68 [2021-05-21 21:53:55,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:53:55,945 INFO L482 AbstractCegarLoop]: Abstraction has 49737 states and 211150 transitions. [2021-05-21 21:53:55,945 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 49737 states and 211150 transitions. [2021-05-21 21:53:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-21 21:53:55,976 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:53:55,976 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:53:55,976 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-21 21:53:55,976 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:53:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:53:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash 834173378, now seen corresponding path program 1 times [2021-05-21 21:53:55,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:53:55,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764765001] [2021-05-21 21:53:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:53:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:53:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:53:56,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:53:56,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764765001] [2021-05-21 21:53:56,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764765001] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:53:56,788 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:53:56,788 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 21:53:56,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871541610] [2021-05-21 21:53:56,789 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 21:53:56,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:53:56,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 21:53:56,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2021-05-21 21:53:56,789 INFO L87 Difference]: Start difference. First operand 49737 states and 211150 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:53:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:53:58,427 INFO L93 Difference]: Finished difference Result 57206 states and 239841 transitions. [2021-05-21 21:53:58,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-21 21:53:58,428 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-05-21 21:53:58,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:53:58,579 INFO L225 Difference]: With dead ends: 57206 [2021-05-21 21:53:58,580 INFO L226 Difference]: Without dead ends: 56084 [2021-05-21 21:53:58,580 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1301.5ms TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2021-05-21 21:53:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56084 states. [2021-05-21 21:53:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56084 to 49737. [2021-05-21 21:53:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49737 states, 49735 states have (on average 4.244596360711772) internal successors, (211105), 49736 states have internal predecessors, (211105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49737 states to 49737 states and 211105 transitions. [2021-05-21 21:54:00,078 INFO L78 Accepts]: Start accepts. Automaton has 49737 states and 211105 transitions. Word has length 70 [2021-05-21 21:54:00,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:00,079 INFO L482 AbstractCegarLoop]: Abstraction has 49737 states and 211105 transitions. [2021-05-21 21:54:00,079 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 49737 states and 211105 transitions. [2021-05-21 21:54:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-21 21:54:00,114 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:00,114 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:00,114 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-21 21:54:00,114 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:00,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:00,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1768735654, now seen corresponding path program 2 times [2021-05-21 21:54:00,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:00,115 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542715501] [2021-05-21 21:54:00,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:00,584 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:00,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542715501] [2021-05-21 21:54:00,584 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542715501] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:00,584 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:00,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-21 21:54:00,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688547976] [2021-05-21 21:54:00,585 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-21 21:54:00,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:00,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-21 21:54:00,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-05-21 21:54:00,585 INFO L87 Difference]: Start difference. First operand 49737 states and 211105 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:01,961 INFO L93 Difference]: Finished difference Result 56867 states and 238439 transitions. [2021-05-21 21:54:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-21 21:54:01,961 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-05-21 21:54:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:02,364 INFO L225 Difference]: With dead ends: 56867 [2021-05-21 21:54:02,364 INFO L226 Difference]: Without dead ends: 55700 [2021-05-21 21:54:02,364 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 797.3ms TimeCoverageRelationStatistics Valid=164, Invalid=1168, Unknown=0, NotChecked=0, Total=1332 [2021-05-21 21:54:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55700 states. [2021-05-21 21:54:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55700 to 49329. [2021-05-21 21:54:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49329 states, 49327 states have (on average 4.248768422973219) internal successors, (209579), 49328 states have internal predecessors, (209579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49329 states to 49329 states and 209579 transitions. [2021-05-21 21:54:03,639 INFO L78 Accepts]: Start accepts. Automaton has 49329 states and 209579 transitions. Word has length 70 [2021-05-21 21:54:03,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:03,639 INFO L482 AbstractCegarLoop]: Abstraction has 49329 states and 209579 transitions. [2021-05-21 21:54:03,639 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 49329 states and 209579 transitions. [2021-05-21 21:54:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-21 21:54:03,674 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:03,674 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:03,675 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-21 21:54:03,675 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:03,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:03,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1979887372, now seen corresponding path program 3 times [2021-05-21 21:54:03,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:03,675 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135175155] [2021-05-21 21:54:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:04,037 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:04,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135175155] [2021-05-21 21:54:04,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135175155] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:04,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:04,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-21 21:54:04,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063991500] [2021-05-21 21:54:04,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-21 21:54:04,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-21 21:54:04,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-05-21 21:54:04,038 INFO L87 Difference]: Start difference. First operand 49329 states and 209579 transitions. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:05,150 INFO L93 Difference]: Finished difference Result 53309 states and 223950 transitions. [2021-05-21 21:54:05,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-21 21:54:05,150 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-05-21 21:54:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:05,288 INFO L225 Difference]: With dead ends: 53309 [2021-05-21 21:54:05,288 INFO L226 Difference]: Without dead ends: 52526 [2021-05-21 21:54:05,288 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 620.3ms TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2021-05-21 21:54:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52526 states. [2021-05-21 21:54:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52526 to 46131. [2021-05-21 21:54:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46131 states, 46129 states have (on average 4.255609269656832) internal successors, (196307), 46130 states have internal predecessors, (196307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46131 states to 46131 states and 196307 transitions. [2021-05-21 21:54:06,436 INFO L78 Accepts]: Start accepts. Automaton has 46131 states and 196307 transitions. Word has length 70 [2021-05-21 21:54:06,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:06,436 INFO L482 AbstractCegarLoop]: Abstraction has 46131 states and 196307 transitions. [2021-05-21 21:54:06,436 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 46131 states and 196307 transitions. [2021-05-21 21:54:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-21 21:54:06,466 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:06,466 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:06,466 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-21 21:54:06,466 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:06,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:06,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1636468715, now seen corresponding path program 1 times [2021-05-21 21:54:06,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:06,467 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079708835] [2021-05-21 21:54:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:06,798 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2021-05-21 21:54:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:07,230 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:07,230 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079708835] [2021-05-21 21:54:07,230 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079708835] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:07,230 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:07,230 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 21:54:07,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327122952] [2021-05-21 21:54:07,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 21:54:07,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:07,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 21:54:07,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-05-21 21:54:07,231 INFO L87 Difference]: Start difference. First operand 46131 states and 196307 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:08,867 INFO L93 Difference]: Finished difference Result 46335 states and 194500 transitions. [2021-05-21 21:54:08,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-21 21:54:08,867 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-05-21 21:54:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:08,984 INFO L225 Difference]: With dead ends: 46335 [2021-05-21 21:54:08,984 INFO L226 Difference]: Without dead ends: 45255 [2021-05-21 21:54:08,984 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1290.5ms TimeCoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892 [2021-05-21 21:54:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45255 states. [2021-05-21 21:54:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45255 to 40527. [2021-05-21 21:54:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40527 states, 40525 states have (on average 4.238864898210981) internal successors, (171780), 40526 states have internal predecessors, (171780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40527 states to 40527 states and 171780 transitions. [2021-05-21 21:54:09,934 INFO L78 Accepts]: Start accepts. Automaton has 40527 states and 171780 transitions. Word has length 71 [2021-05-21 21:54:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:09,934 INFO L482 AbstractCegarLoop]: Abstraction has 40527 states and 171780 transitions. [2021-05-21 21:54:09,934 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 40527 states and 171780 transitions. [2021-05-21 21:54:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-21 21:54:09,965 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:09,965 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:09,965 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-21 21:54:09,966 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:09,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:09,966 INFO L82 PathProgramCache]: Analyzing trace with hash -992111004, now seen corresponding path program 1 times [2021-05-21 21:54:09,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:09,966 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961433067] [2021-05-21 21:54:09,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:10,015 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:10,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961433067] [2021-05-21 21:54:10,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961433067] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:10,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:10,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-21 21:54:10,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029864421] [2021-05-21 21:54:10,016 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-21 21:54:10,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:10,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-21 21:54:10,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-05-21 21:54:10,017 INFO L87 Difference]: Start difference. First operand 40527 states and 171780 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:10,698 INFO L93 Difference]: Finished difference Result 62148 states and 255238 transitions. [2021-05-21 21:54:10,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-21 21:54:10,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-05-21 21:54:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:10,810 INFO L225 Difference]: With dead ends: 62148 [2021-05-21 21:54:10,811 INFO L226 Difference]: Without dead ends: 47082 [2021-05-21 21:54:10,811 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 115.8ms TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-05-21 21:54:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47082 states. [2021-05-21 21:54:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47082 to 37407. [2021-05-21 21:54:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37407 states, 37405 states have (on average 4.195535356235798) internal successors, (156934), 37406 states have internal predecessors, (156934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37407 states to 37407 states and 156934 transitions. [2021-05-21 21:54:11,868 INFO L78 Accepts]: Start accepts. Automaton has 37407 states and 156934 transitions. Word has length 71 [2021-05-21 21:54:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:11,868 INFO L482 AbstractCegarLoop]: Abstraction has 37407 states and 156934 transitions. [2021-05-21 21:54:11,868 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 37407 states and 156934 transitions. [2021-05-21 21:54:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-21 21:54:11,896 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:11,896 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:11,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-21 21:54:11,897 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash 617757196, now seen corresponding path program 2 times [2021-05-21 21:54:11,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:11,897 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664019373] [2021-05-21 21:54:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:11,973 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:11,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664019373] [2021-05-21 21:54:11,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664019373] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:11,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:11,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-21 21:54:11,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383548857] [2021-05-21 21:54:11,973 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-21 21:54:11,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:11,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-21 21:54:11,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-05-21 21:54:11,974 INFO L87 Difference]: Start difference. First operand 37407 states and 156934 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:12,437 INFO L93 Difference]: Finished difference Result 52101 states and 213437 transitions. [2021-05-21 21:54:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-21 21:54:12,437 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-05-21 21:54:12,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:12,545 INFO L225 Difference]: With dead ends: 52101 [2021-05-21 21:54:12,545 INFO L226 Difference]: Without dead ends: 45375 [2021-05-21 21:54:12,545 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 178.0ms TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2021-05-21 21:54:12,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45375 states. [2021-05-21 21:54:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45375 to 37416. [2021-05-21 21:54:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37416 states, 37414 states have (on average 4.195648687657027) internal successors, (156976), 37415 states have internal predecessors, (156976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37416 states to 37416 states and 156976 transitions. [2021-05-21 21:54:13,570 INFO L78 Accepts]: Start accepts. Automaton has 37416 states and 156976 transitions. Word has length 71 [2021-05-21 21:54:13,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:13,570 INFO L482 AbstractCegarLoop]: Abstraction has 37416 states and 156976 transitions. [2021-05-21 21:54:13,570 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 37416 states and 156976 transitions. [2021-05-21 21:54:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-21 21:54:13,598 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:13,598 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:13,598 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-21 21:54:13,599 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1562092050, now seen corresponding path program 3 times [2021-05-21 21:54:13,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:13,599 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622905502] [2021-05-21 21:54:13,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:13,710 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:13,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622905502] [2021-05-21 21:54:13,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622905502] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:13,710 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:13,710 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-21 21:54:13,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124962841] [2021-05-21 21:54:13,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-21 21:54:13,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:13,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-21 21:54:13,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-05-21 21:54:13,711 INFO L87 Difference]: Start difference. First operand 37416 states and 156976 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:14,513 INFO L93 Difference]: Finished difference Result 47706 states and 195499 transitions. [2021-05-21 21:54:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-21 21:54:14,513 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-05-21 21:54:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:14,625 INFO L225 Difference]: With dead ends: 47706 [2021-05-21 21:54:14,625 INFO L226 Difference]: Without dead ends: 42690 [2021-05-21 21:54:14,625 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 552.4ms TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2021-05-21 21:54:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42690 states. [2021-05-21 21:54:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42690 to 34959. [2021-05-21 21:54:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34959 states, 34957 states have (on average 4.183539777440856) internal successors, (146244), 34958 states have internal predecessors, (146244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34959 states to 34959 states and 146244 transitions. [2021-05-21 21:54:15,339 INFO L78 Accepts]: Start accepts. Automaton has 34959 states and 146244 transitions. Word has length 71 [2021-05-21 21:54:15,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:15,339 INFO L482 AbstractCegarLoop]: Abstraction has 34959 states and 146244 transitions. [2021-05-21 21:54:15,340 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 34959 states and 146244 transitions. [2021-05-21 21:54:15,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-21 21:54:15,371 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:15,371 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:15,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-21 21:54:15,371 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:15,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:15,371 INFO L82 PathProgramCache]: Analyzing trace with hash -450918615, now seen corresponding path program 1 times [2021-05-21 21:54:15,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:15,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673926399] [2021-05-21 21:54:15,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:16,158 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:16,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673926399] [2021-05-21 21:54:16,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673926399] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:16,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:16,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 21:54:16,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097466385] [2021-05-21 21:54:16,159 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 21:54:16,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 21:54:16,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2021-05-21 21:54:16,159 INFO L87 Difference]: Start difference. First operand 34959 states and 146244 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:17,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:17,801 INFO L93 Difference]: Finished difference Result 35853 states and 147820 transitions. [2021-05-21 21:54:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-21 21:54:17,802 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-05-21 21:54:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:17,887 INFO L225 Difference]: With dead ends: 35853 [2021-05-21 21:54:17,887 INFO L226 Difference]: Without dead ends: 34053 [2021-05-21 21:54:17,888 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1379.3ms TimeCoverageRelationStatistics Valid=281, Invalid=1699, Unknown=0, NotChecked=0, Total=1980 [2021-05-21 21:54:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34053 states. [2021-05-21 21:54:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34053 to 29025. [2021-05-21 21:54:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29025 states, 29023 states have (on average 4.175447059228888) internal successors, (121184), 29024 states have internal predecessors, (121184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29025 states to 29025 states and 121184 transitions. [2021-05-21 21:54:18,635 INFO L78 Accepts]: Start accepts. Automaton has 29025 states and 121184 transitions. Word has length 73 [2021-05-21 21:54:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:18,635 INFO L482 AbstractCegarLoop]: Abstraction has 29025 states and 121184 transitions. [2021-05-21 21:54:18,635 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 29025 states and 121184 transitions. [2021-05-21 21:54:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-21 21:54:18,663 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:18,663 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:18,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-21 21:54:18,664 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:18,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash 958835916, now seen corresponding path program 1 times [2021-05-21 21:54:18,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:18,664 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642653774] [2021-05-21 21:54:18,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:19,434 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:19,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642653774] [2021-05-21 21:54:19,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642653774] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:19,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:19,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-21 21:54:19,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373937982] [2021-05-21 21:54:19,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-21 21:54:19,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:19,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-21 21:54:19,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2021-05-21 21:54:19,435 INFO L87 Difference]: Start difference. First operand 29025 states and 121184 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:20,177 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2021-05-21 21:54:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:22,052 INFO L93 Difference]: Finished difference Result 38504 states and 159667 transitions. [2021-05-21 21:54:22,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-21 21:54:22,053 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-05-21 21:54:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:22,139 INFO L225 Difference]: With dead ends: 38504 [2021-05-21 21:54:22,139 INFO L226 Difference]: Without dead ends: 34922 [2021-05-21 21:54:22,140 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1871.5ms TimeCoverageRelationStatistics Valid=254, Invalid=2296, Unknown=0, NotChecked=0, Total=2550 [2021-05-21 21:54:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34922 states. [2021-05-21 21:54:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34922 to 29592. [2021-05-21 21:54:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29592 states, 29590 states have (on average 4.223893207164583) internal successors, (124985), 29591 states have internal predecessors, (124985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29592 states to 29592 states and 124985 transitions. [2021-05-21 21:54:22,855 INFO L78 Accepts]: Start accepts. Automaton has 29592 states and 124985 transitions. Word has length 73 [2021-05-21 21:54:22,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:22,855 INFO L482 AbstractCegarLoop]: Abstraction has 29592 states and 124985 transitions. [2021-05-21 21:54:22,855 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 29592 states and 124985 transitions. [2021-05-21 21:54:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-21 21:54:22,884 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:22,884 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:22,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-21 21:54:22,884 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:22,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:22,885 INFO L82 PathProgramCache]: Analyzing trace with hash 937574186, now seen corresponding path program 2 times [2021-05-21 21:54:22,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:22,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267252490] [2021-05-21 21:54:22,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:23,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:23,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267252490] [2021-05-21 21:54:23,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267252490] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:23,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:23,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-21 21:54:23,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15272814] [2021-05-21 21:54:23,573 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-21 21:54:23,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-21 21:54:23,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2021-05-21 21:54:23,573 INFO L87 Difference]: Start difference. First operand 29592 states and 124985 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:25,238 INFO L93 Difference]: Finished difference Result 29856 states and 124699 transitions. [2021-05-21 21:54:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-21 21:54:25,239 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-05-21 21:54:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:25,307 INFO L225 Difference]: With dead ends: 29856 [2021-05-21 21:54:25,307 INFO L226 Difference]: Without dead ends: 27300 [2021-05-21 21:54:25,308 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1218.1ms TimeCoverageRelationStatistics Valid=245, Invalid=1825, Unknown=0, NotChecked=0, Total=2070 [2021-05-21 21:54:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27300 states. [2021-05-21 21:54:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27300 to 19407. [2021-05-21 21:54:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19407 states, 19405 states have (on average 4.1668126771450655) internal successors, (80857), 19406 states have internal predecessors, (80857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19407 states to 19407 states and 80857 transitions. [2021-05-21 21:54:25,712 INFO L78 Accepts]: Start accepts. Automaton has 19407 states and 80857 transitions. Word has length 73 [2021-05-21 21:54:25,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:25,712 INFO L482 AbstractCegarLoop]: Abstraction has 19407 states and 80857 transitions. [2021-05-21 21:54:25,712 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 19407 states and 80857 transitions. [2021-05-21 21:54:25,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 21:54:25,734 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:25,734 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:25,734 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-21 21:54:25,734 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:25,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:25,734 INFO L82 PathProgramCache]: Analyzing trace with hash 461088309, now seen corresponding path program 1 times [2021-05-21 21:54:25,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:25,735 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421888275] [2021-05-21 21:54:25,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:26,175 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2021-05-21 21:54:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:26,474 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:26,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421888275] [2021-05-21 21:54:26,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421888275] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:26,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:26,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 21:54:26,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488434996] [2021-05-21 21:54:26,474 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 21:54:26,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:26,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 21:54:26,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-05-21 21:54:26,475 INFO L87 Difference]: Start difference. First operand 19407 states and 80857 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:27,793 INFO L93 Difference]: Finished difference Result 23428 states and 95519 transitions. [2021-05-21 21:54:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-21 21:54:27,794 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 21:54:27,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:27,845 INFO L225 Difference]: With dead ends: 23428 [2021-05-21 21:54:27,846 INFO L226 Difference]: Without dead ends: 22564 [2021-05-21 21:54:27,846 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1231.5ms TimeCoverageRelationStatistics Valid=244, Invalid=1736, Unknown=0, NotChecked=0, Total=1980 [2021-05-21 21:54:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22564 states. [2021-05-21 21:54:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22564 to 21544. [2021-05-21 21:54:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21544 states, 21542 states have (on average 4.120369510723238) internal successors, (88761), 21543 states have internal predecessors, (88761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21544 states to 21544 states and 88761 transitions. [2021-05-21 21:54:28,377 INFO L78 Accepts]: Start accepts. Automaton has 21544 states and 88761 transitions. Word has length 74 [2021-05-21 21:54:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:28,377 INFO L482 AbstractCegarLoop]: Abstraction has 21544 states and 88761 transitions. [2021-05-21 21:54:28,377 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 21544 states and 88761 transitions. [2021-05-21 21:54:28,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 21:54:28,401 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:28,401 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:28,402 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-05-21 21:54:28,402 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:28,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:28,402 INFO L82 PathProgramCache]: Analyzing trace with hash 563120435, now seen corresponding path program 2 times [2021-05-21 21:54:28,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:28,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698041683] [2021-05-21 21:54:28,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:28,936 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:28,936 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698041683] [2021-05-21 21:54:28,936 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698041683] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:28,936 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:28,936 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 21:54:28,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526000034] [2021-05-21 21:54:28,936 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 21:54:28,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:28,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 21:54:28,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-05-21 21:54:28,937 INFO L87 Difference]: Start difference. First operand 21544 states and 88761 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:30,161 INFO L93 Difference]: Finished difference Result 24815 states and 100343 transitions. [2021-05-21 21:54:30,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-21 21:54:30,161 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 21:54:30,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:30,219 INFO L225 Difference]: With dead ends: 24815 [2021-05-21 21:54:30,219 INFO L226 Difference]: Without dead ends: 23951 [2021-05-21 21:54:30,220 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 955.7ms TimeCoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2021-05-21 21:54:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23951 states. [2021-05-21 21:54:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23951 to 21544. [2021-05-21 21:54:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21544 states, 21542 states have (on average 4.120369510723238) internal successors, (88761), 21543 states have internal predecessors, (88761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21544 states to 21544 states and 88761 transitions. [2021-05-21 21:54:30,705 INFO L78 Accepts]: Start accepts. Automaton has 21544 states and 88761 transitions. Word has length 74 [2021-05-21 21:54:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:30,705 INFO L482 AbstractCegarLoop]: Abstraction has 21544 states and 88761 transitions. [2021-05-21 21:54:30,705 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 21544 states and 88761 transitions. [2021-05-21 21:54:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 21:54:30,729 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:30,729 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:30,729 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-21 21:54:30,729 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:30,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash -374211371, now seen corresponding path program 3 times [2021-05-21 21:54:30,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:30,730 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814918459] [2021-05-21 21:54:30,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:31,295 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:31,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814918459] [2021-05-21 21:54:31,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814918459] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:31,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:31,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-21 21:54:31,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247389555] [2021-05-21 21:54:31,296 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-21 21:54:31,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-21 21:54:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-05-21 21:54:31,297 INFO L87 Difference]: Start difference. First operand 21544 states and 88761 transitions. Second operand has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:33,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:33,258 INFO L93 Difference]: Finished difference Result 26738 states and 107510 transitions. [2021-05-21 21:54:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-21 21:54:33,258 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 21:54:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:33,310 INFO L225 Difference]: With dead ends: 26738 [2021-05-21 21:54:33,311 INFO L226 Difference]: Without dead ends: 23282 [2021-05-21 21:54:33,311 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1137.8ms TimeCoverageRelationStatistics Valid=247, Invalid=2009, Unknown=0, NotChecked=0, Total=2256 [2021-05-21 21:54:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23282 states. [2021-05-21 21:54:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23282 to 18952. [2021-05-21 21:54:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18952 states, 18950 states have (on average 4.075092348284961) internal successors, (77223), 18951 states have internal predecessors, (77223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18952 states to 18952 states and 77223 transitions. [2021-05-21 21:54:33,679 INFO L78 Accepts]: Start accepts. Automaton has 18952 states and 77223 transitions. Word has length 74 [2021-05-21 21:54:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:33,679 INFO L482 AbstractCegarLoop]: Abstraction has 18952 states and 77223 transitions. [2021-05-21 21:54:33,679 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 18952 states and 77223 transitions. [2021-05-21 21:54:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 21:54:33,700 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:33,701 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:33,701 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-21 21:54:33,701 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:33,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash 447738003, now seen corresponding path program 4 times [2021-05-21 21:54:33,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:33,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015541332] [2021-05-21 21:54:33,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:34,110 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:34,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015541332] [2021-05-21 21:54:34,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015541332] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:34,110 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:34,110 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-21 21:54:34,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692489252] [2021-05-21 21:54:34,111 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-21 21:54:34,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:34,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-21 21:54:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-05-21 21:54:34,111 INFO L87 Difference]: Start difference. First operand 18952 states and 77223 transitions. Second operand has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:35,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:35,391 INFO L93 Difference]: Finished difference Result 22543 states and 89781 transitions. [2021-05-21 21:54:35,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-21 21:54:35,391 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 21:54:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:35,440 INFO L225 Difference]: With dead ends: 22543 [2021-05-21 21:54:35,440 INFO L226 Difference]: Without dead ends: 21679 [2021-05-21 21:54:35,440 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 863.9ms TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2021-05-21 21:54:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2021-05-21 21:54:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 19122. [2021-05-21 21:54:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19122 states, 19120 states have (on average 4.065585774058578) internal successors, (77734), 19121 states have internal predecessors, (77734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 77734 transitions. [2021-05-21 21:54:35,789 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 77734 transitions. Word has length 74 [2021-05-21 21:54:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:35,790 INFO L482 AbstractCegarLoop]: Abstraction has 19122 states and 77734 transitions. [2021-05-21 21:54:35,790 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 77734 transitions. [2021-05-21 21:54:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 21:54:35,811 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:35,811 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:35,811 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-21 21:54:35,811 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:35,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1081503733, now seen corresponding path program 5 times [2021-05-21 21:54:35,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:35,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543929288] [2021-05-21 21:54:35,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:36,171 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:36,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543929288] [2021-05-21 21:54:36,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543929288] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:36,172 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:36,172 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-21 21:54:36,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136188717] [2021-05-21 21:54:36,172 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-21 21:54:36,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:36,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-21 21:54:36,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-05-21 21:54:36,172 INFO L87 Difference]: Start difference. First operand 19122 states and 77734 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:37,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:37,286 INFO L93 Difference]: Finished difference Result 22763 states and 90402 transitions. [2021-05-21 21:54:37,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-21 21:54:37,286 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 21:54:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:37,334 INFO L225 Difference]: With dead ends: 22763 [2021-05-21 21:54:37,334 INFO L226 Difference]: Without dead ends: 21899 [2021-05-21 21:54:37,334 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 727.1ms TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 21:54:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2021-05-21 21:54:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 19172. [2021-05-21 21:54:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19172 states, 19170 states have (on average 4.060719874804382) internal successors, (77844), 19171 states have internal predecessors, (77844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19172 states to 19172 states and 77844 transitions. [2021-05-21 21:54:37,690 INFO L78 Accepts]: Start accepts. Automaton has 19172 states and 77844 transitions. Word has length 74 [2021-05-21 21:54:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:37,690 INFO L482 AbstractCegarLoop]: Abstraction has 19172 states and 77844 transitions. [2021-05-21 21:54:37,690 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 19172 states and 77844 transitions. [2021-05-21 21:54:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 21:54:37,712 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:37,712 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:37,713 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-21 21:54:37,713 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:37,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:37,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1223596091, now seen corresponding path program 6 times [2021-05-21 21:54:37,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:37,713 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131478050] [2021-05-21 21:54:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:38,264 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2021-05-21 21:54:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:38,353 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:38,354 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131478050] [2021-05-21 21:54:38,354 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131478050] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:38,354 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:38,354 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-21 21:54:38,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214684743] [2021-05-21 21:54:38,354 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-21 21:54:38,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-21 21:54:38,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-05-21 21:54:38,355 INFO L87 Difference]: Start difference. First operand 19172 states and 77844 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:40,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:40,020 INFO L93 Difference]: Finished difference Result 22885 states and 90632 transitions. [2021-05-21 21:54:40,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-21 21:54:40,020 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 21:54:40,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:40,067 INFO L225 Difference]: With dead ends: 22885 [2021-05-21 21:54:40,068 INFO L226 Difference]: Without dead ends: 22021 [2021-05-21 21:54:40,068 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1491.3ms TimeCoverageRelationStatistics Valid=253, Invalid=1817, Unknown=0, NotChecked=0, Total=2070 [2021-05-21 21:54:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22021 states. [2021-05-21 21:54:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22021 to 19193. [2021-05-21 21:54:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19193 states, 19191 states have (on average 4.058204366630191) internal successors, (77881), 19192 states have internal predecessors, (77881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19193 states to 19193 states and 77881 transitions. [2021-05-21 21:54:40,568 INFO L78 Accepts]: Start accepts. Automaton has 19193 states and 77881 transitions. Word has length 74 [2021-05-21 21:54:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:40,568 INFO L482 AbstractCegarLoop]: Abstraction has 19193 states and 77881 transitions. [2021-05-21 21:54:40,568 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 19193 states and 77881 transitions. [2021-05-21 21:54:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 21:54:40,590 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:40,590 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:40,590 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-21 21:54:40,590 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1885361097, now seen corresponding path program 7 times [2021-05-21 21:54:40,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:40,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027884259] [2021-05-21 21:54:40,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:40,817 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:40,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027884259] [2021-05-21 21:54:40,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027884259] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:40,817 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:40,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-21 21:54:40,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727502807] [2021-05-21 21:54:40,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-21 21:54:40,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-21 21:54:40,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-05-21 21:54:40,818 INFO L87 Difference]: Start difference. First operand 19193 states and 77881 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:41,547 INFO L93 Difference]: Finished difference Result 22856 states and 90587 transitions. [2021-05-21 21:54:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-21 21:54:41,547 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 21:54:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:41,596 INFO L225 Difference]: With dead ends: 22856 [2021-05-21 21:54:41,596 INFO L226 Difference]: Without dead ends: 21992 [2021-05-21 21:54:41,596 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 434.7ms TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-05-21 21:54:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21992 states. [2021-05-21 21:54:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21992 to 19194. [2021-05-21 21:54:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19194 states, 19192 states have (on average 4.058045018757816) internal successors, (77882), 19193 states have internal predecessors, (77882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19194 states to 19194 states and 77882 transitions. [2021-05-21 21:54:41,936 INFO L78 Accepts]: Start accepts. Automaton has 19194 states and 77882 transitions. Word has length 74 [2021-05-21 21:54:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:41,937 INFO L482 AbstractCegarLoop]: Abstraction has 19194 states and 77882 transitions. [2021-05-21 21:54:41,937 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 19194 states and 77882 transitions. [2021-05-21 21:54:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 21:54:41,958 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:41,958 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:41,958 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-05-21 21:54:41,958 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:41,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:41,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1675812887, now seen corresponding path program 8 times [2021-05-21 21:54:41,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:41,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79187250] [2021-05-21 21:54:41,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:42,248 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-05-21 21:54:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:42,392 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:42,392 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79187250] [2021-05-21 21:54:42,392 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79187250] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:42,392 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:42,392 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-21 21:54:42,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760886657] [2021-05-21 21:54:42,392 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-21 21:54:42,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:42,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-21 21:54:42,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-05-21 21:54:42,393 INFO L87 Difference]: Start difference. First operand 19194 states and 77882 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:43,164 INFO L93 Difference]: Finished difference Result 22886 states and 90633 transitions. [2021-05-21 21:54:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-21 21:54:43,165 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 21:54:43,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:43,212 INFO L225 Difference]: With dead ends: 22886 [2021-05-21 21:54:43,212 INFO L226 Difference]: Without dead ends: 22022 [2021-05-21 21:54:43,213 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 640.6ms TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2021-05-21 21:54:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22022 states. [2021-05-21 21:54:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22022 to 19223. [2021-05-21 21:54:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19223 states, 19221 states have (on average 4.054263565891473) internal successors, (77927), 19222 states have internal predecessors, (77927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19223 states to 19223 states and 77927 transitions. [2021-05-21 21:54:43,563 INFO L78 Accepts]: Start accepts. Automaton has 19223 states and 77927 transitions. Word has length 74 [2021-05-21 21:54:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:43,563 INFO L482 AbstractCegarLoop]: Abstraction has 19223 states and 77927 transitions. [2021-05-21 21:54:43,563 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 19223 states and 77927 transitions. [2021-05-21 21:54:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-21 21:54:43,584 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:43,585 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:43,585 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-21 21:54:43,585 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:43,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1475525857, now seen corresponding path program 9 times [2021-05-21 21:54:43,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:43,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331074233] [2021-05-21 21:54:43,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:43,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:43,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331074233] [2021-05-21 21:54:43,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331074233] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:43,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:43,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-21 21:54:43,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291000855] [2021-05-21 21:54:43,795 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-21 21:54:43,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:43,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-21 21:54:43,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-05-21 21:54:43,795 INFO L87 Difference]: Start difference. First operand 19223 states and 77927 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:44,281 INFO L93 Difference]: Finished difference Result 21916 states and 86727 transitions. [2021-05-21 21:54:44,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-21 21:54:44,282 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-05-21 21:54:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:44,327 INFO L225 Difference]: With dead ends: 21916 [2021-05-21 21:54:44,327 INFO L226 Difference]: Without dead ends: 21052 [2021-05-21 21:54:44,328 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 340.9ms TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-05-21 21:54:44,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21052 states. [2021-05-21 21:54:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21052 to 18224. [2021-05-21 21:54:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18224 states, 18222 states have (on average 4.059708045220064) internal successors, (73976), 18223 states have internal predecessors, (73976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18224 states to 18224 states and 73976 transitions. [2021-05-21 21:54:44,659 INFO L78 Accepts]: Start accepts. Automaton has 18224 states and 73976 transitions. Word has length 74 [2021-05-21 21:54:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:44,659 INFO L482 AbstractCegarLoop]: Abstraction has 18224 states and 73976 transitions. [2021-05-21 21:54:44,659 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 18224 states and 73976 transitions. [2021-05-21 21:54:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-21 21:54:44,681 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:44,681 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:44,681 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-05-21 21:54:44,681 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1183741372, now seen corresponding path program 1 times [2021-05-21 21:54:44,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:44,682 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531536420] [2021-05-21 21:54:44,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:45,409 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:45,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531536420] [2021-05-21 21:54:45,410 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531536420] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:45,410 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:45,410 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-21 21:54:45,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857822069] [2021-05-21 21:54:45,410 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-21 21:54:45,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:45,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-21 21:54:45,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-05-21 21:54:45,411 INFO L87 Difference]: Start difference. First operand 18224 states and 73976 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:47,020 INFO L93 Difference]: Finished difference Result 23749 states and 93878 transitions. [2021-05-21 21:54:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-21 21:54:47,020 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-05-21 21:54:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:47,070 INFO L225 Difference]: With dead ends: 23749 [2021-05-21 21:54:47,071 INFO L226 Difference]: Without dead ends: 23065 [2021-05-21 21:54:47,071 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1377.4ms TimeCoverageRelationStatistics Valid=258, Invalid=1998, Unknown=0, NotChecked=0, Total=2256 [2021-05-21 21:54:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23065 states. [2021-05-21 21:54:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23065 to 18224. [2021-05-21 21:54:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18224 states, 18222 states have (on average 4.059708045220064) internal successors, (73976), 18223 states have internal predecessors, (73976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18224 states to 18224 states and 73976 transitions. [2021-05-21 21:54:47,418 INFO L78 Accepts]: Start accepts. Automaton has 18224 states and 73976 transitions. Word has length 76 [2021-05-21 21:54:47,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:47,418 INFO L482 AbstractCegarLoop]: Abstraction has 18224 states and 73976 transitions. [2021-05-21 21:54:47,418 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 18224 states and 73976 transitions. [2021-05-21 21:54:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-21 21:54:47,440 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:47,440 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:47,440 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-21 21:54:47,441 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:47,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:47,441 INFO L82 PathProgramCache]: Analyzing trace with hash -342292756, now seen corresponding path program 2 times [2021-05-21 21:54:47,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:47,441 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538530775] [2021-05-21 21:54:47,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:47,933 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:47,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538530775] [2021-05-21 21:54:47,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538530775] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:47,933 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:47,933 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-21 21:54:47,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597022370] [2021-05-21 21:54:47,933 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-21 21:54:47,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:47,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-21 21:54:47,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2021-05-21 21:54:47,934 INFO L87 Difference]: Start difference. First operand 18224 states and 73976 transitions. Second operand has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:49,398 INFO L93 Difference]: Finished difference Result 22030 states and 86807 transitions. [2021-05-21 21:54:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-21 21:54:49,398 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-05-21 21:54:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:49,442 INFO L225 Difference]: With dead ends: 22030 [2021-05-21 21:54:49,442 INFO L226 Difference]: Without dead ends: 21346 [2021-05-21 21:54:49,443 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 972.4ms TimeCoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2021-05-21 21:54:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21346 states. [2021-05-21 21:54:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21346 to 16478. [2021-05-21 21:54:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16478 states, 16476 states have (on average 4.074471959213401) internal successors, (67131), 16477 states have internal predecessors, (67131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16478 states to 16478 states and 67131 transitions. [2021-05-21 21:54:49,745 INFO L78 Accepts]: Start accepts. Automaton has 16478 states and 67131 transitions. Word has length 76 [2021-05-21 21:54:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:49,745 INFO L482 AbstractCegarLoop]: Abstraction has 16478 states and 67131 transitions. [2021-05-21 21:54:49,746 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 16478 states and 67131 transitions. [2021-05-21 21:54:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-21 21:54:49,766 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:49,766 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:49,766 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-05-21 21:54:49,766 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:49,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1885510190, now seen corresponding path program 3 times [2021-05-21 21:54:49,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:49,766 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511386556] [2021-05-21 21:54:49,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:50,224 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:50,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511386556] [2021-05-21 21:54:50,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511386556] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:50,224 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:50,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-21 21:54:50,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748081356] [2021-05-21 21:54:50,225 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-21 21:54:50,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:50,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-21 21:54:50,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2021-05-21 21:54:50,225 INFO L87 Difference]: Start difference. First operand 16478 states and 67131 transitions. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:51,323 INFO L93 Difference]: Finished difference Result 21346 states and 84263 transitions. [2021-05-21 21:54:51,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-21 21:54:51,324 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-05-21 21:54:51,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:51,367 INFO L225 Difference]: With dead ends: 21346 [2021-05-21 21:54:51,367 INFO L226 Difference]: Without dead ends: 21004 [2021-05-21 21:54:51,368 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 784.1ms TimeCoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2021-05-21 21:54:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21004 states. [2021-05-21 21:54:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21004 to 16478. [2021-05-21 21:54:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16478 states, 16476 states have (on average 4.074471959213401) internal successors, (67131), 16477 states have internal predecessors, (67131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16478 states to 16478 states and 67131 transitions. [2021-05-21 21:54:51,663 INFO L78 Accepts]: Start accepts. Automaton has 16478 states and 67131 transitions. Word has length 76 [2021-05-21 21:54:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:51,664 INFO L482 AbstractCegarLoop]: Abstraction has 16478 states and 67131 transitions. [2021-05-21 21:54:51,664 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 16478 states and 67131 transitions. [2021-05-21 21:54:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-21 21:54:51,685 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:51,685 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:51,685 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-21 21:54:51,685 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:51,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1564620922, now seen corresponding path program 4 times [2021-05-21 21:54:51,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:51,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375197208] [2021-05-21 21:54:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 21:54:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 21:54:52,039 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 21:54:52,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375197208] [2021-05-21 21:54:52,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375197208] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 21:54:52,039 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 21:54:52,039 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-21 21:54:52,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783881439] [2021-05-21 21:54:52,040 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-21 21:54:52,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 21:54:52,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-21 21:54:52,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-05-21 21:54:52,040 INFO L87 Difference]: Start difference. First operand 16478 states and 67131 transitions. Second operand has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 21:54:53,013 INFO L93 Difference]: Finished difference Result 16265 states and 64818 transitions. [2021-05-21 21:54:53,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-21 21:54:53,013 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-05-21 21:54:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 21:54:53,047 INFO L225 Difference]: With dead ends: 16265 [2021-05-21 21:54:53,048 INFO L226 Difference]: Without dead ends: 15923 [2021-05-21 21:54:53,048 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 661.5ms TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 21:54:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2021-05-21 21:54:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 11363. [2021-05-21 21:54:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11363 states, 11362 states have (on average 4.191867628938567) internal successors, (47628), 11362 states have internal predecessors, (47628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11363 states to 11363 states and 47628 transitions. [2021-05-21 21:54:53,261 INFO L78 Accepts]: Start accepts. Automaton has 11363 states and 47628 transitions. Word has length 76 [2021-05-21 21:54:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 21:54:53,261 INFO L482 AbstractCegarLoop]: Abstraction has 11363 states and 47628 transitions. [2021-05-21 21:54:53,261 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:53,261 INFO L276 IsEmpty]: Start isEmpty. Operand 11363 states and 47628 transitions. [2021-05-21 21:54:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-05-21 21:54:53,279 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 21:54:53,279 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 21:54:53,279 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-05-21 21:54:53,279 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 21:54:53,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 21:54:53,279 INFO L82 PathProgramCache]: Analyzing trace with hash 511479404, now seen corresponding path program 1 times [2021-05-21 21:54:53,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 21:54:53,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607260973] [2021-05-21 21:54:53,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 21:54:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 21:54:53,294 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 21:54:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 21:54:53,312 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 21:54:53,341 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-21 21:54:53,342 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-21 21:54:53,342 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-21 21:54:53,342 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2021-05-21 21:54:53,344 INFO L255 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-05-21 21:54:53,344 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 21:54:53,344 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 21:54:53,344 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 21:54:53,344 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 21:54:53,344 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 21:54:53,344 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 21:54:53,344 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 21:54:53,344 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-05-21 21:54:53,347 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 197 places, 278 transitions, 936 flow [2021-05-21 21:54:59,793 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:54:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 21:55:00,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-21 21:55:00,069 INFO L315 ceAbstractionStarter]: Result for error location InUseError was SAFE (2/2) [2021-05-21 21:55:00,069 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-05-21 21:55:00,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.05 09:55:00 BasicIcfg [2021-05-21 21:55:00,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-21 21:55:00,150 INFO L168 Benchmark]: Toolchain (without parser) took 160190.77 ms. Allocated memory was 350.2 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 311.9 MB in the beginning and 10.6 GB in the end (delta: -10.3 GB). Peak memory consumption was 5.3 GB. Max. memory is 16.0 GB. [2021-05-21 21:55:00,150 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 350.2 MB. Free memory was 330.7 MB in the beginning and 330.6 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 21:55:00,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.09 ms. Allocated memory is still 350.2 MB. Free memory was 311.7 MB in the beginning and 271.9 MB in the end (delta: 39.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 16.0 GB. [2021-05-21 21:55:00,150 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.44 ms. Allocated memory is still 350.2 MB. Free memory was 271.9 MB in the beginning and 269.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-05-21 21:55:00,150 INFO L168 Benchmark]: Boogie Preprocessor took 15.42 ms. Allocated memory is still 350.2 MB. Free memory was 269.8 MB in the beginning and 268.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-05-21 21:55:00,150 INFO L168 Benchmark]: RCFGBuilder took 431.64 ms. Allocated memory is still 350.2 MB. Free memory was 268.0 MB in the beginning and 238.3 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. [2021-05-21 21:55:00,150 INFO L168 Benchmark]: TraceAbstraction took 159089.87 ms. Allocated memory was 350.2 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 237.4 MB in the beginning and 10.6 GB in the end (delta: -10.4 GB). Peak memory consumption was 5.2 GB. Max. memory is 16.0 GB. [2021-05-21 21:55:00,151 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.11 ms. Allocated memory is still 350.2 MB. Free memory was 330.7 MB in the beginning and 330.6 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 609.09 ms. Allocated memory is still 350.2 MB. Free memory was 311.7 MB in the beginning and 271.9 MB in the end (delta: 39.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 39.44 ms. Allocated memory is still 350.2 MB. Free memory was 271.9 MB in the beginning and 269.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 15.42 ms. Allocated memory is still 350.2 MB. Free memory was 269.8 MB in the beginning and 268.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 431.64 ms. Allocated memory is still 350.2 MB. Free memory was 268.0 MB in the beginning and 238.3 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 159089.87 ms. Allocated memory was 350.2 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 237.4 MB in the beginning and 10.6 GB in the end (delta: -10.4 GB). Peak memory consumption was 5.2 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; VAL [v={0:0}] [L1161] 0 pthread_t t; VAL [v={0:0}] [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t1, 0, thread1, 0)=-2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=-2, arg={0:0}, arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) VAL [\read(t1)=-2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1128] 2 return 0; VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t2, 0, thread2, 0)=-1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t3, 0, thread3, 0)=0, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 5 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 5 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 3 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 3 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1163] 0 \read(t) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 6 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1140] 4 v[0] = 'Y' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1142] 4 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 6 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1153] 1 \read(t2) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1154] 1 \read(t3) VAL [\read(t3)=0, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=0, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1155] 1 \read(t4) VAL [\read(t4)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1156] 1 \read(t5) VAL [\read(t5)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1164] 0 v[0] VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1123] COND TRUE 0 !expression VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1123] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 216 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 151991.6ms, OverallIterations: 51, TraceHistogramMax: 1, EmptinessCheckTime: 1434.6ms, AutomataDifference: 70119.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5367.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 11798 SDtfs, 19843 SDslu, 105773 SDs, 0 SdLazy, 49100 SolverSat, 2630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22958.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1722 GetRequests, 107 SyntacticMatches, 135 SemanticMatches, 1480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9517 ImplicationChecksByTransitivity, 34670.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=70531occurred in iteration=0, InterpolantAutomatonStates: 1108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 55103.8ms AutomataMinimizationTime, 50 MinimizatonAttempts, 329027 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 121.1ms SsaConstructionTime, 546.5ms SatisfiabilityAnalysisTime, 18926.6ms InterpolantComputationTime, 3439 NumberOfCodeBlocks, 3439 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3279 ConstructedInterpolants, 0 QuantifiedInterpolants, 73527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 50 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 11 procedures, 216 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6724.3ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 275.6ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6448.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=70531occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...