/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.07.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:34:14,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:34:14,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:34:14,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:34:14,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:34:14,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:34:14,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:34:14,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:34:14,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:34:14,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:34:14,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:34:14,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:34:14,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:34:14,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:34:14,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:34:14,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:34:14,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:34:14,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:34:14,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:34:14,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:34:14,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:34:14,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:34:14,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:34:14,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:34:14,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:34:14,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:34:14,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:34:14,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:34:14,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:34:14,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:34:14,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:34:14,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:34:14,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:34:14,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:34:14,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:34:14,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:34:14,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:34:14,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:34:14,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:34:14,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:34:14,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:34:14,378 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:14,398 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:34:14,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:34:14,399 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:34:14,399 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:34:14,401 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:34:14,401 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:34:14,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:34:14,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:34:14,402 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:34:14,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:34:14,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:34:14,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:34:14,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:34:14,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:34:14,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:34:14,403 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:34:14,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:34:14,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:34:14,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:34:14,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:34:14,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:34:14,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:34:14,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:34:14,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:34:14,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:34:14,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 02:34:14,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 02:34:14,404 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:34:14,404 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:34:14,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:34:14,404 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:14,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:34:14,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:34:14,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:34:14,584 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:34:14,584 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:34:14,585 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.07.cil-1.c [2022-01-10 02:34:14,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797297aa0/ec4adc26a8764aaab1f483edfd2b35e7/FLAGf112ecfc5 [2022-01-10 02:34:15,032 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:34:15,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-1.c [2022-01-10 02:34:15,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797297aa0/ec4adc26a8764aaab1f483edfd2b35e7/FLAGf112ecfc5 [2022-01-10 02:34:15,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797297aa0/ec4adc26a8764aaab1f483edfd2b35e7 [2022-01-10 02:34:15,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:34:15,064 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:34:15,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:34:15,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:34:15,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:34:15,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:15" (1/1) ... [2022-01-10 02:34:15,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677a5793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:15, skipping insertion in model container [2022-01-10 02:34:15,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:15" (1/1) ... [2022-01-10 02:34:15,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:34:15,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:34:15,260 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.07.cil-1.c[914,927] [2022-01-10 02:34:15,316 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.07.cil-1.c[7115,7128] [2022-01-10 02:34:15,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:34:15,391 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:34:15,399 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.07.cil-1.c[914,927] [2022-01-10 02:34:15,417 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.07.cil-1.c[7115,7128] [2022-01-10 02:34:15,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:34:15,474 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:34:15,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:15 WrapperNode [2022-01-10 02:34:15,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:34:15,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:34:15,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:34:15,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:34:15,480 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:15" (1/1) ... [2022-01-10 02:34:15,499 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:15" (1/1) ... [2022-01-10 02:34:15,534 INFO L137 Inliner]: procedures = 67, calls = 78, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 750 [2022-01-10 02:34:15,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:34:15,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:34:15,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:34:15,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:34:15,550 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:15" (1/1) ... [2022-01-10 02:34:15,550 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:15" (1/1) ... [2022-01-10 02:34:15,553 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:15" (1/1) ... [2022-01-10 02:34:15,553 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:15" (1/1) ... [2022-01-10 02:34:15,560 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:15" (1/1) ... [2022-01-10 02:34:15,588 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:15" (1/1) ... [2022-01-10 02:34:15,590 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:15" (1/1) ... [2022-01-10 02:34:15,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:34:15,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:34:15,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:34:15,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:34:15,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:15" (1/1) ... [2022-01-10 02:34:15,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:34:15,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:15,635 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:15,642 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:15,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:34:15,662 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 02:34:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 02:34:15,662 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-01-10 02:34:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-01-10 02:34:15,662 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 02:34:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 02:34:15,662 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 02:34:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 02:34:15,662 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-01-10 02:34:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-01-10 02:34:15,662 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 02:34:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 02:34:15,662 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 02:34:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 02:34:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-01-10 02:34:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-01-10 02:34:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-01-10 02:34:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-01-10 02:34:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-01-10 02:34:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-01-10 02:34:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 02:34:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 02:34:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 02:34:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 02:34:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 02:34:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-01-10 02:34:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-01-10 02:34:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:34:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:34:15,664 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 02:34:15,664 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 02:34:15,758 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:34:15,774 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:34:16,228 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:34:16,235 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:34:16,235 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-01-10 02:34:16,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:16 BoogieIcfgContainer [2022-01-10 02:34:16,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:34:16,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:34:16,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:34:16,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:34:16,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:34:15" (1/3) ... [2022-01-10 02:34:16,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0eff94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:16, skipping insertion in model container [2022-01-10 02:34:16,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:15" (2/3) ... [2022-01-10 02:34:16,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0eff94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:16, skipping insertion in model container [2022-01-10 02:34:16,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:16" (3/3) ... [2022-01-10 02:34:16,244 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.07.cil-1.c [2022-01-10 02:34:16,247 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:34:16,248 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 02:34:16,277 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:34:16,281 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:16,282 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 02:34:16,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 312 states have internal predecessors, (494), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-01-10 02:34:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:16,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:16,303 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:16,304 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:16,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2006337748, now seen corresponding path program 1 times [2022-01-10 02:34:16,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:16,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934725912] [2022-01-10 02:34:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:16,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,588 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:16,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:16,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934725912] [2022-01-10 02:34:16,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934725912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:16,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:16,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:16,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62864422] [2022-01-10 02:34:16,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:16,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:16,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:16,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:16,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:16,626 INFO L87 Difference]: Start difference. First operand has 358 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 312 states have internal predecessors, (494), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:34:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:17,250 INFO L93 Difference]: Finished difference Result 712 states and 1119 transitions. [2022-01-10 02:34:17,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 02:34:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 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:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:17,268 INFO L225 Difference]: With dead ends: 712 [2022-01-10 02:34:17,268 INFO L226 Difference]: Without dead ends: 366 [2022-01-10 02:34:17,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:34:17,277 INFO L933 BasicCegarLoop]: 523 mSDtfsCounter, 770 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:17,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [781 Valid, 1197 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:34:17,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-01-10 02:34:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 348. [2022-01-10 02:34:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 302 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-01-10 02:34:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 521 transitions. [2022-01-10 02:34:17,322 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 521 transitions. Word has length 65 [2022-01-10 02:34:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:17,322 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 521 transitions. [2022-01-10 02:34:17,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:34:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 521 transitions. [2022-01-10 02:34:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:17,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:17,341 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:17,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 02:34:17,342 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:17,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:17,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2047012498, now seen corresponding path program 1 times [2022-01-10 02:34:17,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:17,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502885347] [2022-01-10 02:34:17,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:17,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,478 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:17,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:17,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502885347] [2022-01-10 02:34:17,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502885347] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:17,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:17,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:34:17,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945296562] [2022-01-10 02:34:17,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:17,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:34:17,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:17,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:34:17,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:17,481 INFO L87 Difference]: Start difference. First operand 348 states and 521 transitions. 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:18,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:18,208 INFO L93 Difference]: Finished difference Result 571 states and 835 transitions. [2022-01-10 02:34:18,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:18,209 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:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:18,211 INFO L225 Difference]: With dead ends: 571 [2022-01-10 02:34:18,211 INFO L226 Difference]: Without dead ends: 483 [2022-01-10 02:34:18,212 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:18,213 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 652 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:18,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [658 Valid, 1939 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:34:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-01-10 02:34:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 444. [2022-01-10 02:34:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 380 states have internal predecessors, (557), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-01-10 02:34:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 652 transitions. [2022-01-10 02:34:18,239 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 652 transitions. Word has length 65 [2022-01-10 02:34:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:18,239 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 652 transitions. [2022-01-10 02:34:18,239 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:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 652 transitions. [2022-01-10 02:34:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:18,241 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:18,241 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:18,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 02:34:18,241 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:18,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:18,242 INFO L85 PathProgramCache]: Analyzing trace with hash -368123858, now seen corresponding path program 1 times [2022-01-10 02:34:18,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:18,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050084493] [2022-01-10 02:34:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:18,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,335 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:18,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:18,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050084493] [2022-01-10 02:34:18,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050084493] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:18,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:18,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:34:18,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445322241] [2022-01-10 02:34:18,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:18,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:34:18,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:18,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:34:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:18,337 INFO L87 Difference]: Start difference. First operand 444 states and 652 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:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:19,123 INFO L93 Difference]: Finished difference Result 791 states and 1128 transitions. [2022-01-10 02:34:19,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:34:19,124 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:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:19,129 INFO L225 Difference]: With dead ends: 791 [2022-01-10 02:34:19,129 INFO L226 Difference]: Without dead ends: 614 [2022-01-10 02:34:19,130 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:19,130 INFO L933 BasicCegarLoop]: 524 mSDtfsCounter, 1034 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:19,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1061 Valid, 1776 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:34:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-01-10 02:34:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 540. [2022-01-10 02:34:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 458 states have internal predecessors, (660), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-01-10 02:34:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 785 transitions. [2022-01-10 02:34:19,158 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 785 transitions. Word has length 65 [2022-01-10 02:34:19,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:19,158 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 785 transitions. [2022-01-10 02:34:19,159 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:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 785 transitions. [2022-01-10 02:34:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:19,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:19,160 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:19,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 02:34:19,161 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:19,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1898257328, now seen corresponding path program 1 times [2022-01-10 02:34:19,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:19,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85480211] [2022-01-10 02:34:19,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:19,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:19,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:19,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:19,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:19,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:19,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:19,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:19,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:19,240 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:19,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:19,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85480211] [2022-01-10 02:34:19,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85480211] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:19,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:19,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:34:19,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098196173] [2022-01-10 02:34:19,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:19,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:34:19,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:19,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:34:19,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:19,242 INFO L87 Difference]: Start difference. First operand 540 states and 785 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:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:19,896 INFO L93 Difference]: Finished difference Result 867 states and 1239 transitions. [2022-01-10 02:34:19,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:34:19,897 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:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:19,900 INFO L225 Difference]: With dead ends: 867 [2022-01-10 02:34:19,900 INFO L226 Difference]: Without dead ends: 600 [2022-01-10 02:34:19,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:34:19,901 INFO L933 BasicCegarLoop]: 508 mSDtfsCounter, 659 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:19,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 2026 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:34:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-01-10 02:34:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 555. [2022-01-10 02:34:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 470 states have internal predecessors, (672), 57 states have call successors, (57), 28 states have call predecessors, (57), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-01-10 02:34:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 800 transitions. [2022-01-10 02:34:19,920 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 800 transitions. Word has length 65 [2022-01-10 02:34:19,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:19,920 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 800 transitions. [2022-01-10 02:34:19,920 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:19,920 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 800 transitions. [2022-01-10 02:34:19,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:19,921 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:19,922 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:19,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 02:34:19,922 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:19,922 INFO L85 PathProgramCache]: Analyzing trace with hash 512053934, now seen corresponding path program 1 times [2022-01-10 02:34:19,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:19,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596568099] [2022-01-10 02:34:19,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:19,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:19,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:19,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:19,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,030 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:20,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:20,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596568099] [2022-01-10 02:34:20,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596568099] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:20,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:20,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:34:20,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616202159] [2022-01-10 02:34:20,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:20,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:34:20,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:20,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:34:20,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:20,033 INFO L87 Difference]: Start difference. First operand 555 states and 800 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:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:20,717 INFO L93 Difference]: Finished difference Result 873 states and 1232 transitions. [2022-01-10 02:34:20,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:34:20,717 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:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:20,719 INFO L225 Difference]: With dead ends: 873 [2022-01-10 02:34:20,720 INFO L226 Difference]: Without dead ends: 591 [2022-01-10 02:34:20,720 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:20,721 INFO L933 BasicCegarLoop]: 506 mSDtfsCounter, 669 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:20,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [670 Valid, 2024 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:34:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-01-10 02:34:20,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 560. [2022-01-10 02:34:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 466 states have (on average 1.446351931330472) internal successors, (674), 474 states have internal predecessors, (674), 57 states have call successors, (57), 28 states have call predecessors, (57), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-01-10 02:34:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 803 transitions. [2022-01-10 02:34:20,739 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 803 transitions. Word has length 65 [2022-01-10 02:34:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:20,740 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 803 transitions. [2022-01-10 02:34:20,740 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:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 803 transitions. [2022-01-10 02:34:20,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:20,741 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:20,741 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:20,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 02:34:20,741 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:20,742 INFO L85 PathProgramCache]: Analyzing trace with hash -517305364, now seen corresponding path program 1 times [2022-01-10 02:34:20,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:20,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045690706] [2022-01-10 02:34:20,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:20,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:20,834 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:20,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:20,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045690706] [2022-01-10 02:34:20,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045690706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:20,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:20,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 02:34:20,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969154173] [2022-01-10 02:34:20,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:20,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:34:20,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:34:20,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:34:20,838 INFO L87 Difference]: Start difference. First operand 560 states and 803 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:34:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:22,252 INFO L93 Difference]: Finished difference Result 1916 states and 2644 transitions. [2022-01-10 02:34:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 02:34:22,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-01-10 02:34:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:22,258 INFO L225 Difference]: With dead ends: 1916 [2022-01-10 02:34:22,258 INFO L226 Difference]: Without dead ends: 1611 [2022-01-10 02:34:22,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 02:34:22,261 INFO L933 BasicCegarLoop]: 607 mSDtfsCounter, 2741 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2760 SdHoareTripleChecker+Valid, 2277 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:22,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2760 Valid, 2277 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:34:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-01-10 02:34:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1476. [2022-01-10 02:34:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1216 states have internal predecessors, (1627), 145 states have call successors, (145), 111 states have call predecessors, (145), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-01-10 02:34:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1961 transitions. [2022-01-10 02:34:22,309 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1961 transitions. Word has length 65 [2022-01-10 02:34:22,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:22,309 INFO L470 AbstractCegarLoop]: Abstraction has 1476 states and 1961 transitions. [2022-01-10 02:34:22,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:34:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1961 transitions. [2022-01-10 02:34:22,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:22,310 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:22,310 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:22,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 02:34:22,310 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:22,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:22,310 INFO L85 PathProgramCache]: Analyzing trace with hash 462107460, now seen corresponding path program 1 times [2022-01-10 02:34:22,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:22,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557013554] [2022-01-10 02:34:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:22,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,393 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:22,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:22,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557013554] [2022-01-10 02:34:22,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557013554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:22,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:22,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:22,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192464972] [2022-01-10 02:34:22,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:22,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:22,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:22,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:22,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:22,394 INFO L87 Difference]: Start difference. First operand 1476 states and 1961 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:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:22,840 INFO L93 Difference]: Finished difference Result 3939 states and 5106 transitions. [2022-01-10 02:34:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:34:22,840 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:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:22,852 INFO L225 Difference]: With dead ends: 3939 [2022-01-10 02:34:22,852 INFO L226 Difference]: Without dead ends: 2725 [2022-01-10 02:34:22,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:34:22,857 INFO L933 BasicCegarLoop]: 484 mSDtfsCounter, 1514 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:22,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1541 Valid, 996 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:34:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2022-01-10 02:34:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2585. [2022-01-10 02:34:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2046 states have (on average 1.3064516129032258) internal successors, (2673), 2090 states have internal predecessors, (2673), 267 states have call successors, (267), 215 states have call predecessors, (267), 270 states have return successors, (393), 282 states have call predecessors, (393), 265 states have call successors, (393) [2022-01-10 02:34:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3333 transitions. [2022-01-10 02:34:22,971 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3333 transitions. Word has length 65 [2022-01-10 02:34:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:22,972 INFO L470 AbstractCegarLoop]: Abstraction has 2585 states and 3333 transitions. [2022-01-10 02:34:22,972 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:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3333 transitions. [2022-01-10 02:34:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:34:22,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:22,973 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:22,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 02:34:22,974 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:22,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2123328339, now seen corresponding path program 1 times [2022-01-10 02:34:22,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:22,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202401291] [2022-01-10 02:34:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:22,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,037 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:23,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:23,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202401291] [2022-01-10 02:34:23,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202401291] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:23,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:23,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:23,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045157402] [2022-01-10 02:34:23,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:23,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:23,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:23,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:23,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:23,039 INFO L87 Difference]: Start difference. First operand 2585 states and 3333 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:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:23,505 INFO L93 Difference]: Finished difference Result 5877 states and 7495 transitions. [2022-01-10 02:34:23,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:34:23,505 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:23,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:23,518 INFO L225 Difference]: With dead ends: 5877 [2022-01-10 02:34:23,518 INFO L226 Difference]: Without dead ends: 3554 [2022-01-10 02:34:23,524 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:23,524 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 874 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:23,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [883 Valid, 1213 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:34:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2022-01-10 02:34:23,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3270. [2022-01-10 02:34:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3270 states, 2578 states have (on average 1.2936384794414275) internal successors, (3335), 2628 states have internal predecessors, (3335), 341 states have call successors, (341), 279 states have call predecessors, (341), 349 states have return successors, (485), 365 states have call predecessors, (485), 339 states have call successors, (485) [2022-01-10 02:34:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 4161 transitions. [2022-01-10 02:34:23,653 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 4161 transitions. Word has length 66 [2022-01-10 02:34:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:23,653 INFO L470 AbstractCegarLoop]: Abstraction has 3270 states and 4161 transitions. [2022-01-10 02:34:23,653 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:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 4161 transitions. [2022-01-10 02:34:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 02:34:23,654 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:23,654 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:23,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 02:34:23,655 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash 534392178, now seen corresponding path program 1 times [2022-01-10 02:34:23,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:23,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442797031] [2022-01-10 02:34:23,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:23,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:23,704 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:23,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:23,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442797031] [2022-01-10 02:34:23,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442797031] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:23,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:23,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:23,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130422915] [2022-01-10 02:34:23,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:23,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:23,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:23,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:23,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:23,705 INFO L87 Difference]: Start difference. First operand 3270 states and 4161 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:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:24,049 INFO L93 Difference]: Finished difference Result 6825 states and 8577 transitions. [2022-01-10 02:34:24,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:34:24,049 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:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:24,063 INFO L225 Difference]: With dead ends: 6825 [2022-01-10 02:34:24,063 INFO L226 Difference]: Without dead ends: 3816 [2022-01-10 02:34:24,070 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:24,071 INFO L933 BasicCegarLoop]: 528 mSDtfsCounter, 962 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:24,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [991 Valid, 1293 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:34:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2022-01-10 02:34:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3553. [2022-01-10 02:34:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 2803 states have (on average 1.2854084909026045) internal successors, (3603), 2856 states have internal predecessors, (3603), 369 states have call successors, (369), 304 states have call predecessors, (369), 379 states have return successors, (519), 395 states have call predecessors, (519), 367 states have call successors, (519) [2022-01-10 02:34:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 4491 transitions. [2022-01-10 02:34:24,225 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 4491 transitions. Word has length 72 [2022-01-10 02:34:24,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:24,225 INFO L470 AbstractCegarLoop]: Abstraction has 3553 states and 4491 transitions. [2022-01-10 02:34:24,226 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:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 4491 transitions. [2022-01-10 02:34:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 02:34:24,226 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:24,226 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:24,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 02:34:24,227 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:24,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1130274590, now seen corresponding path program 1 times [2022-01-10 02:34:24,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:24,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947308468] [2022-01-10 02:34:24,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:24,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,288 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:24,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:24,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947308468] [2022-01-10 02:34:24,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947308468] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:24,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:24,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:24,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411523478] [2022-01-10 02:34:24,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:24,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:24,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:24,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:24,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:24,290 INFO L87 Difference]: Start difference. First operand 3553 states and 4491 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:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:24,751 INFO L93 Difference]: Finished difference Result 4617 states and 5769 transitions. [2022-01-10 02:34:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:34:24,752 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:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:24,782 INFO L225 Difference]: With dead ends: 4617 [2022-01-10 02:34:24,783 INFO L226 Difference]: Without dead ends: 4614 [2022-01-10 02:34:24,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:34:24,786 INFO L933 BasicCegarLoop]: 524 mSDtfsCounter, 1712 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:24,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1722 Valid, 1033 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:34:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4614 states. [2022-01-10 02:34:24,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4614 to 4290. [2022-01-10 02:34:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4290 states, 3365 states have (on average 1.2736998514115898) internal successors, (4286), 3425 states have internal predecessors, (4286), 450 states have call successors, (450), 374 states have call predecessors, (450), 473 states have return successors, (643), 493 states have call predecessors, (643), 449 states have call successors, (643) [2022-01-10 02:34:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 5379 transitions. [2022-01-10 02:34:24,980 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 5379 transitions. Word has length 73 [2022-01-10 02:34:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:24,980 INFO L470 AbstractCegarLoop]: Abstraction has 4290 states and 5379 transitions. [2022-01-10 02:34:24,980 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:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 5379 transitions. [2022-01-10 02:34:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 02:34:24,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:24,981 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:24,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 02:34:24,981 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:24,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash -679840836, now seen corresponding path program 1 times [2022-01-10 02:34:24,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:24,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773858658] [2022-01-10 02:34:24,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:24,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,072 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:25,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:25,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773858658] [2022-01-10 02:34:25,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773858658] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:25,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826494135] [2022-01-10 02:34:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:25,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:25,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:25,074 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:25,103 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:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 02:34:25,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:25,512 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:25,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:34:25,793 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:25,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826494135] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:34:25,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 02:34:25,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-01-10 02:34:25,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554211984] [2022-01-10 02:34:25,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 02:34:25,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:34:25,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:25,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:34:25,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:34:25,795 INFO L87 Difference]: Start difference. First operand 4290 states and 5379 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:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:27,045 INFO L93 Difference]: Finished difference Result 8661 states and 10712 transitions. [2022-01-10 02:34:27,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-10 02:34:27,046 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:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:27,082 INFO L225 Difference]: With dead ends: 8661 [2022-01-10 02:34:27,082 INFO L226 Difference]: Without dead ends: 8658 [2022-01-10 02:34:27,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-01-10 02:34:27,087 INFO L933 BasicCegarLoop]: 674 mSDtfsCounter, 1774 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1835 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:27,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1835 Valid, 1935 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:34:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8658 states. [2022-01-10 02:34:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8658 to 7749. [2022-01-10 02:34:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7749 states, 6070 states have (on average 1.2606260296540361) internal successors, (7652), 6181 states have internal predecessors, (7652), 810 states have call successors, (810), 689 states have call predecessors, (810), 867 states have return successors, (1169), 881 states have call predecessors, (1169), 809 states have call successors, (1169) [2022-01-10 02:34:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7749 states to 7749 states and 9631 transitions. [2022-01-10 02:34:27,483 INFO L78 Accepts]: Start accepts. Automaton has 7749 states and 9631 transitions. Word has length 74 [2022-01-10 02:34:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:27,484 INFO L470 AbstractCegarLoop]: Abstraction has 7749 states and 9631 transitions. [2022-01-10 02:34:27,484 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:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 7749 states and 9631 transitions. [2022-01-10 02:34:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 02:34:27,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:27,486 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:27,527 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:27,710 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:27,711 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:27,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:27,711 INFO L85 PathProgramCache]: Analyzing trace with hash 669680098, now seen corresponding path program 2 times [2022-01-10 02:34:27,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:27,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013976721] [2022-01-10 02:34:27,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:27,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,761 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:27,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:27,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013976721] [2022-01-10 02:34:27,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013976721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:27,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:27,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:27,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167704860] [2022-01-10 02:34:27,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:27,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:27,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:27,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:27,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:27,763 INFO L87 Difference]: Start difference. First operand 7749 states and 9631 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:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:28,108 INFO L93 Difference]: Finished difference Result 10746 states and 13347 transitions. [2022-01-10 02:34:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:34:28,109 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:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:28,119 INFO L225 Difference]: With dead ends: 10746 [2022-01-10 02:34:28,119 INFO L226 Difference]: Without dead ends: 4128 [2022-01-10 02:34:28,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:28,129 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 1132 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:28,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1163 Valid, 1101 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:34:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4128 states. [2022-01-10 02:34:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4128 to 3094. [2022-01-10 02:34:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 2449 states have (on average 1.2580645161290323) internal successors, (3081), 2482 states have internal predecessors, (3081), 326 states have call successors, (326), 270 states have call predecessors, (326), 317 states have return successors, (427), 344 states have call predecessors, (427), 325 states have call successors, (427) [2022-01-10 02:34:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 3834 transitions. [2022-01-10 02:34:28,354 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 3834 transitions. Word has length 77 [2022-01-10 02:34:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:28,355 INFO L470 AbstractCegarLoop]: Abstraction has 3094 states and 3834 transitions. [2022-01-10 02:34:28,355 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:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 3834 transitions. [2022-01-10 02:34:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 02:34:28,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:28,358 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:28,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 02:34:28,358 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:28,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1857100594, now seen corresponding path program 1 times [2022-01-10 02:34:28,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:28,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528764221] [2022-01-10 02:34:28,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:28,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:28,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:28,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:28,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:28,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:28,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:28,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:28,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:34:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:28,439 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:28,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:28,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528764221] [2022-01-10 02:34:28,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528764221] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:28,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:28,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:34:28,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675033070] [2022-01-10 02:34:28,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:28,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:34:28,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:28,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:34:28,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:28,441 INFO L87 Difference]: Start difference. First operand 3094 states and 3834 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:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:29,418 INFO L93 Difference]: Finished difference Result 8804 states and 10780 transitions. [2022-01-10 02:34:29,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 02:34:29,418 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:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:29,448 INFO L225 Difference]: With dead ends: 8804 [2022-01-10 02:34:29,448 INFO L226 Difference]: Without dead ends: 5972 [2022-01-10 02:34:29,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-01-10 02:34:29,456 INFO L933 BasicCegarLoop]: 559 mSDtfsCounter, 914 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:29,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 2090 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:34:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2022-01-10 02:34:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 5663. [2022-01-10 02:34:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5663 states, 4383 states have (on average 1.2233629933835273) internal successors, (5362), 4503 states have internal predecessors, (5362), 623 states have call successors, (623), 524 states have call predecessors, (623), 655 states have return successors, (932), 640 states have call predecessors, (932), 622 states have call successors, (932) [2022-01-10 02:34:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5663 states to 5663 states and 6917 transitions. [2022-01-10 02:34:29,724 INFO L78 Accepts]: Start accepts. Automaton has 5663 states and 6917 transitions. Word has length 84 [2022-01-10 02:34:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:29,724 INFO L470 AbstractCegarLoop]: Abstraction has 5663 states and 6917 transitions. [2022-01-10 02:34:29,724 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:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5663 states and 6917 transitions. [2022-01-10 02:34:29,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 02:34:29,728 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:29,728 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:29,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 02:34:29,729 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:29,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:29,729 INFO L85 PathProgramCache]: Analyzing trace with hash 887628672, now seen corresponding path program 1 times [2022-01-10 02:34:29,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:29,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403890667] [2022-01-10 02:34:29,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:29,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 02:34:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,798 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:29,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:29,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403890667] [2022-01-10 02:34:29,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403890667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:29,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:29,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:34:29,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167837726] [2022-01-10 02:34:29,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:29,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:34:29,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:29,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:34:29,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:29,800 INFO L87 Difference]: Start difference. First operand 5663 states and 6917 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:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:30,888 INFO L93 Difference]: Finished difference Result 8690 states and 10600 transitions. [2022-01-10 02:34:30,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 02:34:30,888 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:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:30,899 INFO L225 Difference]: With dead ends: 8690 [2022-01-10 02:34:30,900 INFO L226 Difference]: Without dead ends: 4152 [2022-01-10 02:34:30,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-01-10 02:34:30,909 INFO L933 BasicCegarLoop]: 539 mSDtfsCounter, 1553 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:30,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1589 Valid, 1841 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:34:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2022-01-10 02:34:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 3775. [2022-01-10 02:34:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3775 states, 2925 states have (on average 1.2126495726495727) internal successors, (3547), 3007 states have internal predecessors, (3547), 411 states have call successors, (411), 339 states have call predecessors, (411), 437 states have return successors, (581), 433 states have call predecessors, (581), 410 states have call successors, (581) [2022-01-10 02:34:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3775 states to 3775 states and 4539 transitions. [2022-01-10 02:34:31,059 INFO L78 Accepts]: Start accepts. Automaton has 3775 states and 4539 transitions. Word has length 93 [2022-01-10 02:34:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:31,059 INFO L470 AbstractCegarLoop]: Abstraction has 3775 states and 4539 transitions. [2022-01-10 02:34:31,059 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:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3775 states and 4539 transitions. [2022-01-10 02:34:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:34:31,062 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:31,062 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] [2022-01-10 02:34:31,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 02:34:31,062 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:31,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 521017431, now seen corresponding path program 1 times [2022-01-10 02:34:31,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:31,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759539872] [2022-01-10 02:34:31,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:31,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:34:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:34:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:31,136 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,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:31,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759539872] [2022-01-10 02:34:31,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759539872] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:31,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:31,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:34:31,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382674625] [2022-01-10 02:34:31,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:31,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:34:31,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:31,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:34:31,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:34:31,139 INFO L87 Difference]: Start difference. First operand 3775 states and 4539 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 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:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:32,022 INFO L93 Difference]: Finished difference Result 4105 states and 5065 transitions. [2022-01-10 02:34:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:34:32,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 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 123 [2022-01-10 02:34:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:32,033 INFO L225 Difference]: With dead ends: 4105 [2022-01-10 02:34:32,033 INFO L226 Difference]: Without dead ends: 3862 [2022-01-10 02:34:32,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:32,037 INFO L933 BasicCegarLoop]: 553 mSDtfsCounter, 754 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:32,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [773 Valid, 982 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:34:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2022-01-10 02:34:32,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3775. [2022-01-10 02:34:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3775 states, 2925 states have (on average 1.2123076923076923) internal successors, (3546), 3007 states have internal predecessors, (3546), 411 states have call successors, (411), 339 states have call predecessors, (411), 437 states have return successors, (581), 433 states have call predecessors, (581), 410 states have call successors, (581) [2022-01-10 02:34:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3775 states to 3775 states and 4538 transitions. [2022-01-10 02:34:32,218 INFO L78 Accepts]: Start accepts. Automaton has 3775 states and 4538 transitions. Word has length 123 [2022-01-10 02:34:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:32,218 INFO L470 AbstractCegarLoop]: Abstraction has 3775 states and 4538 transitions. [2022-01-10 02:34:32,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 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:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3775 states and 4538 transitions. [2022-01-10 02:34:32,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:34:32,221 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:32,221 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] [2022-01-10 02:34:32,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 02:34:32,222 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:32,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash 49661081, now seen corresponding path program 1 times [2022-01-10 02:34:32,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:32,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182940161] [2022-01-10 02:34:32,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:32,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:32,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:32,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:34:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:32,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:32,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:34:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:32,302 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:32,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:32,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182940161] [2022-01-10 02:34:32,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182940161] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:32,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:32,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:32,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555444522] [2022-01-10 02:34:32,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:32,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:32,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:32,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:32,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:32,304 INFO L87 Difference]: Start difference. First operand 3775 states and 4538 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:33,795 INFO L93 Difference]: Finished difference Result 4431 states and 5585 transitions. [2022-01-10 02:34:33,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:34:33,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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 123 [2022-01-10 02:34:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:33,806 INFO L225 Difference]: With dead ends: 4431 [2022-01-10 02:34:33,806 INFO L226 Difference]: Without dead ends: 4194 [2022-01-10 02:34:33,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:34:33,809 INFO L933 BasicCegarLoop]: 575 mSDtfsCounter, 1194 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:33,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1218 Valid, 1363 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 02:34:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2022-01-10 02:34:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 4021. [2022-01-10 02:34:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4021 states, 3148 states have (on average 1.2379288437102922) internal successors, (3897), 3231 states have internal predecessors, (3897), 427 states have call successors, (427), 345 states have call predecessors, (427), 444 states have return successors, (600), 449 states have call predecessors, (600), 426 states have call successors, (600) [2022-01-10 02:34:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 4924 transitions. [2022-01-10 02:34:34,051 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 4924 transitions. Word has length 123 [2022-01-10 02:34:34,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:34,051 INFO L470 AbstractCegarLoop]: Abstraction has 4021 states and 4924 transitions. [2022-01-10 02:34:34,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 4924 transitions. [2022-01-10 02:34:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:34:34,054 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:34,054 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] [2022-01-10 02:34:34,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 02:34:34,054 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:34,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash -675902947, now seen corresponding path program 1 times [2022-01-10 02:34:34,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:34,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612629346] [2022-01-10 02:34:34,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:34,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:34:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:34:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,141 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,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:34,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612629346] [2022-01-10 02:34:34,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612629346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:34,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:34,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:34,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998472869] [2022-01-10 02:34:34,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:34,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:34,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:34,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:34,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:34,143 INFO L87 Difference]: Start difference. First operand 4021 states and 4924 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:36,009 INFO L93 Difference]: Finished difference Result 5019 states and 6514 transitions. [2022-01-10 02:34:36,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:36,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2022-01-10 02:34:36,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:36,022 INFO L225 Difference]: With dead ends: 5019 [2022-01-10 02:34:36,022 INFO L226 Difference]: Without dead ends: 4536 [2022-01-10 02:34:36,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:34:36,025 INFO L933 BasicCegarLoop]: 766 mSDtfsCounter, 1203 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:36,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1227 Valid, 2210 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:34:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2022-01-10 02:34:36,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 4250. [2022-01-10 02:34:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 3354 states have (on average 1.2564102564102564) internal successors, (4214), 3438 states have internal predecessors, (4214), 443 states have call successors, (443), 351 states have call predecessors, (443), 451 states have return successors, (618), 466 states have call predecessors, (618), 442 states have call successors, (618) [2022-01-10 02:34:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 5275 transitions. [2022-01-10 02:34:36,330 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 5275 transitions. Word has length 123 [2022-01-10 02:34:36,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:36,331 INFO L470 AbstractCegarLoop]: Abstraction has 4250 states and 5275 transitions. [2022-01-10 02:34:36,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 5275 transitions. [2022-01-10 02:34:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:34:36,335 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:36,335 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] [2022-01-10 02:34:36,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 02:34:36,335 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:36,336 INFO L85 PathProgramCache]: Analyzing trace with hash 713391067, now seen corresponding path program 1 times [2022-01-10 02:34:36,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:36,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188469810] [2022-01-10 02:34:36,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:36,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:34:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:34:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:36,427 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,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:36,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188469810] [2022-01-10 02:34:36,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188469810] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:36,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:36,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:36,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736190594] [2022-01-10 02:34:36,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:36,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:36,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:36,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:36,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:36,429 INFO L87 Difference]: Start difference. First operand 4250 states and 5275 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:38,553 INFO L93 Difference]: Finished difference Result 5885 states and 7873 transitions. [2022-01-10 02:34:38,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:38,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2022-01-10 02:34:38,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:38,566 INFO L225 Difference]: With dead ends: 5885 [2022-01-10 02:34:38,566 INFO L226 Difference]: Without dead ends: 5173 [2022-01-10 02:34:38,570 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:38,571 INFO L933 BasicCegarLoop]: 758 mSDtfsCounter, 1200 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 2183 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:38,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1224 Valid, 2202 Invalid, 2285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2183 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 02:34:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2022-01-10 02:34:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 4709. [2022-01-10 02:34:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4709 states, 3767 states have (on average 1.2872312184762411) internal successors, (4849), 3853 states have internal predecessors, (4849), 475 states have call successors, (475), 363 states have call predecessors, (475), 465 states have return successors, (658), 500 states have call predecessors, (658), 474 states have call successors, (658) [2022-01-10 02:34:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4709 states to 4709 states and 5982 transitions. [2022-01-10 02:34:38,805 INFO L78 Accepts]: Start accepts. Automaton has 4709 states and 5982 transitions. Word has length 123 [2022-01-10 02:34:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:38,805 INFO L470 AbstractCegarLoop]: Abstraction has 4709 states and 5982 transitions. [2022-01-10 02:34:38,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 4709 states and 5982 transitions. [2022-01-10 02:34:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:34:38,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:38,810 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] [2022-01-10 02:34:38,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 02:34:38,810 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:38,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1320002979, now seen corresponding path program 1 times [2022-01-10 02:34:38,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:38,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195380304] [2022-01-10 02:34:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:38,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:34:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:34:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:38,918 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,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:38,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195380304] [2022-01-10 02:34:38,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195380304] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:38,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:38,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:38,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882241014] [2022-01-10 02:34:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:38,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:38,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:38,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:38,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:38,920 INFO L87 Difference]: Start difference. First operand 4709 states and 5982 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:40,871 INFO L93 Difference]: Finished difference Result 7552 states and 10476 transitions. [2022-01-10 02:34:40,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:40,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2022-01-10 02:34:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:40,920 INFO L225 Difference]: With dead ends: 7552 [2022-01-10 02:34:40,920 INFO L226 Difference]: Without dead ends: 6381 [2022-01-10 02:34:40,938 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:40,938 INFO L933 BasicCegarLoop]: 752 mSDtfsCounter, 1199 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:40,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1223 Valid, 2196 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:34:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6381 states. [2022-01-10 02:34:41,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6381 to 5628. [2022-01-10 02:34:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5628 states, 4594 states have (on average 1.3319547235524598) internal successors, (6119), 4684 states have internal predecessors, (6119), 539 states have call successors, (539), 387 states have call predecessors, (539), 493 states have return successors, (744), 568 states have call predecessors, (744), 538 states have call successors, (744) [2022-01-10 02:34:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 7402 transitions. [2022-01-10 02:34:41,272 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 7402 transitions. Word has length 123 [2022-01-10 02:34:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:41,272 INFO L470 AbstractCegarLoop]: Abstraction has 5628 states and 7402 transitions. [2022-01-10 02:34:41,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 7402 transitions. [2022-01-10 02:34:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:34:41,276 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:41,276 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] [2022-01-10 02:34:41,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 02:34:41,276 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:41,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:41,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1108255643, now seen corresponding path program 1 times [2022-01-10 02:34:41,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:41,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855913494] [2022-01-10 02:34:41,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:41,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:41,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:34:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:41,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:41,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:34:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:41,372 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:41,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:41,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855913494] [2022-01-10 02:34:41,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855913494] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:41,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:41,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:41,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484489768] [2022-01-10 02:34:41,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:41,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:41,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:41,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:41,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:41,374 INFO L87 Difference]: Start difference. First operand 5628 states and 7402 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:43,448 INFO L93 Difference]: Finished difference Result 10878 states and 15686 transitions. [2022-01-10 02:34:43,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:43,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2022-01-10 02:34:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:43,471 INFO L225 Difference]: With dead ends: 10878 [2022-01-10 02:34:43,472 INFO L226 Difference]: Without dead ends: 8788 [2022-01-10 02:34:43,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:34:43,478 INFO L933 BasicCegarLoop]: 744 mSDtfsCounter, 1194 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:43,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1218 Valid, 2188 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:34:43,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8788 states. [2022-01-10 02:34:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8788 to 7480. [2022-01-10 02:34:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7480 states, 6262 states have (on average 1.3866176940274673) internal successors, (8683), 6360 states have internal predecessors, (8683), 667 states have call successors, (667), 435 states have call predecessors, (667), 549 states have return successors, (934), 704 states have call predecessors, (934), 666 states have call successors, (934) [2022-01-10 02:34:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7480 states to 7480 states and 10284 transitions. [2022-01-10 02:34:43,867 INFO L78 Accepts]: Start accepts. Automaton has 7480 states and 10284 transitions. Word has length 123 [2022-01-10 02:34:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:43,867 INFO L470 AbstractCegarLoop]: Abstraction has 7480 states and 10284 transitions. [2022-01-10 02:34:43,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 7480 states and 10284 transitions. [2022-01-10 02:34:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:34:43,873 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:43,874 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] [2022-01-10 02:34:43,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 02:34:43,874 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:43,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1289214887, now seen corresponding path program 1 times [2022-01-10 02:34:43,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:43,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692587718] [2022-01-10 02:34:43,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:43,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:34:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:34:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:43,948 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:43,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:43,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692587718] [2022-01-10 02:34:43,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692587718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:43,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:43,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:43,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704639632] [2022-01-10 02:34:43,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:43,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:43,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:43,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:43,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:43,950 INFO L87 Difference]: Start difference. First operand 7480 states and 10284 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:45,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:45,210 INFO L93 Difference]: Finished difference Result 12778 states and 18729 transitions. [2022-01-10 02:34:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:34:45,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2022-01-10 02:34:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:45,232 INFO L225 Difference]: With dead ends: 12778 [2022-01-10 02:34:45,232 INFO L226 Difference]: Without dead ends: 8836 [2022-01-10 02:34:45,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:34:45,244 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 928 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:45,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 1335 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:34:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8836 states. [2022-01-10 02:34:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8836 to 7480. [2022-01-10 02:34:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7480 states, 6262 states have (on average 1.3839029064196742) internal successors, (8666), 6360 states have internal predecessors, (8666), 667 states have call successors, (667), 435 states have call predecessors, (667), 549 states have return successors, (934), 704 states have call predecessors, (934), 666 states have call successors, (934) [2022-01-10 02:34:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7480 states to 7480 states and 10267 transitions. [2022-01-10 02:34:45,676 INFO L78 Accepts]: Start accepts. Automaton has 7480 states and 10267 transitions. Word has length 123 [2022-01-10 02:34:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:45,676 INFO L470 AbstractCegarLoop]: Abstraction has 7480 states and 10267 transitions. [2022-01-10 02:34:45,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 7480 states and 10267 transitions. [2022-01-10 02:34:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:34:45,681 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:45,681 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] [2022-01-10 02:34:45,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 02:34:45,681 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:45,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:45,681 INFO L85 PathProgramCache]: Analyzing trace with hash -258173989, now seen corresponding path program 1 times [2022-01-10 02:34:45,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:45,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064100425] [2022-01-10 02:34:45,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:45,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:45,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:34:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:45,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:34:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:45,760 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:45,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:45,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064100425] [2022-01-10 02:34:45,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064100425] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:45,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:45,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:45,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390956798] [2022-01-10 02:34:45,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:45,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:45,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:45,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:45,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:45,762 INFO L87 Difference]: Start difference. First operand 7480 states and 10267 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:48,015 INFO L93 Difference]: Finished difference Result 17530 states and 26078 transitions. [2022-01-10 02:34:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:48,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2022-01-10 02:34:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:48,054 INFO L225 Difference]: With dead ends: 17530 [2022-01-10 02:34:48,054 INFO L226 Difference]: Without dead ends: 13588 [2022-01-10 02:34:48,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:34:48,067 INFO L933 BasicCegarLoop]: 733 mSDtfsCounter, 1186 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:48,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1210 Valid, 2177 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 02:34:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13588 states. [2022-01-10 02:34:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13588 to 11214. [2022-01-10 02:34:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11214 states, 9628 states have (on average 1.4347735770668884) internal successors, (13814), 9742 states have internal predecessors, (13814), 923 states have call successors, (923), 531 states have call predecessors, (923), 661 states have return successors, (1368), 976 states have call predecessors, (1368), 922 states have call successors, (1368) [2022-01-10 02:34:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11214 states to 11214 states and 16105 transitions. [2022-01-10 02:34:48,672 INFO L78 Accepts]: Start accepts. Automaton has 11214 states and 16105 transitions. Word has length 123 [2022-01-10 02:34:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:48,673 INFO L470 AbstractCegarLoop]: Abstraction has 11214 states and 16105 transitions. [2022-01-10 02:34:48,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 11214 states and 16105 transitions. [2022-01-10 02:34:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:34:48,680 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:48,680 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] [2022-01-10 02:34:48,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 02:34:48,680 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:48,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:48,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2130390041, now seen corresponding path program 1 times [2022-01-10 02:34:48,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:48,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453163384] [2022-01-10 02:34:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:48,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:34:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:34:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:48,744 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:48,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:48,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453163384] [2022-01-10 02:34:48,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453163384] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:48,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:48,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:48,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223368557] [2022-01-10 02:34:48,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:48,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:48,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:48,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:48,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:48,745 INFO L87 Difference]: Start difference. First operand 11214 states and 16105 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:50,199 INFO L93 Difference]: Finished difference Result 21362 states and 32316 transitions. [2022-01-10 02:34:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:34:50,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2022-01-10 02:34:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:50,240 INFO L225 Difference]: With dead ends: 21362 [2022-01-10 02:34:50,240 INFO L226 Difference]: Without dead ends: 13686 [2022-01-10 02:34:50,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:34:50,258 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 1082 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:50,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1107 Valid, 1144 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:34:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13686 states. [2022-01-10 02:34:50,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 11214. [2022-01-10 02:34:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11214 states, 9628 states have (on average 1.4313460739509762) internal successors, (13781), 9742 states have internal predecessors, (13781), 923 states have call successors, (923), 531 states have call predecessors, (923), 661 states have return successors, (1368), 976 states have call predecessors, (1368), 922 states have call successors, (1368) [2022-01-10 02:34:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11214 states to 11214 states and 16072 transitions. [2022-01-10 02:34:50,989 INFO L78 Accepts]: Start accepts. Automaton has 11214 states and 16072 transitions. Word has length 123 [2022-01-10 02:34:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:50,990 INFO L470 AbstractCegarLoop]: Abstraction has 11214 states and 16072 transitions. [2022-01-10 02:34:50,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 11214 states and 16072 transitions. [2022-01-10 02:34:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:34:51,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:51,002 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] [2022-01-10 02:34:51,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 02:34:51,002 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:51,002 INFO L85 PathProgramCache]: Analyzing trace with hash -563506149, now seen corresponding path program 1 times [2022-01-10 02:34:51,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:51,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548587594] [2022-01-10 02:34:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:51,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:34:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:34:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,080 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,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:51,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548587594] [2022-01-10 02:34:51,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548587594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:51,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:51,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:51,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087131637] [2022-01-10 02:34:51,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:51,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:51,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:51,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:51,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:51,081 INFO L87 Difference]: Start difference. First operand 11214 states and 16072 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:54,478 INFO L93 Difference]: Finished difference Result 33876 states and 51608 transitions. [2022-01-10 02:34:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:34:54,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2022-01-10 02:34:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:54,594 INFO L225 Difference]: With dead ends: 33876 [2022-01-10 02:34:54,594 INFO L226 Difference]: Without dead ends: 26200 [2022-01-10 02:34:54,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:34:54,610 INFO L933 BasicCegarLoop]: 719 mSDtfsCounter, 1429 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:54,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1461 Valid, 2152 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:34:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26200 states. [2022-01-10 02:34:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26200 to 18488. [2022-01-10 02:34:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18488 states, 16198 states have (on average 1.4693789356710705) internal successors, (23801), 16344 states have internal predecessors, (23801), 1403 states have call successors, (1403), 723 states have call predecessors, (1403), 885 states have return successors, (2366), 1488 states have call predecessors, (2366), 1402 states have call successors, (2366) [2022-01-10 02:34:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18488 states to 18488 states and 27570 transitions. [2022-01-10 02:34:55,875 INFO L78 Accepts]: Start accepts. Automaton has 18488 states and 27570 transitions. Word has length 123 [2022-01-10 02:34:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:55,875 INFO L470 AbstractCegarLoop]: Abstraction has 18488 states and 27570 transitions. [2022-01-10 02:34:55,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 18488 states and 27570 transitions. [2022-01-10 02:34:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:34:55,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:55,885 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] [2022-01-10 02:34:55,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 02:34:55,885 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1620237351, now seen corresponding path program 1 times [2022-01-10 02:34:55,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:55,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056310717] [2022-01-10 02:34:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:55,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:55,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:55,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:55,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:34:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:34:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:55,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:34:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:55,956 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:55,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:55,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056310717] [2022-01-10 02:34:55,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056310717] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:55,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:55,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:55,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744152661] [2022-01-10 02:34:55,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:55,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:55,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:55,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:55,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:55,958 INFO L87 Difference]: Start difference. First operand 18488 states and 27570 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:01,702 INFO L93 Difference]: Finished difference Result 61996 states and 96400 transitions. [2022-01-10 02:35:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:35:01,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2022-01-10 02:35:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:01,867 INFO L225 Difference]: With dead ends: 61996 [2022-01-10 02:35:01,867 INFO L226 Difference]: Without dead ends: 47046 [2022-01-10 02:35:01,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:35:01,916 INFO L933 BasicCegarLoop]: 807 mSDtfsCounter, 1230 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 2483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:01,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1253 Valid, 2243 Invalid, 2483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 02:35:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47046 states. [2022-01-10 02:35:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47046 to 33161. [2022-01-10 02:35:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33161 states, 29495 states have (on average 1.4959484658416682) internal successors, (44123), 29705 states have internal predecessors, (44123), 2331 states have call successors, (2331), 1107 states have call predecessors, (2331), 1333 states have return successors, (4816), 2480 states have call predecessors, (4816), 2330 states have call successors, (4816) [2022-01-10 02:35:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33161 states to 33161 states and 51270 transitions. [2022-01-10 02:35:04,448 INFO L78 Accepts]: Start accepts. Automaton has 33161 states and 51270 transitions. Word has length 123 [2022-01-10 02:35:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:04,448 INFO L470 AbstractCegarLoop]: Abstraction has 33161 states and 51270 transitions. [2022-01-10 02:35:04,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 33161 states and 51270 transitions. [2022-01-10 02:35:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:35:04,489 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:04,489 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] [2022-01-10 02:35:04,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 02:35:04,490 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:04,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:04,490 INFO L85 PathProgramCache]: Analyzing trace with hash -268852133, now seen corresponding path program 1 times [2022-01-10 02:35:04,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:04,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835743385] [2022-01-10 02:35:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:04,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:35:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:35:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:35:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,595 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:04,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:04,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835743385] [2022-01-10 02:35:04,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835743385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:04,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:04,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:04,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942729550] [2022-01-10 02:35:04,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:04,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:04,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:04,596 INFO L87 Difference]: Start difference. First operand 33161 states and 51270 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:08,642 INFO L93 Difference]: Finished difference Result 71522 states and 114369 transitions. [2022-01-10 02:35:08,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:35:08,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2022-01-10 02:35:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:08,881 INFO L225 Difference]: With dead ends: 71522 [2022-01-10 02:35:08,882 INFO L226 Difference]: Without dead ends: 41899 [2022-01-10 02:35:09,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:35:09,009 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 1085 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:09,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1110 Valid, 1132 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:35:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41899 states. [2022-01-10 02:35:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41899 to 33161. [2022-01-10 02:35:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33161 states, 29495 states have (on average 1.4915748431937617) internal successors, (43994), 29705 states have internal predecessors, (43994), 2331 states have call successors, (2331), 1107 states have call predecessors, (2331), 1333 states have return successors, (4816), 2480 states have call predecessors, (4816), 2330 states have call successors, (4816) [2022-01-10 02:35:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33161 states to 33161 states and 51141 transitions. [2022-01-10 02:35:11,734 INFO L78 Accepts]: Start accepts. Automaton has 33161 states and 51141 transitions. Word has length 123 [2022-01-10 02:35:11,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:11,735 INFO L470 AbstractCegarLoop]: Abstraction has 33161 states and 51141 transitions. [2022-01-10 02:35:11,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 33161 states and 51141 transitions. [2022-01-10 02:35:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 02:35:11,749 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:11,749 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] [2022-01-10 02:35:11,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 02:35:11,749 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1887827047, now seen corresponding path program 1 times [2022-01-10 02:35:11,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:11,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117598380] [2022-01-10 02:35:11,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:11,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 02:35:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:35:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-10 02:35:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,831 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:11,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:11,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117598380] [2022-01-10 02:35:11,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117598380] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:11,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:11,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:11,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014735106] [2022-01-10 02:35:11,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:11,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:11,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:11,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:11,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:11,832 INFO L87 Difference]: Start difference. First operand 33161 states and 51141 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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)