/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:34:27,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:34:27,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:34:27,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:34:27,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:34:27,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:34:27,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:34:27,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:34:27,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:34:27,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:34:27,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:34:27,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:34:27,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:34:27,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:34:27,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:34:27,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:34:27,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:34:27,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:34:27,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:34:27,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:34:27,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:34:27,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:34:27,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:34:27,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:34:27,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:34:27,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:34:27,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:34:27,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:34:27,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:34:27,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:34:27,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:34:27,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:34:27,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:34:27,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:34:27,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:34:27,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:34:27,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:34:27,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:34:27,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:34:27,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:34:27,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:34:27,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 02:34:27,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:34:27,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:34:27,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:34:27,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:34:27,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:34:27,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:34:27,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:34:27,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:34:27,172 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:34:27,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:34:27,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:34:27,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:34:27,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:34:27,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:34:27,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:34:27,173 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:34:27,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:34:27,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:34:27,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:34:27,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:34:27,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:34:27,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:34:27,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:34:27,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:34:27,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:34:27,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 02:34:27,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 02:34:27,175 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:34:27,175 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:34:27,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:34:27,175 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 02:34:27,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:34:27,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:34:27,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:34:27,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:34:27,433 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:34:27,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c [2022-01-10 02:34:27,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/317cedecf/7887c5638a614958ab0aead87f0a629c/FLAG4862945f6 [2022-01-10 02:34:27,944 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:34:27,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c [2022-01-10 02:34:27,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/317cedecf/7887c5638a614958ab0aead87f0a629c/FLAG4862945f6 [2022-01-10 02:34:28,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/317cedecf/7887c5638a614958ab0aead87f0a629c [2022-01-10 02:34:28,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:34:28,290 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:34:28,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:34:28,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:34:28,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:34:28,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:28" (1/1) ... [2022-01-10 02:34:28,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2460259a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28, skipping insertion in model container [2022-01-10 02:34:28,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:28" (1/1) ... [2022-01-10 02:34:28,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:34:28,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:34:28,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c[914,927] [2022-01-10 02:34:28,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c[7115,7128] [2022-01-10 02:34:28,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:34:28,621 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:34:28,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c[914,927] [2022-01-10 02:34:28,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c[7115,7128] [2022-01-10 02:34:28,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:34:28,724 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:34:28,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28 WrapperNode [2022-01-10 02:34:28,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:34:28,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:34:28,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:34:28,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:34:28,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28" (1/1) ... [2022-01-10 02:34:28,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28" (1/1) ... [2022-01-10 02:34:28,822 INFO L137 Inliner]: procedures = 71, calls = 84, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 866 [2022-01-10 02:34:28,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:34:28,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:34:28,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:34:28,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:34:28,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28" (1/1) ... [2022-01-10 02:34:28,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28" (1/1) ... [2022-01-10 02:34:28,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28" (1/1) ... [2022-01-10 02:34:28,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28" (1/1) ... [2022-01-10 02:34:28,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28" (1/1) ... [2022-01-10 02:34:28,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28" (1/1) ... [2022-01-10 02:34:28,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28" (1/1) ... [2022-01-10 02:34:28,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:34:28,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:34:28,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:34:28,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:34:28,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28" (1/1) ... [2022-01-10 02:34:28,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:34:28,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:28,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 02:34:28,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 02:34:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:34:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 02:34:28,974 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 02:34:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-01-10 02:34:28,974 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-01-10 02:34:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 02:34:28,974 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 02:34:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 02:34:28,975 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 02:34:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-01-10 02:34:28,975 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-01-10 02:34:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 02:34:28,975 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 02:34:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 02:34:28,975 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 02:34:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-01-10 02:34:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-01-10 02:34:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-01-10 02:34:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-01-10 02:34:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-01-10 02:34:28,977 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-01-10 02:34:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 02:34:28,977 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 02:34:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 02:34:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 02:34:28,977 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 02:34:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-01-10 02:34:28,977 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-01-10 02:34:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:34:28,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:34:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 02:34:28,978 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 02:34:29,159 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:34:29,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:34:29,845 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:34:29,860 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:34:29,861 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-01-10 02:34:29,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:29 BoogieIcfgContainer [2022-01-10 02:34:29,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:34:29,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:34:29,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:34:29,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:34:29,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:34:28" (1/3) ... [2022-01-10 02:34:29,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f76f68d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:29, skipping insertion in model container [2022-01-10 02:34:29,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:28" (2/3) ... [2022-01-10 02:34:29,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f76f68d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:29, skipping insertion in model container [2022-01-10 02:34:29,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:29" (3/3) ... [2022-01-10 02:34:29,872 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.09.cil-1.c [2022-01-10 02:34:29,876 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:34:29,876 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 02:34:29,914 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:34:29,919 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 02:34:29,919 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 02:34:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 408 states, 354 states have (on average 1.6271186440677967) internal successors, (576), 360 states have internal predecessors, (576), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-01-10 02:34:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:29,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:29,950 INFO L514 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] [2022-01-10 02:34:29,951 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:29,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:29,954 INFO L85 PathProgramCache]: Analyzing trace with hash 398033314, now seen corresponding path program 1 times [2022-01-10 02:34:29,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:29,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188852631] [2022-01-10 02:34:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:29,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:30,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:30,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188852631] [2022-01-10 02:34:30,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188852631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:30,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:30,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:34:30,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702433499] [2022-01-10 02:34:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:30,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:34:30,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:30,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:34:30,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:30,411 INFO L87 Difference]: Start difference. First operand has 408 states, 354 states have (on average 1.6271186440677967) internal successors, (576), 360 states have internal predecessors, (576), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:34:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:31,532 INFO L93 Difference]: Finished difference Result 926 states and 1464 transitions. [2022-01-10 02:34:31,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:31,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:34:31,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:31,557 INFO L225 Difference]: With dead ends: 926 [2022-01-10 02:34:31,557 INFO L226 Difference]: Without dead ends: 533 [2022-01-10 02:34:31,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:34:31,571 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 733 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 2037 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:31,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [738 Valid, 2037 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 02:34:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-01-10 02:34:31,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 494. [2022-01-10 02:34:31,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 422 states have (on average 1.509478672985782) internal successors, (637), 428 states have internal predecessors, (637), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-01-10 02:34:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 736 transitions. [2022-01-10 02:34:31,698 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 736 transitions. Word has length 65 [2022-01-10 02:34:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:31,698 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 736 transitions. [2022-01-10 02:34:31,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:34:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 736 transitions. [2022-01-10 02:34:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:31,710 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:31,712 INFO L514 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] [2022-01-10 02:34:31,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 02:34:31,712 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:31,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2076921954, now seen corresponding path program 1 times [2022-01-10 02:34:31,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:31,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468488104] [2022-01-10 02:34:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:31,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:31,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:31,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468488104] [2022-01-10 02:34:31,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468488104] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:31,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:31,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:34:31,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910930378] [2022-01-10 02:34:31,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:31,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:34:31,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:31,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:34:31,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:31,889 INFO L87 Difference]: Start difference. First operand 494 states and 736 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:34:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:33,098 INFO L93 Difference]: Finished difference Result 841 states and 1213 transitions. [2022-01-10 02:34:33,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:34:33,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:34:33,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:33,103 INFO L225 Difference]: With dead ends: 841 [2022-01-10 02:34:33,103 INFO L226 Difference]: Without dead ends: 664 [2022-01-10 02:34:33,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-01-10 02:34:33,105 INFO L933 BasicCegarLoop]: 667 mSDtfsCounter, 1160 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:33,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1188 Valid, 2294 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:34:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-01-10 02:34:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 590. [2022-01-10 02:34:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 506 states have internal predecessors, (741), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-01-10 02:34:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 870 transitions. [2022-01-10 02:34:33,162 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 870 transitions. Word has length 65 [2022-01-10 02:34:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:33,163 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 870 transitions. [2022-01-10 02:34:33,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:34:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 870 transitions. [2022-01-10 02:34:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:33,166 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:33,166 INFO L514 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] [2022-01-10 02:34:33,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 02:34:33,166 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:33,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:33,167 INFO L85 PathProgramCache]: Analyzing trace with hash 48335844, now seen corresponding path program 1 times [2022-01-10 02:34:33,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:33,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949290061] [2022-01-10 02:34:33,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:33,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:33,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:33,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:33,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:33,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:33,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:33,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:33,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:33,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:33,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949290061] [2022-01-10 02:34:33,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949290061] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:33,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:33,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:34:33,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965561215] [2022-01-10 02:34:33,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:33,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:34:33,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:33,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:34:33,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:33,330 INFO L87 Difference]: Start difference. First operand 590 states and 870 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:34:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:34,425 INFO L93 Difference]: Finished difference Result 891 states and 1284 transitions. [2022-01-10 02:34:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:34:34,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-01-10 02:34:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:34,434 INFO L225 Difference]: With dead ends: 891 [2022-01-10 02:34:34,434 INFO L226 Difference]: Without dead ends: 624 [2022-01-10 02:34:34,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:34:34,443 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 530 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 2620 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:34,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 2620 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 02:34:34,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-01-10 02:34:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 595. [2022-01-10 02:34:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 510 states have internal predecessors, (743), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-01-10 02:34:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 873 transitions. [2022-01-10 02:34:34,530 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 873 transitions. Word has length 65 [2022-01-10 02:34:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:34,530 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 873 transitions. [2022-01-10 02:34:34,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:34:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 873 transitions. [2022-01-10 02:34:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:34,533 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:34,534 INFO L514 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] [2022-01-10 02:34:34,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 02:34:34,534 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:34,535 INFO L85 PathProgramCache]: Analyzing trace with hash -981023454, now seen corresponding path program 1 times [2022-01-10 02:34:34,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:34,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575356549] [2022-01-10 02:34:34,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:34,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:34,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:34,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575356549] [2022-01-10 02:34:34,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575356549] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:34,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:34,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:34:34,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671159846] [2022-01-10 02:34:34,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:34,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:34:34,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:34,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:34:34,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:34,686 INFO L87 Difference]: Start difference. First operand 595 states and 873 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:34:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:35,633 INFO L93 Difference]: Finished difference Result 913 states and 1306 transitions. [2022-01-10 02:34:35,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:34:35,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-01-10 02:34:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:35,637 INFO L225 Difference]: With dead ends: 913 [2022-01-10 02:34:35,637 INFO L226 Difference]: Without dead ends: 641 [2022-01-10 02:34:35,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:34:35,639 INFO L933 BasicCegarLoop]: 589 mSDtfsCounter, 789 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:35,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 2348 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:34:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-01-10 02:34:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 610. [2022-01-10 02:34:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 522 states have internal predecessors, (755), 59 states have call successors, (59), 28 states have call predecessors, (59), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-01-10 02:34:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 888 transitions. [2022-01-10 02:34:35,665 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 888 transitions. Word has length 65 [2022-01-10 02:34:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:35,665 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 888 transitions. [2022-01-10 02:34:35,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:34:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 888 transitions. [2022-01-10 02:34:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:35,667 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:35,667 INFO L514 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] [2022-01-10 02:34:35,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 02:34:35,667 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:35,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash 405179940, now seen corresponding path program 1 times [2022-01-10 02:34:35,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:35,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443117806] [2022-01-10 02:34:35,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:35,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:35,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:35,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443117806] [2022-01-10 02:34:35,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443117806] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:35,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:35,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:34:35,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128485746] [2022-01-10 02:34:35,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:35,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:34:35,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:35,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:34:35,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:35,763 INFO L87 Difference]: Start difference. First operand 610 states and 888 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:34:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:36,716 INFO L93 Difference]: Finished difference Result 1002 states and 1399 transitions. [2022-01-10 02:34:36,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:34:36,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:34:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:36,721 INFO L225 Difference]: With dead ends: 1002 [2022-01-10 02:34:36,721 INFO L226 Difference]: Without dead ends: 717 [2022-01-10 02:34:36,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-01-10 02:34:36,723 INFO L933 BasicCegarLoop]: 612 mSDtfsCounter, 1193 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:36,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1219 Valid, 2059 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:34:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-01-10 02:34:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 622. [2022-01-10 02:34:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 532 states have internal predecessors, (765), 60 states have call successors, (60), 29 states have call predecessors, (60), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-01-10 02:34:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 898 transitions. [2022-01-10 02:34:36,752 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 898 transitions. Word has length 65 [2022-01-10 02:34:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:36,752 INFO L470 AbstractCegarLoop]: Abstraction has 622 states and 898 transitions. [2022-01-10 02:34:36,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:34:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 898 transitions. [2022-01-10 02:34:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:36,754 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:36,754 INFO L514 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] [2022-01-10 02:34:36,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 02:34:36,754 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:36,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash 271166434, now seen corresponding path program 1 times [2022-01-10 02:34:36,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:36,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725019541] [2022-01-10 02:34:36,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:36,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:36,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:36,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725019541] [2022-01-10 02:34:36,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725019541] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:36,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:36,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:36,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327323464] [2022-01-10 02:34:36,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:36,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:36,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:36,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:36,826 INFO L87 Difference]: Start difference. First operand 622 states and 898 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:34:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:37,325 INFO L93 Difference]: Finished difference Result 1264 states and 1745 transitions. [2022-01-10 02:34:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:34:37,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:34:37,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:37,332 INFO L225 Difference]: With dead ends: 1264 [2022-01-10 02:34:37,332 INFO L226 Difference]: Without dead ends: 968 [2022-01-10 02:34:37,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:34:37,334 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 1457 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:37,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1487 Valid, 1438 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:34:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-01-10 02:34:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 912. [2022-01-10 02:34:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 748 states have (on average 1.4064171122994653) internal successors, (1052), 763 states have internal predecessors, (1052), 95 states have call successors, (95), 51 states have call predecessors, (95), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) [2022-01-10 02:34:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1277 transitions. [2022-01-10 02:34:37,373 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1277 transitions. Word has length 65 [2022-01-10 02:34:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:37,373 INFO L470 AbstractCegarLoop]: Abstraction has 912 states and 1277 transitions. [2022-01-10 02:34:37,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:34:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1277 transitions. [2022-01-10 02:34:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:34:37,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:37,376 INFO L514 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] [2022-01-10 02:34:37,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 02:34:37,377 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:37,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash 498977079, now seen corresponding path program 1 times [2022-01-10 02:34:37,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:37,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706064306] [2022-01-10 02:34:37,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:37,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:37,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:37,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706064306] [2022-01-10 02:34:37,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706064306] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:37,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:37,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:37,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977327285] [2022-01-10 02:34:37,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:37,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:37,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:37,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:37,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:37,465 INFO L87 Difference]: Start difference. First operand 912 states and 1277 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:34:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:38,075 INFO L93 Difference]: Finished difference Result 2115 states and 2848 transitions. [2022-01-10 02:34:38,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:34:38,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-01-10 02:34:38,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:38,083 INFO L225 Difference]: With dead ends: 2115 [2022-01-10 02:34:38,083 INFO L226 Difference]: Without dead ends: 1508 [2022-01-10 02:34:38,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:34:38,086 INFO L933 BasicCegarLoop]: 593 mSDtfsCounter, 710 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:38,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [718 Valid, 1669 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:34:38,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-01-10 02:34:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1393. [2022-01-10 02:34:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1127 states have (on average 1.360248447204969) internal successors, (1533), 1145 states have internal predecessors, (1533), 140 states have call successors, (140), 95 states have call predecessors, (140), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) [2022-01-10 02:34:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1875 transitions. [2022-01-10 02:34:38,140 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1875 transitions. Word has length 66 [2022-01-10 02:34:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:38,140 INFO L470 AbstractCegarLoop]: Abstraction has 1393 states and 1875 transitions. [2022-01-10 02:34:38,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:34:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1875 transitions. [2022-01-10 02:34:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:34:38,142 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:38,143 INFO L514 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] [2022-01-10 02:34:38,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 02:34:38,143 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:38,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1957216738, now seen corresponding path program 1 times [2022-01-10 02:34:38,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:38,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675256592] [2022-01-10 02:34:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:38,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:38,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:38,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675256592] [2022-01-10 02:34:38,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675256592] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:38,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:38,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:38,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655368707] [2022-01-10 02:34:38,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:38,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:38,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:38,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:38,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:38,205 INFO L87 Difference]: Start difference. First operand 1393 states and 1875 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:34:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:38,614 INFO L93 Difference]: Finished difference Result 3581 states and 4681 transitions. [2022-01-10 02:34:38,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:34:38,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-01-10 02:34:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:38,625 INFO L225 Difference]: With dead ends: 3581 [2022-01-10 02:34:38,625 INFO L226 Difference]: Without dead ends: 2513 [2022-01-10 02:34:38,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:34:38,629 INFO L933 BasicCegarLoop]: 594 mSDtfsCounter, 1161 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:38,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1191 Valid, 1440 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:34:38,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2022-01-10 02:34:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2255. [2022-01-10 02:34:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 1793 states have (on average 1.3162297824874511) internal successors, (2360), 1821 states have internal predecessors, (2360), 238 states have call successors, (238), 179 states have call predecessors, (238), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) [2022-01-10 02:34:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2936 transitions. [2022-01-10 02:34:38,720 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2936 transitions. Word has length 66 [2022-01-10 02:34:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:38,721 INFO L470 AbstractCegarLoop]: Abstraction has 2255 states and 2936 transitions. [2022-01-10 02:34:38,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:34:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2936 transitions. [2022-01-10 02:34:38,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 02:34:38,723 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:38,723 INFO L514 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] [2022-01-10 02:34:38,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 02:34:38,724 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:38,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:38,724 INFO L85 PathProgramCache]: Analyzing trace with hash 388589846, now seen corresponding path program 1 times [2022-01-10 02:34:38,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:38,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112112464] [2022-01-10 02:34:38,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:38,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:38,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:38,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112112464] [2022-01-10 02:34:38,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112112464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:38,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:38,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:38,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783778791] [2022-01-10 02:34:38,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:38,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:38,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:38,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:38,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:38,783 INFO L87 Difference]: Start difference. First operand 2255 states and 2936 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:34:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:39,183 INFO L93 Difference]: Finished difference Result 5165 states and 6586 transitions. [2022-01-10 02:34:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:34:39,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-01-10 02:34:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:39,199 INFO L225 Difference]: With dead ends: 5165 [2022-01-10 02:34:39,199 INFO L226 Difference]: Without dead ends: 3235 [2022-01-10 02:34:39,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:34:39,206 INFO L933 BasicCegarLoop]: 608 mSDtfsCounter, 1146 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:39,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1176 Valid, 1486 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:34:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2022-01-10 02:34:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 2987. [2022-01-10 02:34:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2361 states have (on average 1.2977551884794578) internal successors, (3064), 2397 states have internal predecessors, (3064), 318 states have call successors, (318), 249 states have call predecessors, (318), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) [2022-01-10 02:34:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3829 transitions. [2022-01-10 02:34:39,356 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3829 transitions. Word has length 72 [2022-01-10 02:34:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:39,356 INFO L470 AbstractCegarLoop]: Abstraction has 2987 states and 3829 transitions. [2022-01-10 02:34:39,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:34:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3829 transitions. [2022-01-10 02:34:39,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 02:34:39,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:39,359 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:39,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 02:34:39,359 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:39,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:39,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1355326336, now seen corresponding path program 1 times [2022-01-10 02:34:39,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:39,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400158461] [2022-01-10 02:34:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:39,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:39,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:39,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:39,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:39,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:39,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:39,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:39,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400158461] [2022-01-10 02:34:39,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400158461] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:39,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:39,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:39,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122912721] [2022-01-10 02:34:39,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:39,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:39,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:39,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:39,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:39,428 INFO L87 Difference]: Start difference. First operand 2987 states and 3829 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 02:34:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:39,917 INFO L93 Difference]: Finished difference Result 3761 states and 4760 transitions. [2022-01-10 02:34:39,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:34:39,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-01-10 02:34:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:39,936 INFO L225 Difference]: With dead ends: 3761 [2022-01-10 02:34:39,936 INFO L226 Difference]: Without dead ends: 3758 [2022-01-10 02:34:39,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:34:39,939 INFO L933 BasicCegarLoop]: 603 mSDtfsCounter, 2030 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:39,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2040 Valid, 1186 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:34:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2022-01-10 02:34:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3481. [2022-01-10 02:34:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3481 states, 2746 states have (on average 1.2876911871813548) internal successors, (3536), 2787 states have internal predecessors, (3536), 368 states have call successors, (368), 293 states have call predecessors, (368), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) [2022-01-10 02:34:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 4430 transitions. [2022-01-10 02:34:40,122 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 4430 transitions. Word has length 73 [2022-01-10 02:34:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:40,122 INFO L470 AbstractCegarLoop]: Abstraction has 3481 states and 4430 transitions. [2022-01-10 02:34:40,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 02:34:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 4430 transitions. [2022-01-10 02:34:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 02:34:40,124 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:40,125 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:40,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 02:34:40,125 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:40,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash 933342880, now seen corresponding path program 1 times [2022-01-10 02:34:40,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:40,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920325403] [2022-01-10 02:34:40,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:40,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:40,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:40,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920325403] [2022-01-10 02:34:40,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920325403] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:40,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888736746] [2022-01-10 02:34:40,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:40,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:40,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:40,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:40,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 02:34:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 02:34:40,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:40,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:34:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:41,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888736746] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:34:41,103 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 02:34:41,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-01-10 02:34:41,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089175100] [2022-01-10 02:34:41,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 02:34:41,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:34:41,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:41,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:34:41,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:34:41,105 INFO L87 Difference]: Start difference. First operand 3481 states and 4430 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-01-10 02:34:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:42,791 INFO L93 Difference]: Finished difference Result 7922 states and 9916 transitions. [2022-01-10 02:34:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-10 02:34:42,792 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-01-10 02:34:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:42,828 INFO L225 Difference]: With dead ends: 7922 [2022-01-10 02:34:42,829 INFO L226 Difference]: Without dead ends: 7919 [2022-01-10 02:34:42,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-01-10 02:34:42,835 INFO L933 BasicCegarLoop]: 761 mSDtfsCounter, 2028 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2097 SdHoareTripleChecker+Valid, 2456 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:42,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2097 Valid, 2456 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1848 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 02:34:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7919 states. [2022-01-10 02:34:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7919 to 5271. [2022-01-10 02:34:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5271 states, 4150 states have (on average 1.28) internal successors, (5312), 4213 states have internal predecessors, (5312), 552 states have call successors, (552), 451 states have call predecessors, (552), 567 states have return successors, (804), 613 states have call predecessors, (804), 551 states have call successors, (804) [2022-01-10 02:34:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5271 states to 5271 states and 6668 transitions. [2022-01-10 02:34:43,229 INFO L78 Accepts]: Start accepts. Automaton has 5271 states and 6668 transitions. Word has length 74 [2022-01-10 02:34:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:43,229 INFO L470 AbstractCegarLoop]: Abstraction has 5271 states and 6668 transitions. [2022-01-10 02:34:43,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-01-10 02:34:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5271 states and 6668 transitions. [2022-01-10 02:34:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 02:34:43,233 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:43,233 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:43,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 02:34:43,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 02:34:43,454 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:43,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1804001536, now seen corresponding path program 2 times [2022-01-10 02:34:43,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:43,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717261980] [2022-01-10 02:34:43,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:43,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:43,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:43,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717261980] [2022-01-10 02:34:43,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717261980] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:43,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:43,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:43,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979206277] [2022-01-10 02:34:43,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:43,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:43,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:43,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:43,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:43,523 INFO L87 Difference]: Start difference. First operand 5271 states and 6668 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 02:34:44,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:44,093 INFO L93 Difference]: Finished difference Result 7953 states and 10041 transitions. [2022-01-10 02:34:44,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:34:44,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-01-10 02:34:44,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:44,119 INFO L225 Difference]: With dead ends: 7953 [2022-01-10 02:34:44,119 INFO L226 Difference]: Without dead ends: 3878 [2022-01-10 02:34:44,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:34:44,130 INFO L933 BasicCegarLoop]: 653 mSDtfsCounter, 1066 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:44,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1099 Valid, 1590 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:34:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2022-01-10 02:34:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 3643. [2022-01-10 02:34:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3643 states, 2878 states have (on average 1.2689367616400278) internal successors, (3652), 2919 states have internal predecessors, (3652), 384 states have call successors, (384), 307 states have call predecessors, (384), 379 states have return successors, (530), 423 states have call predecessors, (530), 383 states have call successors, (530) [2022-01-10 02:34:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4566 transitions. [2022-01-10 02:34:44,342 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4566 transitions. Word has length 77 [2022-01-10 02:34:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:44,342 INFO L470 AbstractCegarLoop]: Abstraction has 3643 states and 4566 transitions. [2022-01-10 02:34:44,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 02:34:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4566 transitions. [2022-01-10 02:34:44,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 02:34:44,347 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:44,347 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:44,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 02:34:44,347 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:44,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:44,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1529654834, now seen corresponding path program 1 times [2022-01-10 02:34:44,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:44,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4510449] [2022-01-10 02:34:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:44,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:34:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 02:34:44,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:44,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4510449] [2022-01-10 02:34:44,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4510449] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:44,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:44,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:34:44,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241325257] [2022-01-10 02:34:44,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:44,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:34:44,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:44,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:34:44,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:44,439 INFO L87 Difference]: Start difference. First operand 3643 states and 4566 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:34:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:45,674 INFO L93 Difference]: Finished difference Result 10515 states and 12983 transitions. [2022-01-10 02:34:45,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 02:34:45,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-01-10 02:34:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:45,697 INFO L225 Difference]: With dead ends: 10515 [2022-01-10 02:34:45,697 INFO L226 Difference]: Without dead ends: 5878 [2022-01-10 02:34:45,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-01-10 02:34:45,709 INFO L933 BasicCegarLoop]: 657 mSDtfsCounter, 1556 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:45,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1572 Valid, 1849 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:34:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2022-01-10 02:34:45,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5558. [2022-01-10 02:34:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5558 states, 4336 states have (on average 1.2396217712177122) internal successors, (5375), 4420 states have internal predecessors, (5375), 588 states have call successors, (588), 481 states have call predecessors, (588), 632 states have return successors, (912), 663 states have call predecessors, (912), 587 states have call successors, (912) [2022-01-10 02:34:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 6875 transitions. [2022-01-10 02:34:46,016 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 6875 transitions. Word has length 84 [2022-01-10 02:34:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:46,017 INFO L470 AbstractCegarLoop]: Abstraction has 5558 states and 6875 transitions. [2022-01-10 02:34:46,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:34:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 6875 transitions. [2022-01-10 02:34:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 02:34:46,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:46,021 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:46,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 02:34:46,022 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:46,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:46,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1318594338, now seen corresponding path program 1 times [2022-01-10 02:34:46,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:46,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175749810] [2022-01-10 02:34:46,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:46,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:46,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:46,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:46,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:46,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:46,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:46,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:46,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:46,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 02:34:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 02:34:46,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:46,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175749810] [2022-01-10 02:34:46,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175749810] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:46,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:46,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:34:46,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039453318] [2022-01-10 02:34:46,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:46,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:34:46,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:46,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:34:46,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:46,148 INFO L87 Difference]: Start difference. First operand 5558 states and 6875 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:34:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:47,584 INFO L93 Difference]: Finished difference Result 9561 states and 11715 transitions. [2022-01-10 02:34:47,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 02:34:47,584 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-01-10 02:34:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:47,649 INFO L225 Difference]: With dead ends: 9561 [2022-01-10 02:34:47,649 INFO L226 Difference]: Without dead ends: 4968 [2022-01-10 02:34:47,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-01-10 02:34:47,659 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 2121 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:47,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2164 Valid, 2164 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:34:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4968 states. [2022-01-10 02:34:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4968 to 4634. [2022-01-10 02:34:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4634 states, 3625 states have (on average 1.234206896551724) internal successors, (4474), 3691 states have internal predecessors, (4474), 489 states have call successors, (489), 396 states have call predecessors, (489), 518 states have return successors, (690), 553 states have call predecessors, (690), 488 states have call successors, (690) [2022-01-10 02:34:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4634 states to 4634 states and 5653 transitions. [2022-01-10 02:34:47,896 INFO L78 Accepts]: Start accepts. Automaton has 4634 states and 5653 transitions. Word has length 93 [2022-01-10 02:34:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:47,896 INFO L470 AbstractCegarLoop]: Abstraction has 4634 states and 5653 transitions. [2022-01-10 02:34:47,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:34:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4634 states and 5653 transitions. [2022-01-10 02:34:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:34:47,903 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:47,903 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:47,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 02:34:47,904 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:47,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash -162152600, now seen corresponding path program 1 times [2022-01-10 02:34:47,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:47,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575678932] [2022-01-10 02:34:47,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:47,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:47,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:47,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:47,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:47,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:47,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:47,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:47,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:34:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:34:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 02:34:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:34:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-10 02:34:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-10 02:34:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-01-10 02:34:48,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:48,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575678932] [2022-01-10 02:34:48,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575678932] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:48,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182029684] [2022-01-10 02:34:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:48,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:48,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:48,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:48,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 02:34:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:34:48,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 02:34:48,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:48,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182029684] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:48,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:48,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-01-10 02:34:48,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812140390] [2022-01-10 02:34:48,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:48,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:48,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:48,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:48,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:34:48,396 INFO L87 Difference]: Start difference. First operand 4634 states and 5653 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-01-10 02:34:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:48,559 INFO L93 Difference]: Finished difference Result 6800 states and 8276 transitions. [2022-01-10 02:34:48,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:34:48,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-01-10 02:34:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:48,569 INFO L225 Difference]: With dead ends: 6800 [2022-01-10 02:34:48,569 INFO L226 Difference]: Without dead ends: 2495 [2022-01-10 02:34:48,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:34:48,578 INFO L933 BasicCegarLoop]: 601 mSDtfsCounter, 34 mSDsluCounter, 2367 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:48,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 2968 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2022-01-10 02:34:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2370. [2022-01-10 02:34:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 1938 states have (on average 1.2487100103199174) internal successors, (2420), 1953 states have internal predecessors, (2420), 213 states have call successors, (213), 162 states have call predecessors, (213), 217 states have return successors, (297), 255 states have call predecessors, (297), 212 states have call successors, (297) [2022-01-10 02:34:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 2930 transitions. [2022-01-10 02:34:48,698 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 2930 transitions. Word has length 145 [2022-01-10 02:34:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:48,699 INFO L470 AbstractCegarLoop]: Abstraction has 2370 states and 2930 transitions. [2022-01-10 02:34:48,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-01-10 02:34:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2930 transitions. [2022-01-10 02:34:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-01-10 02:34:48,704 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:48,704 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:48,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 02:34:48,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-10 02:34:48,932 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash -35746380, now seen corresponding path program 1 times [2022-01-10 02:34:48,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:48,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805374962] [2022-01-10 02:34:48,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:48,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:34:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-10 02:34:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 02:34:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 02:34:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 02:34:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-01-10 02:34:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-10 02:34:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-01-10 02:34:49,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:49,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805374962] [2022-01-10 02:34:49,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805374962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:49,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:49,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:49,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726208928] [2022-01-10 02:34:49,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:49,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:49,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:49,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:49,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:49,027 INFO L87 Difference]: Start difference. First operand 2370 states and 2930 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 02:34:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:49,548 INFO L93 Difference]: Finished difference Result 2435 states and 2998 transitions. [2022-01-10 02:34:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:34:49,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2022-01-10 02:34:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:49,555 INFO L225 Difference]: With dead ends: 2435 [2022-01-10 02:34:49,555 INFO L226 Difference]: Without dead ends: 1992 [2022-01-10 02:34:49,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:34:49,558 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 631 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:49,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 1611 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:34:49,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-01-10 02:34:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1930. [2022-01-10 02:34:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1594 states have (on average 1.2647427854454203) internal successors, (2016), 1606 states have internal predecessors, (2016), 167 states have call successors, (167), 122 states have call predecessors, (167), 167 states have return successors, (233), 202 states have call predecessors, (233), 166 states have call successors, (233) [2022-01-10 02:34:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2416 transitions. [2022-01-10 02:34:49,694 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2416 transitions. Word has length 147 [2022-01-10 02:34:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:49,694 INFO L470 AbstractCegarLoop]: Abstraction has 1930 states and 2416 transitions. [2022-01-10 02:34:49,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 02:34:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2416 transitions. [2022-01-10 02:34:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:34:49,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:49,699 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:49,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 02:34:49,699 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:49,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:49,700 INFO L85 PathProgramCache]: Analyzing trace with hash -854471620, now seen corresponding path program 1 times [2022-01-10 02:34:49,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:49,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287343808] [2022-01-10 02:34:49,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:49,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:34:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:34:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:34:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:34:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:49,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:49,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287343808] [2022-01-10 02:34:49,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287343808] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:49,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:49,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:34:49,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213265353] [2022-01-10 02:34:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:49,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:34:49,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:49,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:34:49,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:34:49,808 INFO L87 Difference]: Start difference. First operand 1930 states and 2416 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:34:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:50,931 INFO L93 Difference]: Finished difference Result 2333 states and 3064 transitions. [2022-01-10 02:34:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:34:50,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-01-10 02:34:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:50,937 INFO L225 Difference]: With dead ends: 2333 [2022-01-10 02:34:50,937 INFO L226 Difference]: Without dead ends: 2039 [2022-01-10 02:34:50,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:50,940 INFO L933 BasicCegarLoop]: 642 mSDtfsCounter, 907 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:50,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 1120 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:34:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2022-01-10 02:34:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 1930. [2022-01-10 02:34:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1594 states have (on average 1.2641154328732749) internal successors, (2015), 1606 states have internal predecessors, (2015), 167 states have call successors, (167), 122 states have call predecessors, (167), 167 states have return successors, (233), 202 states have call predecessors, (233), 166 states have call successors, (233) [2022-01-10 02:34:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2415 transitions. [2022-01-10 02:34:51,127 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2415 transitions. Word has length 145 [2022-01-10 02:34:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:51,128 INFO L470 AbstractCegarLoop]: Abstraction has 1930 states and 2415 transitions. [2022-01-10 02:34:51,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:34:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2415 transitions. [2022-01-10 02:34:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:34:51,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:51,133 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:51,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 02:34:51,133 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2041542074, now seen corresponding path program 1 times [2022-01-10 02:34:51,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:51,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138219045] [2022-01-10 02:34:51,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:51,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:34:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:34:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:34:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:34:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:51,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:51,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138219045] [2022-01-10 02:34:51,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138219045] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:51,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:51,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:51,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828886627] [2022-01-10 02:34:51,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:51,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:51,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:51,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:51,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:51,252 INFO L87 Difference]: Start difference. First operand 1930 states and 2415 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:34:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:53,240 INFO L93 Difference]: Finished difference Result 2730 states and 3702 transitions. [2022-01-10 02:34:53,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:34:53,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-01-10 02:34:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:53,246 INFO L225 Difference]: With dead ends: 2730 [2022-01-10 02:34:53,246 INFO L226 Difference]: Without dead ends: 2445 [2022-01-10 02:34:53,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:34:53,248 INFO L933 BasicCegarLoop]: 674 mSDtfsCounter, 1423 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:53,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1449 Valid, 1585 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-10 02:34:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2022-01-10 02:34:53,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2228. [2022-01-10 02:34:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1867 states have (on average 1.3111944295661488) internal successors, (2448), 1880 states have internal predecessors, (2448), 185 states have call successors, (185), 128 states have call predecessors, (185), 174 states have return successors, (254), 220 states have call predecessors, (254), 184 states have call successors, (254) [2022-01-10 02:34:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2887 transitions. [2022-01-10 02:34:53,386 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2887 transitions. Word has length 145 [2022-01-10 02:34:53,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:53,387 INFO L470 AbstractCegarLoop]: Abstraction has 2228 states and 2887 transitions. [2022-01-10 02:34:53,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:34:53,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2887 transitions. [2022-01-10 02:34:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:34:53,391 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:53,391 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:53,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 02:34:53,392 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:53,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1334945468, now seen corresponding path program 1 times [2022-01-10 02:34:53,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:53,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753836403] [2022-01-10 02:34:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:53,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:34:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:34:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:34:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:53,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:34:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:53,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:53,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753836403] [2022-01-10 02:34:53,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753836403] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:53,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:53,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:53,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564948815] [2022-01-10 02:34:53,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:53,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:53,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:53,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:53,546 INFO L87 Difference]: Start difference. First operand 2228 states and 2887 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:34:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:56,319 INFO L93 Difference]: Finished difference Result 3448 states and 4849 transitions. [2022-01-10 02:34:56,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:56,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-01-10 02:34:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:56,328 INFO L225 Difference]: With dead ends: 3448 [2022-01-10 02:34:56,328 INFO L226 Difference]: Without dead ends: 2865 [2022-01-10 02:34:56,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:34:56,331 INFO L933 BasicCegarLoop]: 909 mSDtfsCounter, 1440 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:56,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1466 Valid, 2605 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 02:34:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2022-01-10 02:34:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2505. [2022-01-10 02:34:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2119 states have (on average 1.339782916470033) internal successors, (2839), 2133 states have internal predecessors, (2839), 203 states have call successors, (203), 134 states have call predecessors, (203), 181 states have return successors, (274), 239 states have call predecessors, (274), 202 states have call successors, (274) [2022-01-10 02:34:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3316 transitions. [2022-01-10 02:34:56,518 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3316 transitions. Word has length 145 [2022-01-10 02:34:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:56,518 INFO L470 AbstractCegarLoop]: Abstraction has 2505 states and 3316 transitions. [2022-01-10 02:34:56,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:34:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3316 transitions. [2022-01-10 02:34:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:34:56,523 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:56,523 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:56,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 02:34:56,523 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:56,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2012983942, now seen corresponding path program 1 times [2022-01-10 02:34:56,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:56,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211371920] [2022-01-10 02:34:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:56,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:56,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:56,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:34:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:56,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:34:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:56,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:34:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:56,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:34:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:56,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:56,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211371920] [2022-01-10 02:34:56,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211371920] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:56,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:56,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:56,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076385770] [2022-01-10 02:34:56,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:56,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:56,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:56,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:56,629 INFO L87 Difference]: Start difference. First operand 2505 states and 3316 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:34:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:59,112 INFO L93 Difference]: Finished difference Result 4506 states and 6526 transitions. [2022-01-10 02:34:59,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:59,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-01-10 02:34:59,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:59,126 INFO L225 Difference]: With dead ends: 4506 [2022-01-10 02:34:59,126 INFO L226 Difference]: Without dead ends: 3646 [2022-01-10 02:34:59,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:34:59,133 INFO L933 BasicCegarLoop]: 901 mSDtfsCounter, 1437 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 2637 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:59,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1463 Valid, 2597 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2637 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-10 02:34:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2022-01-10 02:34:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 3060. [2022-01-10 02:34:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 2624 states have (on average 1.3803353658536586) internal successors, (3622), 2640 states have internal predecessors, (3622), 239 states have call successors, (239), 146 states have call predecessors, (239), 195 states have return successors, (318), 277 states have call predecessors, (318), 238 states have call successors, (318) [2022-01-10 02:34:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 4179 transitions. [2022-01-10 02:34:59,315 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 4179 transitions. Word has length 145 [2022-01-10 02:34:59,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:59,315 INFO L470 AbstractCegarLoop]: Abstraction has 3060 states and 4179 transitions. [2022-01-10 02:34:59,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:34:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 4179 transitions. [2022-01-10 02:34:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:34:59,320 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:59,320 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:59,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 02:34:59,321 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:59,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:59,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1151150340, now seen corresponding path program 1 times [2022-01-10 02:34:59,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:59,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736595896] [2022-01-10 02:34:59,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:59,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:59,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:59,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:34:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:59,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:34:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:59,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:34:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:59,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:34:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:59,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:59,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736595896] [2022-01-10 02:34:59,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736595896] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:59,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:59,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:59,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906309222] [2022-01-10 02:34:59,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:59,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:59,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:59,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:59,446 INFO L87 Difference]: Start difference. First operand 3060 states and 4179 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:02,147 INFO L93 Difference]: Finished difference Result 6541 states and 9733 transitions. [2022-01-10 02:35:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:35:02,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-01-10 02:35:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:02,162 INFO L225 Difference]: With dead ends: 6541 [2022-01-10 02:35:02,162 INFO L226 Difference]: Without dead ends: 5126 [2022-01-10 02:35:02,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:35:02,168 INFO L933 BasicCegarLoop]: 897 mSDtfsCounter, 1433 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 2593 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:02,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1459 Valid, 2593 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2632 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-10 02:35:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2022-01-10 02:35:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 4171. [2022-01-10 02:35:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 3635 states have (on average 1.427235213204952) internal successors, (5188), 3655 states have internal predecessors, (5188), 311 states have call successors, (311), 170 states have call predecessors, (311), 223 states have return successors, (412), 353 states have call predecessors, (412), 310 states have call successors, (412) [2022-01-10 02:35:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 5911 transitions. [2022-01-10 02:35:02,462 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 5911 transitions. Word has length 145 [2022-01-10 02:35:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:02,462 INFO L470 AbstractCegarLoop]: Abstraction has 4171 states and 5911 transitions. [2022-01-10 02:35:02,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5911 transitions. [2022-01-10 02:35:02,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:35:02,468 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:02,468 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:02,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 02:35:02,469 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:02,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1093408058, now seen corresponding path program 1 times [2022-01-10 02:35:02,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:02,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405881345] [2022-01-10 02:35:02,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:02,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:02,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:02,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:35:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:02,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:35:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:02,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:35:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:02,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:35:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:02,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:02,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405881345] [2022-01-10 02:35:02,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405881345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:02,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:02,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:02,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110302844] [2022-01-10 02:35:02,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:02,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:02,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:02,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:02,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:02,600 INFO L87 Difference]: Start difference. First operand 4171 states and 5911 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:05,287 INFO L93 Difference]: Finished difference Result 10610 states and 16163 transitions. [2022-01-10 02:35:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:35:05,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-01-10 02:35:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:05,316 INFO L225 Difference]: With dead ends: 10610 [2022-01-10 02:35:05,316 INFO L226 Difference]: Without dead ends: 8084 [2022-01-10 02:35:05,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:35:05,326 INFO L933 BasicCegarLoop]: 893 mSDtfsCounter, 1429 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 2627 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 2589 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:05,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1455 Valid, 2589 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2627 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-10 02:35:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8084 states. [2022-01-10 02:35:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8084 to 6398. [2022-01-10 02:35:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6398 states, 5662 states have (on average 1.4705051218650653) internal successors, (8326), 5690 states have internal predecessors, (8326), 455 states have call successors, (455), 218 states have call predecessors, (455), 279 states have return successors, (618), 505 states have call predecessors, (618), 454 states have call successors, (618) [2022-01-10 02:35:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6398 states to 6398 states and 9399 transitions. [2022-01-10 02:35:05,788 INFO L78 Accepts]: Start accepts. Automaton has 6398 states and 9399 transitions. Word has length 145 [2022-01-10 02:35:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:05,788 INFO L470 AbstractCegarLoop]: Abstraction has 6398 states and 9399 transitions. [2022-01-10 02:35:05,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 6398 states and 9399 transitions. [2022-01-10 02:35:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:35:05,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:05,796 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:05,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 02:35:05,796 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:05,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:05,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1581455164, now seen corresponding path program 1 times [2022-01-10 02:35:05,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:05,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980020681] [2022-01-10 02:35:05,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:05,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:35:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:35:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:35:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:35:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:05,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:05,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980020681] [2022-01-10 02:35:05,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980020681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:05,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:05,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:05,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801377352] [2022-01-10 02:35:05,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:05,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:05,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:05,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:05,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:05,982 INFO L87 Difference]: Start difference. First operand 6398 states and 9399 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:07,631 INFO L93 Difference]: Finished difference Result 12915 states and 19874 transitions. [2022-01-10 02:35:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:35:07,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-01-10 02:35:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:07,657 INFO L225 Difference]: With dead ends: 12915 [2022-01-10 02:35:07,657 INFO L226 Difference]: Without dead ends: 8162 [2022-01-10 02:35:07,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:35:07,669 INFO L933 BasicCegarLoop]: 611 mSDtfsCounter, 1090 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:07,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1117 Valid, 1558 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 02:35:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8162 states. [2022-01-10 02:35:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8162 to 6398. [2022-01-10 02:35:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6398 states, 5662 states have (on average 1.467502649240551) internal successors, (8309), 5690 states have internal predecessors, (8309), 455 states have call successors, (455), 218 states have call predecessors, (455), 279 states have return successors, (618), 505 states have call predecessors, (618), 454 states have call successors, (618) [2022-01-10 02:35:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6398 states to 6398 states and 9382 transitions. [2022-01-10 02:35:08,084 INFO L78 Accepts]: Start accepts. Automaton has 6398 states and 9382 transitions. Word has length 145 [2022-01-10 02:35:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:08,084 INFO L470 AbstractCegarLoop]: Abstraction has 6398 states and 9382 transitions. [2022-01-10 02:35:08,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6398 states and 9382 transitions. [2022-01-10 02:35:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:35:08,092 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:08,092 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:08,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 02:35:08,092 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:08,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:08,093 INFO L85 PathProgramCache]: Analyzing trace with hash 488819962, now seen corresponding path program 1 times [2022-01-10 02:35:08,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:08,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319076468] [2022-01-10 02:35:08,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:08,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:08,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:08,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:35:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:35:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:35:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:35:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:08,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:08,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319076468] [2022-01-10 02:35:08,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319076468] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:08,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:08,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:08,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407133092] [2022-01-10 02:35:08,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:08,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:08,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:08,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:08,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:08,201 INFO L87 Difference]: Start difference. First operand 6398 states and 9382 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:09,960 INFO L93 Difference]: Finished difference Result 12897 states and 19788 transitions. [2022-01-10 02:35:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:35:09,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-01-10 02:35:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:09,980 INFO L225 Difference]: With dead ends: 12897 [2022-01-10 02:35:09,980 INFO L226 Difference]: Without dead ends: 8144 [2022-01-10 02:35:09,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:35:09,992 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 1272 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:09,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1299 Valid, 1345 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:35:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8144 states. [2022-01-10 02:35:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8144 to 6398. [2022-01-10 02:35:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6398 states, 5662 states have (on average 1.4645001766160368) internal successors, (8292), 5690 states have internal predecessors, (8292), 455 states have call successors, (455), 218 states have call predecessors, (455), 279 states have return successors, (618), 505 states have call predecessors, (618), 454 states have call successors, (618) [2022-01-10 02:35:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6398 states to 6398 states and 9365 transitions. [2022-01-10 02:35:10,465 INFO L78 Accepts]: Start accepts. Automaton has 6398 states and 9365 transitions. Word has length 145 [2022-01-10 02:35:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:10,465 INFO L470 AbstractCegarLoop]: Abstraction has 6398 states and 9365 transitions. [2022-01-10 02:35:10,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 6398 states and 9365 transitions. [2022-01-10 02:35:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:35:10,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:10,471 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:10,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 02:35:10,471 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash -793352324, now seen corresponding path program 1 times [2022-01-10 02:35:10,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:10,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204896314] [2022-01-10 02:35:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:10,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:35:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:35:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:35:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:35:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:10,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:10,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204896314] [2022-01-10 02:35:10,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204896314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:10,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:10,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:10,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746523834] [2022-01-10 02:35:10,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:10,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:10,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:10,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:10,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:10,581 INFO L87 Difference]: Start difference. First operand 6398 states and 9365 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:13,676 INFO L93 Difference]: Finished difference Result 18692 states and 28809 transitions. [2022-01-10 02:35:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:35:13,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-01-10 02:35:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:13,711 INFO L225 Difference]: With dead ends: 18692 [2022-01-10 02:35:13,711 INFO L226 Difference]: Without dead ends: 13939 [2022-01-10 02:35:13,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:35:13,724 INFO L933 BasicCegarLoop]: 685 mSDtfsCounter, 1496 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:13,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1522 Valid, 1881 Invalid, 2452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-10 02:35:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13939 states. [2022-01-10 02:35:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13939 to 10914. [2022-01-10 02:35:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10914 states, 9778 states have (on average 1.4953978318674574) internal successors, (14622), 9822 states have internal predecessors, (14622), 743 states have call successors, (743), 314 states have call predecessors, (743), 391 states have return successors, (1084), 809 states have call predecessors, (1084), 742 states have call successors, (1084) [2022-01-10 02:35:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10914 states to 10914 states and 16449 transitions. [2022-01-10 02:35:14,514 INFO L78 Accepts]: Start accepts. Automaton has 10914 states and 16449 transitions. Word has length 145 [2022-01-10 02:35:14,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:14,514 INFO L470 AbstractCegarLoop]: Abstraction has 10914 states and 16449 transitions. [2022-01-10 02:35:14,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 10914 states and 16449 transitions. [2022-01-10 02:35:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:35:14,523 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:14,523 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:14,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 02:35:14,524 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:14,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:14,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1779612286, now seen corresponding path program 1 times [2022-01-10 02:35:14,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:14,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092440735] [2022-01-10 02:35:14,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:14,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:35:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:35:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:35:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:35:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:14,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:14,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092440735] [2022-01-10 02:35:14,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092440735] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:14,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:14,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:14,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303987421] [2022-01-10 02:35:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:14,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:14,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:14,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:14,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:14,626 INFO L87 Difference]: Start difference. First operand 10914 states and 16449 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:16,633 INFO L93 Difference]: Finished difference Result 23347 states and 36376 transitions. [2022-01-10 02:35:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:35:16,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-01-10 02:35:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:16,668 INFO L225 Difference]: With dead ends: 23347 [2022-01-10 02:35:16,668 INFO L226 Difference]: Without dead ends: 14078 [2022-01-10 02:35:16,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:35:16,685 INFO L933 BasicCegarLoop]: 596 mSDtfsCounter, 1269 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:16,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1296 Valid, 1336 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:35:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14078 states. [2022-01-10 02:35:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14078 to 10914. [2022-01-10 02:35:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10914 states, 9778 states have (on average 1.4920229085702599) internal successors, (14589), 9822 states have internal predecessors, (14589), 743 states have call successors, (743), 314 states have call predecessors, (743), 391 states have return successors, (1084), 809 states have call predecessors, (1084), 742 states have call successors, (1084) [2022-01-10 02:35:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10914 states to 10914 states and 16416 transitions. [2022-01-10 02:35:17,633 INFO L78 Accepts]: Start accepts. Automaton has 10914 states and 16416 transitions. Word has length 145 [2022-01-10 02:35:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:17,634 INFO L470 AbstractCegarLoop]: Abstraction has 10914 states and 16416 transitions. [2022-01-10 02:35:17,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 10914 states and 16416 transitions. [2022-01-10 02:35:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:35:17,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:17,642 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:17,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 02:35:17,642 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1446969148, now seen corresponding path program 1 times [2022-01-10 02:35:17,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:17,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090760151] [2022-01-10 02:35:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:17,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:17,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:17,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:35:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:17,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:35:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:17,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:35:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:35:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:17,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:17,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090760151] [2022-01-10 02:35:17,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090760151] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:17,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:17,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:17,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602812167] [2022-01-10 02:35:17,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:17,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:17,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:17,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:17,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:17,755 INFO L87 Difference]: Start difference. First operand 10914 states and 16416 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)