./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl --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 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:17:42,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:17:43,042 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-12 02:17:43,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:17:43,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:17:43,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:17:43,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:17:43,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:17:43,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:17:43,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:17:43,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:17:43,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:17:43,084 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:17:43,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:17:43,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:17:43,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:17:43,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:17:43,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:17:43,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:17:43,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:17:43,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:17:43,092 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:17:43,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:17:43,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:17:43,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:17:43,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:17:43,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:17:43,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:17:43,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:17:43,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:17:43,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:17:43,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:17:43,100 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:17:43,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:17:43,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:17:43,116 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:17:43,116 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_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/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_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl 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 -> 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca [2023-11-12 02:17:43,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:17:43,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:17:43,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:17:43,468 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:17:43,469 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:17:43,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2023-11-12 02:17:46,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:17:47,120 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:17:47,124 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2023-11-12 02:17:47,151 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/data/aa6fbbb1f/f293bfe63bee4e5d9e9c2d3eb9f4aeff/FLAGad05502f2 [2023-11-12 02:17:47,175 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/data/aa6fbbb1f/f293bfe63bee4e5d9e9c2d3eb9f4aeff [2023-11-12 02:17:47,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:17:47,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:17:47,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:17:47,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:17:47,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:17:47,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:17:47" (1/1) ... [2023-11-12 02:17:47,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2251700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:47, skipping insertion in model container [2023-11-12 02:17:47,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:17:47" (1/1) ... [2023-11-12 02:17:47,297 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:17:47,554 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_064fcad5-cef6-416e-b49c-b2caa1f0958f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2023-11-12 02:17:47,859 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:17:47,878 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:17:47,891 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_064fcad5-cef6-416e-b49c-b2caa1f0958f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2023-11-12 02:17:48,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:17:48,034 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:17:48,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48 WrapperNode [2023-11-12 02:17:48,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:17:48,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:17:48,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:17:48,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:17:48,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48" (1/1) ... [2023-11-12 02:17:48,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48" (1/1) ... [2023-11-12 02:17:48,277 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1571 [2023-11-12 02:17:48,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:17:48,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:17:48,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:17:48,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:17:48,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48" (1/1) ... [2023-11-12 02:17:48,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48" (1/1) ... [2023-11-12 02:17:48,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48" (1/1) ... [2023-11-12 02:17:48,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48" (1/1) ... [2023-11-12 02:17:48,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48" (1/1) ... [2023-11-12 02:17:48,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48" (1/1) ... [2023-11-12 02:17:48,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48" (1/1) ... [2023-11-12 02:17:48,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48" (1/1) ... [2023-11-12 02:17:48,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:17:48,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:17:48,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:17:48,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:17:48,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48" (1/1) ... [2023-11-12 02:17:48,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:17:48,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:17:48,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:17:48,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_064fcad5-cef6-416e-b49c-b2caa1f0958f/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:17:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:17:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:17:48,676 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:17:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:17:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:17:48,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:17:48,892 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:17:48,894 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:17:50,820 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:17:50,840 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:17:50,841 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:17:50,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:17:50 BoogieIcfgContainer [2023-11-12 02:17:50,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:17:50,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:17:50,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:17:50,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:17:50,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:17:47" (1/3) ... [2023-11-12 02:17:50,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9818768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:17:50, skipping insertion in model container [2023-11-12 02:17:50,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:48" (2/3) ... [2023-11-12 02:17:50,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9818768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:17:50, skipping insertion in model container [2023-11-12 02:17:50,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:17:50" (3/3) ... [2023-11-12 02:17:50,864 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2023-11-12 02:17:50,887 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:17:50,887 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:17:50,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:17:51,014 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;@2cd69edb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:17:51,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:17:51,033 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-12 02:17:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-12 02:17:51,063 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:51,064 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-12 02:17:51,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:51,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash -814456904, now seen corresponding path program 1 times [2023-11-12 02:17:51,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:51,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601461216] [2023-11-12 02:17:51,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:51,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:17:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:17:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:51,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-12 02:17:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:51,639 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-12 02:17:51,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601461216] [2023-11-12 02:17:51,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601461216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:51,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:51,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:17:51,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818727529] [2023-11-12 02:17:51,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:51,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:17:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:51,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:17:51,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:17:51,687 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-12 02:17:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:51,741 INFO L93 Difference]: Finished difference Result 543 states and 895 transitions. [2023-11-12 02:17:51,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:17:51,748 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-12 02:17:51,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:51,764 INFO L225 Difference]: With dead ends: 543 [2023-11-12 02:17:51,764 INFO L226 Difference]: Without dead ends: 296 [2023-11-12 02:17:51,773 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-12 02:17:51,779 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-12 02:17:51,781 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-12 02:17:51,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-11-12 02:17:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2023-11-12 02:17:51,865 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-12 02:17:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 484 transitions. [2023-11-12 02:17:51,871 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 484 transitions. Word has length 117 [2023-11-12 02:17:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:51,872 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 484 transitions. [2023-11-12 02:17:51,872 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-12 02:17:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 484 transitions. [2023-11-12 02:17:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-12 02:17:51,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:51,877 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-12 02:17:51,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:17:51,878 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:51,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1624445682, now seen corresponding path program 1 times [2023-11-12 02:17:51,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:51,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676931681] [2023-11-12 02:17:51,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:51,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:53,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:17:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:53,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:17:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:53,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-12 02:17:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:53,234 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-12 02:17:53,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676931681] [2023-11-12 02:17:53,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676931681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:53,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:17:53,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643917248] [2023-11-12 02:17:53,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:53,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:17:53,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:53,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:17:53,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:17:53,255 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-12 02:17:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:53,310 INFO L93 Difference]: Finished difference Result 300 states and 488 transitions. [2023-11-12 02:17:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:17:53,323 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-12 02:17:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:53,330 INFO L225 Difference]: With dead ends: 300 [2023-11-12 02:17:53,331 INFO L226 Difference]: Without dead ends: 298 [2023-11-12 02:17:53,343 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-12 02:17:53,345 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-12 02:17:53,345 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-12 02:17:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-11-12 02:17:53,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-11-12 02:17:53,363 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-12 02:17:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 486 transitions. [2023-11-12 02:17:53,366 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 486 transitions. Word has length 117 [2023-11-12 02:17:53,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:53,368 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 486 transitions. [2023-11-12 02:17:53,369 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-12 02:17:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 486 transitions. [2023-11-12 02:17:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:17:53,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:53,372 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-12 02:17:53,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:17:53,373 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:53,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:53,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1180065892, now seen corresponding path program 1 times [2023-11-12 02:17:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:53,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008183809] [2023-11-12 02:17:53,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:53,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:54,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:17:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:54,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:17:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:54,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-12 02:17:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:54,046 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-12 02:17:54,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:54,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008183809] [2023-11-12 02:17:54,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008183809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:54,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:54,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:17:54,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959202891] [2023-11-12 02:17:54,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:54,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:17:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:54,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:17:54,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:17:54,050 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-12 02:17:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:54,623 INFO L93 Difference]: Finished difference Result 753 states and 1223 transitions. [2023-11-12 02:17:54,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:17:54,624 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-12 02:17:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:54,627 INFO L225 Difference]: With dead ends: 753 [2023-11-12 02:17:54,628 INFO L226 Difference]: Without dead ends: 298 [2023-11-12 02:17:54,630 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-12 02:17:54,631 INFO L413 NwaCegarLoop]: 525 mSDtfsCounter, 913 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:17:54,632 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.5s Time] [2023-11-12 02:17:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-11-12 02:17:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-11-12 02:17:54,655 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-12 02:17:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 485 transitions. [2023-11-12 02:17:54,658 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 485 transitions. Word has length 118 [2023-11-12 02:17:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:54,659 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 485 transitions. [2023-11-12 02:17:54,659 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-12 02:17:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 485 transitions. [2023-11-12 02:17:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-12 02:17:54,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:54,670 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-12 02:17:54,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:17:54,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:54,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:54,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1807819958, now seen corresponding path program 1 times [2023-11-12 02:17:54,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:54,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620076351] [2023-11-12 02:17:54,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:54,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:55,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:17:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:55,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:17:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-12 02:17:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:55,226 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-12 02:17:55,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:55,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620076351] [2023-11-12 02:17:55,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620076351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:55,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:55,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:17:55,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794967343] [2023-11-12 02:17:55,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:55,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:17:55,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:55,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:17:55,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:17:55,233 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-12 02:17:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:55,279 INFO L93 Difference]: Finished difference Result 546 states and 887 transitions. [2023-11-12 02:17:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:17:55,280 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-12 02:17:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:55,283 INFO L225 Difference]: With dead ends: 546 [2023-11-12 02:17:55,284 INFO L226 Difference]: Without dead ends: 301 [2023-11-12 02:17:55,285 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-12 02:17:55,296 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-12 02:17:55,298 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-12 02:17:55,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-11-12 02:17:55,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2023-11-12 02:17:55,311 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-12 02:17:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 487 transitions. [2023-11-12 02:17:55,313 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 487 transitions. Word has length 119 [2023-11-12 02:17:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:55,315 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 487 transitions. [2023-11-12 02:17:55,315 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-12 02:17:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 487 transitions. [2023-11-12 02:17:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-12 02:17:55,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:55,319 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-12 02:17:55,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:17:55,319 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:55,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:55,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2588046, now seen corresponding path program 1 times [2023-11-12 02:17:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:55,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459420827] [2023-11-12 02:17:55,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:55,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:56,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:17:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:56,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:17:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:56,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-12 02:17:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:56,036 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-12 02:17:56,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:56,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459420827] [2023-11-12 02:17:56,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459420827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:56,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:56,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:17:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452458138] [2023-11-12 02:17:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:56,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:17:56,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:56,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:17:56,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:17:56,042 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-12 02:17:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:56,186 INFO L93 Difference]: Finished difference Result 547 states and 887 transitions. [2023-11-12 02:17:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:17:56,187 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-12 02:17:56,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:56,189 INFO L225 Difference]: With dead ends: 547 [2023-11-12 02:17:56,190 INFO L226 Difference]: Without dead ends: 300 [2023-11-12 02:17:56,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:17:56,192 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 392 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 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-12 02:17:56,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 900 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:17:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-12 02:17:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-12 02:17:56,202 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-12 02:17:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 486 transitions. [2023-11-12 02:17:56,204 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 486 transitions. Word has length 120 [2023-11-12 02:17:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:56,206 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 486 transitions. [2023-11-12 02:17:56,206 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-12 02:17:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 486 transitions. [2023-11-12 02:17:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-12 02:17:56,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:56,208 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-12 02:17:56,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:17:56,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:56,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:56,210 INFO L85 PathProgramCache]: Analyzing trace with hash -437020774, now seen corresponding path program 1 times [2023-11-12 02:17:56,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:56,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113907043] [2023-11-12 02:17:56,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:56,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:56,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:17:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:56,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:17:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:56,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-12 02:17:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:56,724 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-12 02:17:56,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:56,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113907043] [2023-11-12 02:17:56,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113907043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:56,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:56,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:17:56,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512749231] [2023-11-12 02:17:56,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:56,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:17:56,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:56,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:17:56,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:17:56,727 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-12 02:17:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:56,840 INFO L93 Difference]: Finished difference Result 547 states and 885 transitions. [2023-11-12 02:17:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:17:56,841 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-12 02:17:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:56,846 INFO L225 Difference]: With dead ends: 547 [2023-11-12 02:17:56,846 INFO L226 Difference]: Without dead ends: 300 [2023-11-12 02:17:56,847 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-12 02:17:56,848 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 856 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:17:56,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 900 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:17:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-12 02:17:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-12 02:17:56,860 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-12 02:17:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 485 transitions. [2023-11-12 02:17:56,862 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 485 transitions. Word has length 121 [2023-11-12 02:17:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:56,862 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 485 transitions. [2023-11-12 02:17:56,862 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-12 02:17:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 485 transitions. [2023-11-12 02:17:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-12 02:17:56,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:56,864 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-12 02:17:56,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:17:56,865 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:56,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash 599648588, now seen corresponding path program 1 times [2023-11-12 02:17:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448932663] [2023-11-12 02:17:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:57,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:17:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:57,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:17:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:57,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-12 02:17:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:57,251 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-12 02:17:57,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:57,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448932663] [2023-11-12 02:17:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448932663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:57,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:57,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:17:57,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655333606] [2023-11-12 02:17:57,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:57,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:17:57,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:57,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:17:57,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:17:57,255 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-12 02:17:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:57,372 INFO L93 Difference]: Finished difference Result 547 states and 883 transitions. [2023-11-12 02:17:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:17:57,373 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-12 02:17:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:57,375 INFO L225 Difference]: With dead ends: 547 [2023-11-12 02:17:57,375 INFO L226 Difference]: Without dead ends: 300 [2023-11-12 02:17:57,376 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-12 02:17:57,377 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 848 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 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-12 02:17:57,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 900 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:17:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-12 02:17:57,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-12 02:17:57,386 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-12 02:17:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 484 transitions. [2023-11-12 02:17:57,389 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 484 transitions. Word has length 122 [2023-11-12 02:17:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:57,389 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 484 transitions. [2023-11-12 02:17:57,389 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-12 02:17:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 484 transitions. [2023-11-12 02:17:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-12 02:17:57,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:57,395 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-12 02:17:57,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:17:57,395 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:57,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash 291192372, now seen corresponding path program 1 times [2023-11-12 02:17:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:57,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513924339] [2023-11-12 02:17:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:57,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:17:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:57,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:17:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:57,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-12 02:17:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:57,860 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-12 02:17:57,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:57,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513924339] [2023-11-12 02:17:57,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513924339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:57,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:57,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:17:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844069477] [2023-11-12 02:17:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:57,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:17:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:57,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:17:57,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:17:57,863 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-12 02:17:58,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:58,002 INFO L93 Difference]: Finished difference Result 547 states and 881 transitions. [2023-11-12 02:17:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:17:58,003 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-12 02:17:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:58,006 INFO L225 Difference]: With dead ends: 547 [2023-11-12 02:17:58,006 INFO L226 Difference]: Without dead ends: 300 [2023-11-12 02:17:58,007 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-12 02:17:58,008 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 463 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 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-12 02:17:58,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 907 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:17:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-12 02:17:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-12 02:17:58,019 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-12 02:17:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 483 transitions. [2023-11-12 02:17:58,021 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 483 transitions. Word has length 123 [2023-11-12 02:17:58,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:58,022 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 483 transitions. [2023-11-12 02:17:58,023 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-12 02:17:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 483 transitions. [2023-11-12 02:17:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-12 02:17:58,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:58,025 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-12 02:17:58,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:17:58,026 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:58,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash -419805914, now seen corresponding path program 1 times [2023-11-12 02:17:58,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:58,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699817050] [2023-11-12 02:17:58,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:58,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:58,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:17:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:58,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:17:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:58,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-12 02:17:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:58,653 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-12 02:17:58,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:58,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699817050] [2023-11-12 02:17:58,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699817050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:58,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:58,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:17:58,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617454339] [2023-11-12 02:17:58,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:58,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:17:58,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:58,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:17:58,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:17:58,657 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-12 02:17:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:58,732 INFO L93 Difference]: Finished difference Result 547 states and 879 transitions. [2023-11-12 02:17:58,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:17:58,733 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-12 02:17:58,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:58,736 INFO L225 Difference]: With dead ends: 547 [2023-11-12 02:17:58,736 INFO L226 Difference]: Without dead ends: 300 [2023-11-12 02:17:58,737 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-12 02:17:58,738 INFO L413 NwaCegarLoop]: 461 mSDtfsCounter, 390 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 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-12 02:17:58,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 924 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-12 02:17:58,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-12 02:17:58,748 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-12 02:17:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 481 transitions. [2023-11-12 02:17:58,750 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 481 transitions. Word has length 124 [2023-11-12 02:17:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:58,751 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 481 transitions. [2023-11-12 02:17:58,751 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-12 02:17:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 481 transitions. [2023-11-12 02:17:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-12 02:17:58,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:58,754 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-12 02:17:58,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:17:58,754 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:58,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:58,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1524377896, now seen corresponding path program 1 times [2023-11-12 02:17:58,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:58,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798267130] [2023-11-12 02:17:58,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:58,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:59,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:17:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:59,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:17:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:59,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-12 02:17:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:59,165 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-12 02:17:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798267130] [2023-11-12 02:17:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798267130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:59,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:59,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:17:59,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689604714] [2023-11-12 02:17:59,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:59,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:17:59,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:59,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:17:59,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:17:59,169 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-12 02:17:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:59,249 INFO L93 Difference]: Finished difference Result 547 states and 875 transitions. [2023-11-12 02:17:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:17:59,249 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-12 02:17:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:59,252 INFO L225 Difference]: With dead ends: 547 [2023-11-12 02:17:59,252 INFO L226 Difference]: Without dead ends: 300 [2023-11-12 02:17:59,253 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-12 02:17:59,254 INFO L413 NwaCegarLoop]: 461 mSDtfsCounter, 850 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:17:59,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 924 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-12 02:17:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-12 02:17:59,264 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-12 02:17:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 480 transitions. [2023-11-12 02:17:59,267 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 480 transitions. Word has length 125 [2023-11-12 02:17:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:59,267 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 480 transitions. [2023-11-12 02:17:59,268 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-12 02:17:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 480 transitions. [2023-11-12 02:17:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-12 02:17:59,270 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:59,270 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-12 02:17:59,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:17:59,270 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:59,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1661121666, now seen corresponding path program 1 times [2023-11-12 02:17:59,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:59,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339000828] [2023-11-12 02:17:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:59,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:17:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:59,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:17:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:59,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-12 02:17:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:59,860 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-12 02:17:59,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:59,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339000828] [2023-11-12 02:17:59,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339000828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:59,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:59,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:17:59,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470123482] [2023-11-12 02:17:59,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:59,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:17:59,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:59,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:17:59,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:17:59,863 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-12 02:17:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:59,943 INFO L93 Difference]: Finished difference Result 547 states and 873 transitions. [2023-11-12 02:17:59,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:17:59,944 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-12 02:17:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:59,946 INFO L225 Difference]: With dead ends: 547 [2023-11-12 02:17:59,946 INFO L226 Difference]: Without dead ends: 300 [2023-11-12 02:17:59,947 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-12 02:17:59,948 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-12 02:17:59,948 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-12 02:17:59,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-12 02:17:59,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-12 02:17:59,960 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-12 02:17:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 479 transitions. [2023-11-12 02:17:59,962 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 479 transitions. Word has length 126 [2023-11-12 02:17:59,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:59,963 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 479 transitions. [2023-11-12 02:17:59,963 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-12 02:17:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 479 transitions. [2023-11-12 02:17:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-12 02:17:59,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:59,965 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-12 02:17:59,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:17:59,966 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:59,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:59,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2113030220, now seen corresponding path program 1 times [2023-11-12 02:17:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:59,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887651944] [2023-11-12 02:17:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:00,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:00,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:00,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:00,880 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-12 02:18:00,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:00,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887651944] [2023-11-12 02:18:00,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887651944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:00,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:00,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153539855] [2023-11-12 02:18:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:00,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:00,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:00,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:00,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:00,883 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-12 02:18:01,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:01,009 INFO L93 Difference]: Finished difference Result 547 states and 871 transitions. [2023-11-12 02:18:01,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:01,010 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-12 02:18:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:01,012 INFO L225 Difference]: With dead ends: 547 [2023-11-12 02:18:01,012 INFO L226 Difference]: Without dead ends: 300 [2023-11-12 02:18:01,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:18:01,014 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 381 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:01,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 892 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:18:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-12 02:18:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-12 02:18:01,026 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-12 02:18:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 478 transitions. [2023-11-12 02:18:01,028 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 478 transitions. Word has length 127 [2023-11-12 02:18:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:01,028 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 478 transitions. [2023-11-12 02:18:01,029 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-12 02:18:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 478 transitions. [2023-11-12 02:18:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-12 02:18:01,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:01,031 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-12 02:18:01,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:18:01,031 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:01,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash 307591886, now seen corresponding path program 1 times [2023-11-12 02:18:01,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:01,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024651629] [2023-11-12 02:18:01,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:01,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:01,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:01,695 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-12 02:18:01,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:01,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024651629] [2023-11-12 02:18:01,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024651629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:01,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:01,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:01,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415437094] [2023-11-12 02:18:01,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:01,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:01,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:01,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:01,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:01,698 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-12 02:18:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:01,837 INFO L93 Difference]: Finished difference Result 547 states and 869 transitions. [2023-11-12 02:18:01,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:01,838 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-12 02:18:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:01,840 INFO L225 Difference]: With dead ends: 547 [2023-11-12 02:18:01,840 INFO L226 Difference]: Without dead ends: 300 [2023-11-12 02:18:01,841 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-12 02:18:01,842 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-12 02:18:01,843 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-12 02:18:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-12 02:18:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-12 02:18:01,855 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-12 02:18:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 477 transitions. [2023-11-12 02:18:01,857 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 477 transitions. Word has length 127 [2023-11-12 02:18:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:01,857 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 477 transitions. [2023-11-12 02:18:01,858 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-12 02:18:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 477 transitions. [2023-11-12 02:18:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-12 02:18:01,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:01,860 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-12 02:18:01,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:18:01,860 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:01,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:01,861 INFO L85 PathProgramCache]: Analyzing trace with hash -510056564, now seen corresponding path program 1 times [2023-11-12 02:18:01,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:01,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294483758] [2023-11-12 02:18:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:01,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:02,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:02,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:02,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:02,471 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-12 02:18:02,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:02,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294483758] [2023-11-12 02:18:02,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294483758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:02,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:02,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:02,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22341689] [2023-11-12 02:18:02,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:02,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:02,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:02,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:02,474 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-12 02:18:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:02,606 INFO L93 Difference]: Finished difference Result 547 states and 867 transitions. [2023-11-12 02:18:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:02,607 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-12 02:18:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:02,609 INFO L225 Difference]: With dead ends: 547 [2023-11-12 02:18:02,610 INFO L226 Difference]: Without dead ends: 300 [2023-11-12 02:18:02,610 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-12 02:18:02,611 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-12 02:18:02,611 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-12 02:18:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-12 02:18:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-12 02:18:02,624 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-12 02:18:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 476 transitions. [2023-11-12 02:18:02,626 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 476 transitions. Word has length 127 [2023-11-12 02:18:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:02,627 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 476 transitions. [2023-11-12 02:18:02,627 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-12 02:18:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 476 transitions. [2023-11-12 02:18:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-12 02:18:02,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:02,629 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-12 02:18:02,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:18:02,630 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:02,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:02,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2098404466, now seen corresponding path program 1 times [2023-11-12 02:18:02,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:02,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979589803] [2023-11-12 02:18:02,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:02,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:03,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:03,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:03,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:03,022 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-12 02:18:03,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:03,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979589803] [2023-11-12 02:18:03,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979589803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:03,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:03,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:18:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296048573] [2023-11-12 02:18:03,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:03,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:18:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:03,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:18:03,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:18:03,025 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-12 02:18:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:03,099 INFO L93 Difference]: Finished difference Result 547 states and 865 transitions. [2023-11-12 02:18:03,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:03,100 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-12 02:18:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:03,102 INFO L225 Difference]: With dead ends: 547 [2023-11-12 02:18:03,102 INFO L226 Difference]: Without dead ends: 300 [2023-11-12 02:18:03,105 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-12 02:18:03,105 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-12 02:18:03,106 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-12 02:18:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-12 02:18:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-12 02:18:03,118 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-12 02:18:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 475 transitions. [2023-11-12 02:18:03,120 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 475 transitions. Word has length 127 [2023-11-12 02:18:03,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:03,121 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 475 transitions. [2023-11-12 02:18:03,121 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-12 02:18:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 475 transitions. [2023-11-12 02:18:03,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-12 02:18:03,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:03,123 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-12 02:18:03,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:18:03,124 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:03,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2071338864, now seen corresponding path program 1 times [2023-11-12 02:18:03,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:03,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780836366] [2023-11-12 02:18:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:03,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:04,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:04,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:04,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:04,276 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-12 02:18:04,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:04,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780836366] [2023-11-12 02:18:04,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780836366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:04,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:18:04,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598968477] [2023-11-12 02:18:04,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:04,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:18:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:04,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:18:04,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:18:04,281 INFO L87 Difference]: Start difference. First operand 300 states and 475 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-12 02:18:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:04,512 INFO L93 Difference]: Finished difference Result 873 states and 1374 transitions. [2023-11-12 02:18:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:18:04,513 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-12 02:18:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:04,517 INFO L225 Difference]: With dead ends: 873 [2023-11-12 02:18:04,517 INFO L226 Difference]: Without dead ends: 626 [2023-11-12 02:18:04,518 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-12 02:18:04,519 INFO L413 NwaCegarLoop]: 591 mSDtfsCounter, 1957 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1960 SdHoareTripleChecker+Valid, 1978 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-12 02:18:04,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1960 Valid, 1978 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:18:04,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2023-11-12 02:18:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 392. [2023-11-12 02:18:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5651041666666667) internal successors, (601), 384 states have internal predecessors, (601), 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-12 02:18:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 613 transitions. [2023-11-12 02:18:04,547 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 613 transitions. Word has length 127 [2023-11-12 02:18:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:04,548 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 613 transitions. [2023-11-12 02:18:04,548 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-12 02:18:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 613 transitions. [2023-11-12 02:18:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2023-11-12 02:18:04,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:04,554 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-12 02:18:04,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 02:18:04,554 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:04,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1200497368, now seen corresponding path program 1 times [2023-11-12 02:18:04,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:04,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838095278] [2023-11-12 02:18:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:05,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:05,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:05,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-12 02:18:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-12 02:18:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:05,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-12 02:18:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:05,629 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-12 02:18:05,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:05,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838095278] [2023-11-12 02:18:05,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838095278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:05,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:05,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:05,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422353384] [2023-11-12 02:18:05,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:05,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:05,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:05,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:05,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:05,634 INFO L87 Difference]: Start difference. First operand 392 states and 613 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-12 02:18:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:05,755 INFO L93 Difference]: Finished difference Result 639 states and 1001 transitions. [2023-11-12 02:18:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:05,756 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-12 02:18:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:05,759 INFO L225 Difference]: With dead ends: 639 [2023-11-12 02:18:05,759 INFO L226 Difference]: Without dead ends: 392 [2023-11-12 02:18:05,760 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-12 02:18:05,760 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 427 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 897 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-12 02:18:05,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 897 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:18:05,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-12 02:18:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-12 02:18:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5625) internal successors, (600), 384 states have internal predecessors, (600), 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-12 02:18:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 612 transitions. [2023-11-12 02:18:05,785 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 612 transitions. Word has length 308 [2023-11-12 02:18:05,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:05,786 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 612 transitions. [2023-11-12 02:18:05,786 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-12 02:18:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 612 transitions. [2023-11-12 02:18:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2023-11-12 02:18:05,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:05,792 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-12 02:18:05,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 02:18:05,792 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:05,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:05,793 INFO L85 PathProgramCache]: Analyzing trace with hash 287320224, now seen corresponding path program 1 times [2023-11-12 02:18:05,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:05,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919460319] [2023-11-12 02:18:05,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:05,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:06,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:06,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:06,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-11-12 02:18:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-11-12 02:18:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:06,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-12 02:18:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:06,855 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-12 02:18:06,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:06,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919460319] [2023-11-12 02:18:06,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919460319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:06,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:06,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:06,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797483338] [2023-11-12 02:18:06,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:06,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:06,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:06,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:06,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:06,859 INFO L87 Difference]: Start difference. First operand 392 states and 612 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-12 02:18:06,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:06,992 INFO L93 Difference]: Finished difference Result 639 states and 999 transitions. [2023-11-12 02:18:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:06,993 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-12 02:18:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:06,996 INFO L225 Difference]: With dead ends: 639 [2023-11-12 02:18:06,996 INFO L226 Difference]: Without dead ends: 392 [2023-11-12 02:18:06,997 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-12 02:18:06,998 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 749 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 890 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-12 02:18:06,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 890 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:18:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-12 02:18:07,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-12 02:18:07,024 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-12 02:18:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 611 transitions. [2023-11-12 02:18:07,027 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 611 transitions. Word has length 309 [2023-11-12 02:18:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:07,028 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 611 transitions. [2023-11-12 02:18:07,028 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-12 02:18:07,029 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 611 transitions. [2023-11-12 02:18:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2023-11-12 02:18:07,035 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:07,035 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-12 02:18:07,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 02:18:07,036 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:07,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1215824116, now seen corresponding path program 1 times [2023-11-12 02:18:07,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984539357] [2023-11-12 02:18:07,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:07,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:08,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:08,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:08,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:08,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-11-12 02:18:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:08,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-12 02:18:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:08,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-11-12 02:18:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:08,089 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-12 02:18:08,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984539357] [2023-11-12 02:18:08,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984539357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:08,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:08,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:08,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062381181] [2023-11-12 02:18:08,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:08,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:08,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:08,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:08,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:08,096 INFO L87 Difference]: Start difference. First operand 392 states and 611 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-12 02:18:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:08,226 INFO L93 Difference]: Finished difference Result 639 states and 997 transitions. [2023-11-12 02:18:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:08,227 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-12 02:18:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:08,231 INFO L225 Difference]: With dead ends: 639 [2023-11-12 02:18:08,232 INFO L226 Difference]: Without dead ends: 392 [2023-11-12 02:18:08,232 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-12 02:18:08,233 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 733 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 890 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-12 02:18:08,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 890 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:18:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-12 02:18:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-12 02:18:08,257 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-12 02:18:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 610 transitions. [2023-11-12 02:18:08,260 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 610 transitions. Word has length 310 [2023-11-12 02:18:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:08,261 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 610 transitions. [2023-11-12 02:18:08,261 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-12 02:18:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 610 transitions. [2023-11-12 02:18:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2023-11-12 02:18:08,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:08,268 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-12 02:18:08,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-12 02:18:08,268 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:08,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1730578384, now seen corresponding path program 1 times [2023-11-12 02:18:08,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:08,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11674133] [2023-11-12 02:18:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:08,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:09,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:09,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:09,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-12 02:18:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:09,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-12 02:18:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:09,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-12 02:18:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:09,300 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-12 02:18:09,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:09,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11674133] [2023-11-12 02:18:09,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11674133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:09,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:09,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066751348] [2023-11-12 02:18:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:09,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:09,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:09,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:09,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:09,305 INFO L87 Difference]: Start difference. First operand 392 states and 610 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-12 02:18:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:09,412 INFO L93 Difference]: Finished difference Result 639 states and 995 transitions. [2023-11-12 02:18:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:09,413 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-12 02:18:09,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:09,416 INFO L225 Difference]: With dead ends: 639 [2023-11-12 02:18:09,416 INFO L226 Difference]: Without dead ends: 392 [2023-11-12 02:18:09,419 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-12 02:18:09,422 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 717 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 890 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-12 02:18:09,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 890 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:18:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-12 02:18:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-12 02:18:09,448 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-12 02:18:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 609 transitions. [2023-11-12 02:18:09,451 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 609 transitions. Word has length 311 [2023-11-12 02:18:09,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:09,452 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 609 transitions. [2023-11-12 02:18:09,452 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-12 02:18:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 609 transitions. [2023-11-12 02:18:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-11-12 02:18:09,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:09,458 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-12 02:18:09,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-12 02:18:09,458 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:09,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1767025090, now seen corresponding path program 1 times [2023-11-12 02:18:09,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:09,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15853992] [2023-11-12 02:18:09,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:09,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:10,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:10,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:10,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:10,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-11-12 02:18:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-11-12 02:18:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:10,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-12 02:18:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:10,563 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-12 02:18:10,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:10,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15853992] [2023-11-12 02:18:10,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15853992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:10,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:10,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:10,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010362056] [2023-11-12 02:18:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:10,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:10,569 INFO L87 Difference]: Start difference. First operand 392 states and 609 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-12 02:18:10,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:10,661 INFO L93 Difference]: Finished difference Result 639 states and 993 transitions. [2023-11-12 02:18:10,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:10,662 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-12 02:18:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:10,665 INFO L225 Difference]: With dead ends: 639 [2023-11-12 02:18:10,666 INFO L226 Difference]: Without dead ends: 392 [2023-11-12 02:18:10,667 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-12 02:18:10,668 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 695 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:10,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 906 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:18:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-12 02:18:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-12 02:18:10,694 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-12 02:18:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 608 transitions. [2023-11-12 02:18:10,698 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 608 transitions. Word has length 312 [2023-11-12 02:18:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:10,699 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 608 transitions. [2023-11-12 02:18:10,699 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-12 02:18:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 608 transitions. [2023-11-12 02:18:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-11-12 02:18:10,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:10,705 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-12 02:18:10,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-12 02:18:10,705 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:10,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1817051586, now seen corresponding path program 1 times [2023-11-12 02:18:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:10,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141377708] [2023-11-12 02:18:10,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:11,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:11,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:11,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:11,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-11-12 02:18:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:11,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-11-12 02:18:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-11-12 02:18:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:11,933 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-12 02:18:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:11,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141377708] [2023-11-12 02:18:11,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141377708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:11,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:11,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6313308] [2023-11-12 02:18:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:11,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:11,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:11,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:11,939 INFO L87 Difference]: Start difference. First operand 392 states and 608 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-12 02:18:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:12,033 INFO L93 Difference]: Finished difference Result 639 states and 991 transitions. [2023-11-12 02:18:12,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:12,035 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-12 02:18:12,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:12,039 INFO L225 Difference]: With dead ends: 639 [2023-11-12 02:18:12,039 INFO L226 Difference]: Without dead ends: 392 [2023-11-12 02:18:12,041 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-12 02:18:12,042 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 679 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 906 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-12 02:18:12,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 906 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:18:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-12 02:18:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-12 02:18:12,071 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-12 02:18:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 607 transitions. [2023-11-12 02:18:12,074 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 607 transitions. Word has length 313 [2023-11-12 02:18:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:12,075 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 607 transitions. [2023-11-12 02:18:12,076 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-12 02:18:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 607 transitions. [2023-11-12 02:18:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-11-12 02:18:12,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:12,083 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-12 02:18:12,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-12 02:18:12,084 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:12,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:12,085 INFO L85 PathProgramCache]: Analyzing trace with hash -92715534, now seen corresponding path program 1 times [2023-11-12 02:18:12,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:12,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225850723] [2023-11-12 02:18:12,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:12,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:13,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:13,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:13,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-12 02:18:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-12 02:18:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:13,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-11-12 02:18:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:13,229 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-12 02:18:13,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:13,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225850723] [2023-11-12 02:18:13,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225850723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:13,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:13,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:13,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813555232] [2023-11-12 02:18:13,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:13,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:13,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:13,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:13,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:13,235 INFO L87 Difference]: Start difference. First operand 392 states and 607 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-12 02:18:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:13,611 INFO L93 Difference]: Finished difference Result 639 states and 989 transitions. [2023-11-12 02:18:13,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:13,612 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-12 02:18:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:13,615 INFO L225 Difference]: With dead ends: 639 [2023-11-12 02:18:13,616 INFO L226 Difference]: Without dead ends: 392 [2023-11-12 02:18:13,616 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-12 02:18:13,617 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 370 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 685 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-12 02:18:13,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 685 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:18:13,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-12 02:18:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-12 02:18:13,642 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-12 02:18:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 606 transitions. [2023-11-12 02:18:13,648 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 606 transitions. Word has length 314 [2023-11-12 02:18:13,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:13,648 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 606 transitions. [2023-11-12 02:18:13,649 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-12 02:18:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 606 transitions. [2023-11-12 02:18:13,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-11-12 02:18:13,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:13,655 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-12 02:18:13,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-12 02:18:13,655 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:13,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash -467654286, now seen corresponding path program 1 times [2023-11-12 02:18:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:13,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564598332] [2023-11-12 02:18:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-12 02:18:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-12 02:18:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-12 02:18:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,588 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-12 02:18:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:15,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564598332] [2023-11-12 02:18:15,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564598332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:15,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:15,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:15,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209148937] [2023-11-12 02:18:15,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:15,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:15,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:15,593 INFO L87 Difference]: Start difference. First operand 392 states and 606 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-12 02:18:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:15,740 INFO L93 Difference]: Finished difference Result 639 states and 987 transitions. [2023-11-12 02:18:15,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:15,741 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-12 02:18:15,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:15,744 INFO L225 Difference]: With dead ends: 639 [2023-11-12 02:18:15,744 INFO L226 Difference]: Without dead ends: 392 [2023-11-12 02:18:15,745 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-12 02:18:15,745 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 367 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 891 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-12 02:18:15,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 891 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:18:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-12 02:18:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-12 02:18:15,772 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-12 02:18:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 605 transitions. [2023-11-12 02:18:15,775 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 605 transitions. Word has length 315 [2023-11-12 02:18:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:15,776 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 605 transitions. [2023-11-12 02:18:15,776 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-12 02:18:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 605 transitions. [2023-11-12 02:18:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-11-12 02:18:15,781 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:15,782 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-12 02:18:15,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-12 02:18:15,782 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:15,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:15,783 INFO L85 PathProgramCache]: Analyzing trace with hash 936214900, now seen corresponding path program 1 times [2023-11-12 02:18:15,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:15,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975146879] [2023-11-12 02:18:15,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:15,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-12 02:18:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-12 02:18:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-12 02:18:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,758 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-12 02:18:17,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:17,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975146879] [2023-11-12 02:18:17,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975146879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:17,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:17,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:18:17,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041952563] [2023-11-12 02:18:17,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:17,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:18:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:17,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:18:17,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:18:17,764 INFO L87 Difference]: Start difference. First operand 392 states and 605 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-12 02:18:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:17,878 INFO L93 Difference]: Finished difference Result 639 states and 985 transitions. [2023-11-12 02:18:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:17,879 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-12 02:18:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:17,883 INFO L225 Difference]: With dead ends: 639 [2023-11-12 02:18:17,883 INFO L226 Difference]: Without dead ends: 392 [2023-11-12 02:18:17,884 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-12 02:18:17,885 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 310 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 884 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-12 02:18:17,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 884 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:18:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-12 02:18:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-12 02:18:17,919 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-12 02:18:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 604 transitions. [2023-11-12 02:18:17,922 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 604 transitions. Word has length 315 [2023-11-12 02:18:17,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:17,923 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 604 transitions. [2023-11-12 02:18:17,928 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-12 02:18:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 604 transitions. [2023-11-12 02:18:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-11-12 02:18:17,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:17,935 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-12 02:18:17,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-12 02:18:17,936 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:17,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:17,937 INFO L85 PathProgramCache]: Analyzing trace with hash 324945842, now seen corresponding path program 1 times [2023-11-12 02:18:17,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:17,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975793172] [2023-11-12 02:18:17,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-12 02:18:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-12 02:18:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-12 02:18:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,201 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-12 02:18:20,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:20,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975793172] [2023-11-12 02:18:20,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975793172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:20,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:20,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:18:20,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918006268] [2023-11-12 02:18:20,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:20,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:18:20,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:20,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:18:20,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:18:20,205 INFO L87 Difference]: Start difference. First operand 392 states and 604 transitions. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 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-12 02:18:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:20,448 INFO L93 Difference]: Finished difference Result 670 states and 1021 transitions. [2023-11-12 02:18:20,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:18:20,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 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-12 02:18:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:20,451 INFO L225 Difference]: With dead ends: 670 [2023-11-12 02:18:20,451 INFO L226 Difference]: Without dead ends: 392 [2023-11-12 02:18:20,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-12 02:18:20,453 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 4 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:20,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1255 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:18:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-12 02:18:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-12 02:18:20,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-12 02:18:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 602 transitions. [2023-11-12 02:18:20,474 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 602 transitions. Word has length 315 [2023-11-12 02:18:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:20,475 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 602 transitions. [2023-11-12 02:18:20,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 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-12 02:18:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 602 transitions. [2023-11-12 02:18:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2023-11-12 02:18:20,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:20,481 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] [2023-11-12 02:18:20,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-12 02:18:20,482 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:20,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash 932762414, now seen corresponding path program 1 times [2023-11-12 02:18:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721604852] [2023-11-12 02:18:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:22,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:22,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-12 02:18:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:22,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-11-12 02:18:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-11-12 02:18:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:22,651 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-12 02:18:22,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:22,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721604852] [2023-11-12 02:18:22,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721604852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:22,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:22,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:18:22,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884822893] [2023-11-12 02:18:22,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:22,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:18:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:22,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:18:22,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:18:22,656 INFO L87 Difference]: Start difference. First operand 392 states and 602 transitions. Second operand has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 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-12 02:18:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:23,330 INFO L93 Difference]: Finished difference Result 958 states and 1475 transitions. [2023-11-12 02:18:23,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:18:23,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 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 317 [2023-11-12 02:18:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:23,336 INFO L225 Difference]: With dead ends: 958 [2023-11-12 02:18:23,336 INFO L226 Difference]: Without dead ends: 711 [2023-11-12 02:18:23,337 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-12 02:18:23,337 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 311 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:23,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 2060 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:18:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2023-11-12 02:18:23,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 605. [2023-11-12 02:18:23,371 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-12 02:18:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 927 transitions. [2023-11-12 02:18:23,375 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 927 transitions. Word has length 317 [2023-11-12 02:18:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:23,376 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 927 transitions. [2023-11-12 02:18:23,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 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-12 02:18:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 927 transitions. [2023-11-12 02:18:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2023-11-12 02:18:23,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:23,382 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-12 02:18:23,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-12 02:18:23,383 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:23,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1165478474, now seen corresponding path program 1 times [2023-11-12 02:18:23,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:23,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409312807] [2023-11-12 02:18:23,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:23,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:18:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-12 02:18:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-12 02:18:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-11-12 02:18:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:25,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-11-12 02:18:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:25,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-11-12 02:18:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:25,674 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-12 02:18:25,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:25,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409312807] [2023-11-12 02:18:25,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409312807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:25,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:25,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:18:25,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703757785] [2023-11-12 02:18:25,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:25,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:18:25,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:25,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:18:25,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:18:25,678 INFO L87 Difference]: Start difference. First operand 605 states and 927 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-12 02:18:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:26,272 INFO L93 Difference]: Finished difference Result 890 states and 1368 transitions. [2023-11-12 02:18:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:18:26,273 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-12 02:18:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:26,277 INFO L225 Difference]: With dead ends: 890 [2023-11-12 02:18:26,278 INFO L226 Difference]: Without dead ends: 643 [2023-11-12 02:18:26,278 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-12 02:18:26,279 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 651 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:26,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1340 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:18:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2023-11-12 02:18:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 606. [2023-11-12 02:18:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 595 states have (on average 1.5294117647058822) internal successors, (910), 595 states have internal predecessors, (910), 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-12 02:18:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 928 transitions. [2023-11-12 02:18:26,309 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 928 transitions. Word has length 318 [2023-11-12 02:18:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:26,310 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 928 transitions. [2023-11-12 02:18:26,310 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-12 02:18:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 928 transitions. [2023-11-12 02:18:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2023-11-12 02:18:26,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:26,314 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-12 02:18:26,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-12 02:18:26,314 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:26,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:26,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1287013108, now seen corresponding path program 1 times [2023-11-12 02:18:26,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:26,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966334649] [2023-11-12 02:18:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:26,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms