./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash dcf39230c24eb915e747e88202e73a35b6e85db9fcbfa83adc9e68e89fc807d5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:45:42,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:45:42,711 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-19 07:45:42,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:45:42,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:45:42,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:45:42,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:45:42,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:45:42,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:45:42,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:45:42,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:45:42,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:45:42,743 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:45:42,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:45:42,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:45:42,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:45:42,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:45:42,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:45:42,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:45:42,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:45:42,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:45:42,757 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:45:42,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:45:42,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:45:42,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:45:42,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:42,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:45:42,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:45:42,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:45:42,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:45:42,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:45:42,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:45:42,762 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:45:42,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:45:42,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:45:42,763 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:45:42,764 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dcf39230c24eb915e747e88202e73a35b6e85db9fcbfa83adc9e68e89fc807d5 [2023-11-19 07:45:43,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:45:43,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:45:43,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:45:43,139 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:45:43,144 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:45:43,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2023-11-19 07:45:46,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:45:46,512 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:45:46,513 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2023-11-19 07:45:46,528 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/data/2035f10fe/c915d07c26cf4402a0d8040c52b5b085/FLAG9a59dd982 [2023-11-19 07:45:46,561 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/data/2035f10fe/c915d07c26cf4402a0d8040c52b5b085 [2023-11-19 07:45:46,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:45:46,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:45:46,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:46,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:45:46,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:45:46,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:46" (1/1) ... [2023-11-19 07:45:46,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b1550b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:46, skipping insertion in model container [2023-11-19 07:45:46,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:46" (1/1) ... [2023-11-19 07:45:46,641 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:45:46,805 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c[1279,1292] [2023-11-19 07:45:47,025 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:47,047 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:45:47,061 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c[1279,1292] [2023-11-19 07:45:47,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:47,182 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:45:47,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47 WrapperNode [2023-11-19 07:45:47,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:47,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:47,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:45:47,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:45:47,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47" (1/1) ... [2023-11-19 07:45:47,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47" (1/1) ... [2023-11-19 07:45:47,441 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1535 [2023-11-19 07:45:47,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:47,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:45:47,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:45:47,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:45:47,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47" (1/1) ... [2023-11-19 07:45:47,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47" (1/1) ... [2023-11-19 07:45:47,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47" (1/1) ... [2023-11-19 07:45:47,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47" (1/1) ... [2023-11-19 07:45:47,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47" (1/1) ... [2023-11-19 07:45:47,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47" (1/1) ... [2023-11-19 07:45:47,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47" (1/1) ... [2023-11-19 07:45:47,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47" (1/1) ... [2023-11-19 07:45:47,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:45:47,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:45:47,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:45:47,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:45:47,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47" (1/1) ... [2023-11-19 07:45:47,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:47,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:47,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:45:47,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a6dc683-a197-4737-87fe-2c8dc1b12a4e/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:45:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:45:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:45:47,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:45:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:45:47,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:45:47,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:45:48,094 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:45:48,096 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:45:49,651 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:45:49,663 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:45:49,663 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:45:49,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:49 BoogieIcfgContainer [2023-11-19 07:45:49,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:45:49,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:45:49,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:45:49,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:45:49,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:45:46" (1/3) ... [2023-11-19 07:45:49,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114f80ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:49, skipping insertion in model container [2023-11-19 07:45:49,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:47" (2/3) ... [2023-11-19 07:45:49,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114f80ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:49, skipping insertion in model container [2023-11-19 07:45:49,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:49" (3/3) ... [2023-11-19 07:45:49,677 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2023-11-19 07:45:49,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:45:49,696 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:45:49,775 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:45:49,782 INFO L357 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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3769971c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:45:49,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:45:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 300 states, 294 states have (on average 1.6496598639455782) internal successors, (485), 295 states have internal predecessors, (485), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:45:49,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:49,803 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:49,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:49,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash -814456904, now seen corresponding path program 1 times [2023-11-19 07:45:49,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:49,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084104569] [2023-11-19 07:45:49,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:49,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:50,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:50,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:45:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:50,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:45:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:50,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:50,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084104569] [2023-11-19 07:45:50,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084104569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:50,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:50,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:45:50,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132396080] [2023-11-19 07:45:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:50,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:45:50,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:50,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:45:50,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:45:50,391 INFO L87 Difference]: Start difference. First operand has 300 states, 294 states have (on average 1.6496598639455782) internal successors, (485), 295 states have internal predecessors, (485), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:45:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:50,450 INFO L93 Difference]: Finished difference Result 543 states and 895 transitions. [2023-11-19 07:45:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:45:50,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 117 [2023-11-19 07:45:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:50,463 INFO L225 Difference]: With dead ends: 543 [2023-11-19 07:45:50,464 INFO L226 Difference]: Without dead ends: 296 [2023-11-19 07:45:50,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:45:50,471 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:50,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:45:50,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-11-19 07:45:50,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2023-11-19 07:45:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 291 states have (on average 1.6426116838487972) internal successors, (478), 291 states have internal predecessors, (478), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 484 transitions. [2023-11-19 07:45:50,533 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 484 transitions. Word has length 117 [2023-11-19 07:45:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:50,535 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 484 transitions. [2023-11-19 07:45:50,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:45:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 484 transitions. [2023-11-19 07:45:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:45:50,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:50,540 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:50,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:45:50,540 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:50,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:50,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1624445682, now seen corresponding path program 1 times [2023-11-19 07:45:50,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:50,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380609816] [2023-11-19 07:45:50,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:51,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:51,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:45:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:51,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:45:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:51,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:51,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380609816] [2023-11-19 07:45:51,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380609816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:51,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:51,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796808653] [2023-11-19 07:45:51,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:51,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:51,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:51,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:51,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:51,678 INFO L87 Difference]: Start difference. First operand 296 states and 484 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:51,763 INFO L93 Difference]: Finished difference Result 300 states and 488 transitions. [2023-11-19 07:45:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:51,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2023-11-19 07:45:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:51,774 INFO L225 Difference]: With dead ends: 300 [2023-11-19 07:45:51,774 INFO L226 Difference]: Without dead ends: 298 [2023-11-19 07:45:51,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:51,781 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 1 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:51,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1440 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:45:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-11-19 07:45:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-11-19 07:45:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 293 states have (on average 1.6382252559726962) internal successors, (480), 293 states have internal predecessors, (480), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:51,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 486 transitions. [2023-11-19 07:45:51,805 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 486 transitions. Word has length 117 [2023-11-19 07:45:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:51,807 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 486 transitions. [2023-11-19 07:45:51,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 486 transitions. [2023-11-19 07:45:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:45:51,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:51,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:51,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:45:51,811 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:51,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:51,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1180065892, now seen corresponding path program 1 times [2023-11-19 07:45:51,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:51,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173461074] [2023-11-19 07:45:51,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:52,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:52,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:45:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:52,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:45:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:52,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:52,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173461074] [2023-11-19 07:45:52,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173461074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:52,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764823711] [2023-11-19 07:45:52,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:52,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:52,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:52,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:52,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:52,389 INFO L87 Difference]: Start difference. First operand 298 states and 486 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:52,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:52,808 INFO L93 Difference]: Finished difference Result 753 states and 1223 transitions. [2023-11-19 07:45:52,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:45:52,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2023-11-19 07:45:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:52,812 INFO L225 Difference]: With dead ends: 753 [2023-11-19 07:45:52,812 INFO L226 Difference]: Without dead ends: 298 [2023-11-19 07:45:52,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:45:52,816 INFO L413 NwaCegarLoop]: 525 mSDtfsCounter, 913 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:52,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1416 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:45:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-11-19 07:45:52,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-11-19 07:45:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 293 states have (on average 1.6348122866894197) internal successors, (479), 293 states have internal predecessors, (479), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 485 transitions. [2023-11-19 07:45:52,840 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 485 transitions. Word has length 118 [2023-11-19 07:45:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:52,840 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 485 transitions. [2023-11-19 07:45:52,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 485 transitions. [2023-11-19 07:45:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:45:52,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:52,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:52,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:45:52,845 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:52,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:52,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1807819958, now seen corresponding path program 1 times [2023-11-19 07:45:52,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:52,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640920430] [2023-11-19 07:45:52,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:52,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:53,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:53,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:45:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:45:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:53,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:53,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640920430] [2023-11-19 07:45:53,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640920430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:53,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:53,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:53,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006181860] [2023-11-19 07:45:53,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:53,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:53,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:53,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:53,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:53,270 INFO L87 Difference]: Start difference. First operand 298 states and 485 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:53,305 INFO L93 Difference]: Finished difference Result 546 states and 887 transitions. [2023-11-19 07:45:53,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:53,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2023-11-19 07:45:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:53,308 INFO L225 Difference]: With dead ends: 546 [2023-11-19 07:45:53,309 INFO L226 Difference]: Without dead ends: 301 [2023-11-19 07:45:53,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:53,311 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 1 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:53,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1434 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:45:53,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-11-19 07:45:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2023-11-19 07:45:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6305084745762712) internal successors, (481), 295 states have internal predecessors, (481), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 487 transitions. [2023-11-19 07:45:53,328 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 487 transitions. Word has length 119 [2023-11-19 07:45:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:53,329 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 487 transitions. [2023-11-19 07:45:53,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 487 transitions. [2023-11-19 07:45:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-19 07:45:53,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:53,332 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:53,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:45:53,332 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:53,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:53,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2588046, now seen corresponding path program 1 times [2023-11-19 07:45:53,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:53,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141521859] [2023-11-19 07:45:53,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:53,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:53,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:53,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:45:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:45:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:54,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:54,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141521859] [2023-11-19 07:45:54,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141521859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:54,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:54,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:54,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660351789] [2023-11-19 07:45:54,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:54,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:54,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:54,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:54,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:54,012 INFO L87 Difference]: Start difference. First operand 300 states and 487 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:54,137 INFO L93 Difference]: Finished difference Result 547 states and 887 transitions. [2023-11-19 07:45:54,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:54,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2023-11-19 07:45:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:54,141 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:45:54,141 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:45:54,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:54,143 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 386 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:54,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 900 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:45:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:45:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:45:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6271186440677967) internal successors, (480), 295 states have internal predecessors, (480), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 486 transitions. [2023-11-19 07:45:54,157 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 486 transitions. Word has length 120 [2023-11-19 07:45:54,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:54,157 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 486 transitions. [2023-11-19 07:45:54,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 486 transitions. [2023-11-19 07:45:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-19 07:45:54,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:54,160 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:54,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:45:54,160 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:54,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:54,161 INFO L85 PathProgramCache]: Analyzing trace with hash -937064280, now seen corresponding path program 1 times [2023-11-19 07:45:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:54,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362787015] [2023-11-19 07:45:54,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:54,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:54,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:54,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:45:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:54,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:45:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:54,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:54,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362787015] [2023-11-19 07:45:54,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362787015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:54,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:54,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718708191] [2023-11-19 07:45:54,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:54,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:54,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:54,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:54,580 INFO L87 Difference]: Start difference. First operand 300 states and 486 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:54,702 INFO L93 Difference]: Finished difference Result 553 states and 893 transitions. [2023-11-19 07:45:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:45:54,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2023-11-19 07:45:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:54,705 INFO L225 Difference]: With dead ends: 553 [2023-11-19 07:45:54,706 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:45:54,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:45:54,708 INFO L413 NwaCegarLoop]: 474 mSDtfsCounter, 398 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:54,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1401 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:45:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:45:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:45:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.623728813559322) internal successors, (479), 295 states have internal predecessors, (479), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 485 transitions. [2023-11-19 07:45:54,722 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 485 transitions. Word has length 121 [2023-11-19 07:45:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:54,723 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 485 transitions. [2023-11-19 07:45:54,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 485 transitions. [2023-11-19 07:45:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:45:54,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:54,725 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:54,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:45:54,726 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:54,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1519576960, now seen corresponding path program 1 times [2023-11-19 07:45:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:54,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845737093] [2023-11-19 07:45:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:55,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:55,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:45:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:55,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:45:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:55,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:55,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845737093] [2023-11-19 07:45:55,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845737093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:55,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:55,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:55,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009946691] [2023-11-19 07:45:55,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:55,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:55,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:55,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:55,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:55,148 INFO L87 Difference]: Start difference. First operand 300 states and 485 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:55,301 INFO L93 Difference]: Finished difference Result 547 states and 883 transitions. [2023-11-19 07:45:55,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:55,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2023-11-19 07:45:55,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:55,304 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:45:55,305 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:45:55,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:45:55,308 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 854 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:55,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 900 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:45:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:45:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:45:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6203389830508474) internal successors, (478), 295 states have internal predecessors, (478), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 484 transitions. [2023-11-19 07:45:55,344 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 484 transitions. Word has length 122 [2023-11-19 07:45:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:55,345 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 484 transitions. [2023-11-19 07:45:55,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 484 transitions. [2023-11-19 07:45:55,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-19 07:45:55,347 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:55,347 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:55,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:45:55,348 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:55,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash 552402190, now seen corresponding path program 1 times [2023-11-19 07:45:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:55,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003306867] [2023-11-19 07:45:55,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:55,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:55,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:45:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:55,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:45:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:55,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:55,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003306867] [2023-11-19 07:45:55,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003306867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:55,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080609373] [2023-11-19 07:45:55,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:55,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:55,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:55,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:55,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:55,836 INFO L87 Difference]: Start difference. First operand 300 states and 484 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:55,945 INFO L93 Difference]: Finished difference Result 547 states and 881 transitions. [2023-11-19 07:45:55,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:55,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2023-11-19 07:45:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:55,948 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:45:55,948 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:45:55,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:45:55,951 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 466 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:55,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 907 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:45:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:45:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:45:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.616949152542373) internal successors, (477), 295 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 483 transitions. [2023-11-19 07:45:55,965 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 483 transitions. Word has length 123 [2023-11-19 07:45:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:55,966 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 483 transitions. [2023-11-19 07:45:55,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 483 transitions. [2023-11-19 07:45:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:45:55,969 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:55,969 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:55,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:45:55,970 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:55,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:55,970 INFO L85 PathProgramCache]: Analyzing trace with hash -419805914, now seen corresponding path program 1 times [2023-11-19 07:45:55,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:55,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916849427] [2023-11-19 07:45:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:55,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:56,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:56,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:45:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:56,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:45:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:56,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:56,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916849427] [2023-11-19 07:45:56,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916849427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:56,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:56,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:56,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745308281] [2023-11-19 07:45:56,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:56,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:56,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:56,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:56,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:56,560 INFO L87 Difference]: Start difference. First operand 300 states and 483 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:56,628 INFO L93 Difference]: Finished difference Result 547 states and 879 transitions. [2023-11-19 07:45:56,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:56,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2023-11-19 07:45:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:56,631 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:45:56,631 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:45:56,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:56,634 INFO L413 NwaCegarLoop]: 461 mSDtfsCounter, 388 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:56,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 924 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:45:56,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:45:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:45:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6101694915254237) internal successors, (475), 295 states have internal predecessors, (475), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 481 transitions. [2023-11-19 07:45:56,647 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 481 transitions. Word has length 124 [2023-11-19 07:45:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:56,648 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 481 transitions. [2023-11-19 07:45:56,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 481 transitions. [2023-11-19 07:45:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-19 07:45:56,650 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:56,650 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:56,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:45:56,650 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:56,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1543114740, now seen corresponding path program 1 times [2023-11-19 07:45:56,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:56,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433751663] [2023-11-19 07:45:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:57,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:45:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:45:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:57,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:57,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433751663] [2023-11-19 07:45:57,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433751663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:57,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:57,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:57,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844422097] [2023-11-19 07:45:57,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:57,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:57,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:57,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:57,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:57,116 INFO L87 Difference]: Start difference. First operand 300 states and 481 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:57,204 INFO L93 Difference]: Finished difference Result 549 states and 877 transitions. [2023-11-19 07:45:57,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:45:57,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125 [2023-11-19 07:45:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:57,207 INFO L225 Difference]: With dead ends: 549 [2023-11-19 07:45:57,208 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:45:57,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:45:57,209 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 393 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:57,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1407 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:45:57,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:45:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:45:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6067796610169491) internal successors, (474), 295 states have internal predecessors, (474), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 480 transitions. [2023-11-19 07:45:57,227 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 480 transitions. Word has length 125 [2023-11-19 07:45:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:57,228 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 480 transitions. [2023-11-19 07:45:57,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 480 transitions. [2023-11-19 07:45:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:45:57,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:57,230 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:57,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:45:57,231 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:57,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash 274918272, now seen corresponding path program 1 times [2023-11-19 07:45:57,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:57,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122902589] [2023-11-19 07:45:57,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:57,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:57,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:57,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:45:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:57,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:45:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:57,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122902589] [2023-11-19 07:45:57,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122902589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:57,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:57,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:57,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361836099] [2023-11-19 07:45:57,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:57,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:57,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:57,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:57,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:57,810 INFO L87 Difference]: Start difference. First operand 300 states and 480 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:45:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:57,881 INFO L93 Difference]: Finished difference Result 547 states and 873 transitions. [2023-11-19 07:45:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:57,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 126 [2023-11-19 07:45:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:57,884 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:45:57,885 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:45:57,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:57,886 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 426 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:57,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 928 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:45:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:45:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:45:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6033898305084746) internal successors, (473), 295 states have internal predecessors, (473), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 479 transitions. [2023-11-19 07:45:57,900 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 479 transitions. Word has length 126 [2023-11-19 07:45:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:57,900 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 479 transitions. [2023-11-19 07:45:57,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:45:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 479 transitions. [2023-11-19 07:45:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:45:57,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:57,903 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:57,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:45:57,904 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:57,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash 726826826, now seen corresponding path program 1 times [2023-11-19 07:45:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276980051] [2023-11-19 07:45:57,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:58,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:58,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:45:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:58,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:45:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:58,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:58,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276980051] [2023-11-19 07:45:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276980051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:58,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:58,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:58,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769508] [2023-11-19 07:45:58,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:58,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:58,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:58,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:58,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:58,644 INFO L87 Difference]: Start difference. First operand 300 states and 479 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:58,791 INFO L93 Difference]: Finished difference Result 547 states and 871 transitions. [2023-11-19 07:45:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:58,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2023-11-19 07:45:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:58,794 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:45:58,795 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:45:58,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:45:58,796 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 380 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:58,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1332 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:45:58,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:45:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:45:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6) internal successors, (472), 295 states have internal predecessors, (472), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 478 transitions. [2023-11-19 07:45:58,810 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 478 transitions. Word has length 127 [2023-11-19 07:45:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:58,810 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 478 transitions. [2023-11-19 07:45:58,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 478 transitions. [2023-11-19 07:45:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:45:58,812 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:58,813 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:58,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:45:58,813 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:58,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:58,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1078611508, now seen corresponding path program 1 times [2023-11-19 07:45:58,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:58,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837116687] [2023-11-19 07:45:58,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:58,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:59,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:45:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:59,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:45:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:59,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:45:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:45:59,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:59,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837116687] [2023-11-19 07:45:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837116687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:59,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:59,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:59,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966465624] [2023-11-19 07:45:59,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:59,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:59,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:59,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:59,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:59,451 INFO L87 Difference]: Start difference. First operand 300 states and 478 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:45:59,586 INFO L93 Difference]: Finished difference Result 547 states and 869 transitions. [2023-11-19 07:45:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:59,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2023-11-19 07:45:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:45:59,602 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:45:59,602 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:45:59,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:45:59,604 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 751 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:45:59,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 892 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:45:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:45:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:45:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.5966101694915253) internal successors, (471), 295 states have internal predecessors, (471), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:45:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 477 transitions. [2023-11-19 07:45:59,622 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 477 transitions. Word has length 127 [2023-11-19 07:45:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:45:59,622 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 477 transitions. [2023-11-19 07:45:59,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:45:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 477 transitions. [2023-11-19 07:45:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:45:59,624 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:45:59,625 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:59,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:45:59,625 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:45:59,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:59,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1896259958, now seen corresponding path program 1 times [2023-11-19 07:45:59,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:59,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456509570] [2023-11-19 07:45:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:59,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:00,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:00,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:00,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:46:00,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:00,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456509570] [2023-11-19 07:46:00,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456509570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:00,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:00,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:00,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074850617] [2023-11-19 07:46:00,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:00,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:00,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:00,269 INFO L87 Difference]: Start difference. First operand 300 states and 477 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:46:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:00,398 INFO L93 Difference]: Finished difference Result 547 states and 867 transitions. [2023-11-19 07:46:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:00,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2023-11-19 07:46:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:00,402 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:46:00,402 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:46:00,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:00,404 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 376 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:00,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 899 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:46:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:46:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:46:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.5932203389830508) internal successors, (470), 295 states have internal predecessors, (470), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:46:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 476 transitions. [2023-11-19 07:46:00,420 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 476 transitions. Word has length 127 [2023-11-19 07:46:00,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:00,420 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 476 transitions. [2023-11-19 07:46:00,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:46:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 476 transitions. [2023-11-19 07:46:00,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:46:00,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:00,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:00,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:46:00,423 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:00,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:00,424 INFO L85 PathProgramCache]: Analyzing trace with hash 810359436, now seen corresponding path program 1 times [2023-11-19 07:46:00,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:00,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543505456] [2023-11-19 07:46:00,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:00,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:00,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:00,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:00,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:46:00,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:00,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543505456] [2023-11-19 07:46:00,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543505456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:00,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:00,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:46:00,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352647511] [2023-11-19 07:46:00,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:00,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:46:00,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:00,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:46:00,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:46:00,861 INFO L87 Difference]: Start difference. First operand 300 states and 476 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:46:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:00,939 INFO L93 Difference]: Finished difference Result 547 states and 865 transitions. [2023-11-19 07:46:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:00,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 127 [2023-11-19 07:46:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:00,943 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:46:00,943 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:46:00,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:00,947 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 420 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:00,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 922 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:46:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:46:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:46:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.5898305084745763) internal successors, (469), 295 states have internal predecessors, (469), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:46:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 475 transitions. [2023-11-19 07:46:00,964 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 475 transitions. Word has length 127 [2023-11-19 07:46:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:00,964 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 475 transitions. [2023-11-19 07:46:00,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:46:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 475 transitions. [2023-11-19 07:46:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:46:00,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:00,967 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:00,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:46:00,967 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:00,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash 837425038, now seen corresponding path program 1 times [2023-11-19 07:46:00,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:00,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952487862] [2023-11-19 07:46:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:01,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:46:01,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:01,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952487862] [2023-11-19 07:46:01,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952487862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:01,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:01,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:46:01,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820440654] [2023-11-19 07:46:01,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:01,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:46:01,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:01,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:46:01,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:46:01,561 INFO L87 Difference]: Start difference. First operand 300 states and 475 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:46:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:01,633 INFO L93 Difference]: Finished difference Result 547 states and 863 transitions. [2023-11-19 07:46:01,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:01,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2023-11-19 07:46:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:01,636 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:46:01,637 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:46:01,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:01,638 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 381 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:01,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 914 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:46:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:46:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:46:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.5864406779661018) internal successors, (468), 295 states have internal predecessors, (468), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:46:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 474 transitions. [2023-11-19 07:46:01,658 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 474 transitions. Word has length 127 [2023-11-19 07:46:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:01,659 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 474 transitions. [2023-11-19 07:46:01,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:46:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 474 transitions. [2023-11-19 07:46:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:46:01,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:01,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:01,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:46:01,663 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:01,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:01,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2071338864, now seen corresponding path program 1 times [2023-11-19 07:46:01,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:01,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361817427] [2023-11-19 07:46:01,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:01,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:02,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:02,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:46:02,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:02,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361817427] [2023-11-19 07:46:02,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361817427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:02,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:02,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:46:02,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934805080] [2023-11-19 07:46:02,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:02,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:46:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:02,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:46:02,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:02,766 INFO L87 Difference]: Start difference. First operand 300 states and 474 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:46:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:02,978 INFO L93 Difference]: Finished difference Result 873 states and 1370 transitions. [2023-11-19 07:46:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:46:02,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2023-11-19 07:46:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:02,984 INFO L225 Difference]: With dead ends: 873 [2023-11-19 07:46:02,984 INFO L226 Difference]: Without dead ends: 626 [2023-11-19 07:46:02,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:46:02,985 INFO L413 NwaCegarLoop]: 589 mSDtfsCounter, 1951 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:02,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 1973 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:46:02,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2023-11-19 07:46:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 392. [2023-11-19 07:46:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5598958333333333) internal successors, (599), 384 states have internal predecessors, (599), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:46:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 611 transitions. [2023-11-19 07:46:03,015 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 611 transitions. Word has length 127 [2023-11-19 07:46:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:03,016 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 611 transitions. [2023-11-19 07:46:03,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:46:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 611 transitions. [2023-11-19 07:46:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2023-11-19 07:46:03,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:03,022 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:03,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:46:03,022 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:03,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1200497368, now seen corresponding path program 1 times [2023-11-19 07:46:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:03,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159365719] [2023-11-19 07:46:03,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:03,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:04,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-19 07:46:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:04,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-19 07:46:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:04,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-19 07:46:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:46:04,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:04,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159365719] [2023-11-19 07:46:04,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159365719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:04,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:04,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379163074] [2023-11-19 07:46:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:04,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:04,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:04,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:04,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:04,144 INFO L87 Difference]: Start difference. First operand 392 states and 611 transitions. Second operand has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:04,288 INFO L93 Difference]: Finished difference Result 639 states and 998 transitions. [2023-11-19 07:46:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:04,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 308 [2023-11-19 07:46:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:04,292 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:46:04,293 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:46:04,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:04,294 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 426 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:04,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 895 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:46:04,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:46:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:46:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5572916666666667) internal successors, (598), 384 states have internal predecessors, (598), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:46:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 610 transitions. [2023-11-19 07:46:04,319 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 610 transitions. Word has length 308 [2023-11-19 07:46:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:04,319 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 610 transitions. [2023-11-19 07:46:04,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 610 transitions. [2023-11-19 07:46:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2023-11-19 07:46:04,325 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:04,325 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:04,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:46:04,326 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:04,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:04,326 INFO L85 PathProgramCache]: Analyzing trace with hash 287320224, now seen corresponding path program 1 times [2023-11-19 07:46:04,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:04,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263977009] [2023-11-19 07:46:04,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:04,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:05,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:05,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:05,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-11-19 07:46:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-11-19 07:46:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:05,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-19 07:46:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:46:05,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:05,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263977009] [2023-11-19 07:46:05,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263977009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:05,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:05,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:05,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060597290] [2023-11-19 07:46:05,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:05,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:05,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:05,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:05,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:05,305 INFO L87 Difference]: Start difference. First operand 392 states and 610 transitions. Second operand has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:05,416 INFO L93 Difference]: Finished difference Result 639 states and 996 transitions. [2023-11-19 07:46:05,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:05,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 309 [2023-11-19 07:46:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:05,420 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:46:05,420 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:46:05,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:05,422 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 747 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:05,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 888 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:46:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:46:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:46:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5546875) internal successors, (597), 384 states have internal predecessors, (597), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:46:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 609 transitions. [2023-11-19 07:46:05,445 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 609 transitions. Word has length 309 [2023-11-19 07:46:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:05,446 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 609 transitions. [2023-11-19 07:46:05,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 609 transitions. [2023-11-19 07:46:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2023-11-19 07:46:05,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:05,452 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:05,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 07:46:05,452 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:05,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:05,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1215824116, now seen corresponding path program 1 times [2023-11-19 07:46:05,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:05,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227479946] [2023-11-19 07:46:05,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:05,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:06,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:06,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:06,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:06,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-11-19 07:46:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:06,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-19 07:46:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:06,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-11-19 07:46:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:46:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227479946] [2023-11-19 07:46:06,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227479946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:06,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:06,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493607977] [2023-11-19 07:46:06,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:06,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:06,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:06,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:06,413 INFO L87 Difference]: Start difference. First operand 392 states and 609 transitions. Second operand has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:06,512 INFO L93 Difference]: Finished difference Result 639 states and 994 transitions. [2023-11-19 07:46:06,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:06,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 310 [2023-11-19 07:46:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:06,516 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:46:06,516 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:46:06,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:06,518 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 731 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:06,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 888 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:46:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:46:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:46:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5520833333333333) internal successors, (596), 384 states have internal predecessors, (596), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:46:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 608 transitions. [2023-11-19 07:46:06,542 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 608 transitions. Word has length 310 [2023-11-19 07:46:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:06,542 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 608 transitions. [2023-11-19 07:46:06,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 608 transitions. [2023-11-19 07:46:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2023-11-19 07:46:06,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:06,549 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:06,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 07:46:06,549 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:06,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1730578384, now seen corresponding path program 1 times [2023-11-19 07:46:06,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:06,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191601319] [2023-11-19 07:46:06,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:06,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:07,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:07,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:07,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-19 07:46:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:07,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-19 07:46:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:07,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-19 07:46:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:46:07,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:07,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191601319] [2023-11-19 07:46:07,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191601319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:07,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:07,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:07,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866772590] [2023-11-19 07:46:07,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:07,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:07,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:07,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:07,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:07,486 INFO L87 Difference]: Start difference. First operand 392 states and 608 transitions. Second operand has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:07,584 INFO L93 Difference]: Finished difference Result 639 states and 992 transitions. [2023-11-19 07:46:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:07,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 311 [2023-11-19 07:46:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:07,588 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:46:07,588 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:46:07,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:07,590 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 715 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:07,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 888 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:46:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:46:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:46:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5494791666666667) internal successors, (595), 384 states have internal predecessors, (595), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:46:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 607 transitions. [2023-11-19 07:46:07,614 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 607 transitions. Word has length 311 [2023-11-19 07:46:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:07,615 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 607 transitions. [2023-11-19 07:46:07,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 607 transitions. [2023-11-19 07:46:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-11-19 07:46:07,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:07,620 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:07,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 07:46:07,621 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:07,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1767025090, now seen corresponding path program 1 times [2023-11-19 07:46:07,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:07,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222423571] [2023-11-19 07:46:07,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:07,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:08,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:08,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:08,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-11-19 07:46:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:08,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-11-19 07:46:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-19 07:46:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:46:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:08,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222423571] [2023-11-19 07:46:08,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222423571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:08,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:08,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:08,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911599856] [2023-11-19 07:46:08,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:08,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:08,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:08,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:08,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:08,827 INFO L87 Difference]: Start difference. First operand 392 states and 607 transitions. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:08,915 INFO L93 Difference]: Finished difference Result 639 states and 990 transitions. [2023-11-19 07:46:08,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:08,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 312 [2023-11-19 07:46:08,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:08,919 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:46:08,919 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:46:08,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:08,922 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 388 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:08,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 913 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:46:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:46:08,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:46:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.546875) internal successors, (594), 384 states have internal predecessors, (594), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:46:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 606 transitions. [2023-11-19 07:46:08,950 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 606 transitions. Word has length 312 [2023-11-19 07:46:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:08,950 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 606 transitions. [2023-11-19 07:46:08,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 606 transitions. [2023-11-19 07:46:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-11-19 07:46:08,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:08,960 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:08,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-19 07:46:08,961 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:08,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:08,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1817051586, now seen corresponding path program 1 times [2023-11-19 07:46:08,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:08,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624336692] [2023-11-19 07:46:08,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:08,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:10,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:10,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:10,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:10,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-11-19 07:46:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:10,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-11-19 07:46:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:10,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-11-19 07:46:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:46:10,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:10,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624336692] [2023-11-19 07:46:10,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624336692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:10,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:10,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:10,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870203101] [2023-11-19 07:46:10,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:10,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:10,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:10,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:10,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:10,179 INFO L87 Difference]: Start difference. First operand 392 states and 606 transitions. Second operand has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:10,256 INFO L93 Difference]: Finished difference Result 639 states and 988 transitions. [2023-11-19 07:46:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:10,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 313 [2023-11-19 07:46:10,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:10,260 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:46:10,261 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:46:10,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:10,262 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 677 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:10,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 906 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:46:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:46:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:46:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5442708333333333) internal successors, (593), 384 states have internal predecessors, (593), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:46:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 605 transitions. [2023-11-19 07:46:10,288 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 605 transitions. Word has length 313 [2023-11-19 07:46:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:10,288 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 605 transitions. [2023-11-19 07:46:10,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 605 transitions. [2023-11-19 07:46:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-11-19 07:46:10,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:10,294 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:10,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-19 07:46:10,295 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:10,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:10,296 INFO L85 PathProgramCache]: Analyzing trace with hash -92715534, now seen corresponding path program 1 times [2023-11-19 07:46:10,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:10,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750581697] [2023-11-19 07:46:10,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:10,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:11,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:11,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:11,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:11,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-19 07:46:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:11,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-19 07:46:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:11,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-11-19 07:46:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:46:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:11,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750581697] [2023-11-19 07:46:11,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750581697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:11,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:11,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:11,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051649488] [2023-11-19 07:46:11,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:11,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:11,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:11,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:11,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:11,323 INFO L87 Difference]: Start difference. First operand 392 states and 605 transitions. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:11,645 INFO L93 Difference]: Finished difference Result 639 states and 986 transitions. [2023-11-19 07:46:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:11,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 314 [2023-11-19 07:46:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:11,649 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:46:11,649 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:46:11,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:11,650 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 658 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:11,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 676 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:46:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:46:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:46:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5416666666666667) internal successors, (592), 384 states have internal predecessors, (592), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:46:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 604 transitions. [2023-11-19 07:46:11,676 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 604 transitions. Word has length 314 [2023-11-19 07:46:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:11,677 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 604 transitions. [2023-11-19 07:46:11,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 604 transitions. [2023-11-19 07:46:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-11-19 07:46:11,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:11,685 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:11,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-19 07:46:11,685 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:11,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:11,686 INFO L85 PathProgramCache]: Analyzing trace with hash -467654286, now seen corresponding path program 1 times [2023-11-19 07:46:11,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:11,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145840958] [2023-11-19 07:46:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:11,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:13,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:13,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:13,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:13,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-19 07:46:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:13,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-19 07:46:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:13,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-19 07:46:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:46:13,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:13,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145840958] [2023-11-19 07:46:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145840958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:13,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:13,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944727690] [2023-11-19 07:46:13,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:13,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:13,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:13,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:13,402 INFO L87 Difference]: Start difference. First operand 392 states and 604 transitions. Second operand has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:13,531 INFO L93 Difference]: Finished difference Result 639 states and 984 transitions. [2023-11-19 07:46:13,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:13,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 315 [2023-11-19 07:46:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:13,535 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:46:13,535 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:46:13,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:13,536 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 366 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:13,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 889 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:46:13,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:46:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:46:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5390625) internal successors, (591), 384 states have internal predecessors, (591), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:46:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 603 transitions. [2023-11-19 07:46:13,568 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 603 transitions. Word has length 315 [2023-11-19 07:46:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:13,569 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 603 transitions. [2023-11-19 07:46:13,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 603 transitions. [2023-11-19 07:46:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-11-19 07:46:13,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:13,580 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:13,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-19 07:46:13,580 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:13,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash 936214900, now seen corresponding path program 1 times [2023-11-19 07:46:13,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:13,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594672925] [2023-11-19 07:46:13,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:13,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:15,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:15,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:15,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:15,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-19 07:46:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-19 07:46:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:15,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-19 07:46:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:46:15,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:15,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594672925] [2023-11-19 07:46:15,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594672925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:15,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:15,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:46:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534445983] [2023-11-19 07:46:15,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:15,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:46:15,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:15,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:46:15,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:46:15,338 INFO L87 Difference]: Start difference. First operand 392 states and 603 transitions. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:15,441 INFO L93 Difference]: Finished difference Result 639 states and 982 transitions. [2023-11-19 07:46:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 315 [2023-11-19 07:46:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:15,445 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:46:15,445 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:46:15,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:15,447 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 309 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:15,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 882 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:46:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:46:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:46:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5364583333333333) internal successors, (590), 384 states have internal predecessors, (590), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:46:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 602 transitions. [2023-11-19 07:46:15,474 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 602 transitions. Word has length 315 [2023-11-19 07:46:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:15,474 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 602 transitions. [2023-11-19 07:46:15,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 602 transitions. [2023-11-19 07:46:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-11-19 07:46:15,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:15,480 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:15,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-19 07:46:15,481 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:15,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:15,482 INFO L85 PathProgramCache]: Analyzing trace with hash 324945842, now seen corresponding path program 1 times [2023-11-19 07:46:15,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:15,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32438297] [2023-11-19 07:46:15,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:15,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:17,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:17,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:17,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-19 07:46:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:17,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-19 07:46:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:17,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-19 07:46:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:46:17,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:17,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32438297] [2023-11-19 07:46:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32438297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:46:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441180911] [2023-11-19 07:46:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:17,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:46:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:17,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:46:17,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:17,513 INFO L87 Difference]: Start difference. First operand 392 states and 602 transitions. Second operand has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:18,152 INFO L93 Difference]: Finished difference Result 960 states and 1478 transitions. [2023-11-19 07:46:18,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:46:18,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 315 [2023-11-19 07:46:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:18,158 INFO L225 Difference]: With dead ends: 960 [2023-11-19 07:46:18,158 INFO L226 Difference]: Without dead ends: 713 [2023-11-19 07:46:18,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:46:18,160 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 313 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:18,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 2063 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:46:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2023-11-19 07:46:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 605. [2023-11-19 07:46:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 594 states have (on average 1.5303030303030303) internal successors, (909), 594 states have internal predecessors, (909), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-19 07:46:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 927 transitions. [2023-11-19 07:46:18,203 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 927 transitions. Word has length 315 [2023-11-19 07:46:18,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:18,204 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 927 transitions. [2023-11-19 07:46:18,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 927 transitions. [2023-11-19 07:46:18,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-11-19 07:46:18,211 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:18,211 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:18,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-19 07:46:18,212 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:18,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash -415157022, now seen corresponding path program 1 times [2023-11-19 07:46:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:18,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903447072] [2023-11-19 07:46:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:18,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:21,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:46:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:21,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:46:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:46:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:21,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-19 07:46:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-11-19 07:46:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:21,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-11-19 07:46:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-11-19 07:46:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:21,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903447072] [2023-11-19 07:46:21,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903447072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:21,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:21,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:46:21,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410341438] [2023-11-19 07:46:21,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:21,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:46:21,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:21,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:46:21,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:46:21,441 INFO L87 Difference]: Start difference. First operand 605 states and 927 transitions. Second operand has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:22,002 INFO L93 Difference]: Finished difference Result 1294 states and 1976 transitions. [2023-11-19 07:46:22,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:46:22,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 316 [2023-11-19 07:46:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:22,006 INFO L225 Difference]: With dead ends: 1294 [2023-11-19 07:46:22,007 INFO L226 Difference]: Without dead ends: 617 [2023-11-19 07:46:22,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:46:22,009 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 956 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:22,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 1762 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:46:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2023-11-19 07:46:22,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2023-11-19 07:46:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 600 states have (on average 1.52) internal successors, (912), 600 states have internal predecessors, (912), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-19 07:46:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 930 transitions. [2023-11-19 07:46:22,064 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 930 transitions. Word has length 316 [2023-11-19 07:46:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:22,064 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 930 transitions. [2023-11-19 07:46:22,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 930 transitions. [2023-11-19 07:46:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2023-11-19 07:46:22,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:22,072 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:22,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-19 07:46:22,073 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:22,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:22,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1781457898, now seen corresponding path program 1 times [2023-11-19 07:46:22,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:22,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329525725] [2023-11-19 07:46:22,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:22,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:24,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:46:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:24,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:46:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:46:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:24,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-11-19 07:46:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:24,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-11-19 07:46:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-11-19 07:46:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:46:24,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:24,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329525725] [2023-11-19 07:46:24,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329525725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:24,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:24,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:46:24,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166753987] [2023-11-19 07:46:24,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:24,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:46:24,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:24,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:46:24,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:24,363 INFO L87 Difference]: Start difference. First operand 611 states and 930 transitions. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:24,935 INFO L93 Difference]: Finished difference Result 898 states and 1372 transitions. [2023-11-19 07:46:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:46:24,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 318 [2023-11-19 07:46:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:24,940 INFO L225 Difference]: With dead ends: 898 [2023-11-19 07:46:24,941 INFO L226 Difference]: Without dead ends: 649 [2023-11-19 07:46:24,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:46:24,942 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 649 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:24,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1332 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:46:24,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-11-19 07:46:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 612. [2023-11-19 07:46:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 601 states have (on average 1.519134775374376) internal successors, (913), 601 states have internal predecessors, (913), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-19 07:46:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 931 transitions. [2023-11-19 07:46:24,981 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 931 transitions. Word has length 318 [2023-11-19 07:46:24,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:24,981 INFO L495 AbstractCegarLoop]: Abstraction has 612 states and 931 transitions. [2023-11-19 07:46:24,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:46:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 931 transitions. [2023-11-19 07:46:24,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2023-11-19 07:46:24,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:24,990 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:24,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-19 07:46:24,990 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:24,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash -61017816, now seen corresponding path program 1 times [2023-11-19 07:46:24,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:24,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991470848] [2023-11-19 07:46:24,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:24,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms