./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 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/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_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:37:01,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:37:01,501 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-19 07:37:01,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:37:01,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:37:01,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:37:01,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:37:01,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:37:01,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:37:01,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:37:01,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:37:01,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:37:01,536 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:37:01,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:37:01,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:37:01,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:37:01,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:37:01,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:37:01,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:37:01,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:37:01,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:37:01,546 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:37:01,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:37:01,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:37:01,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:37:01,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:37:01,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:37:01,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:37:01,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:37:01,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:37:01,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:37:01,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:37:01,555 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:37:01,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:37:01,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:37:01,556 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:37:01,556 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_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca [2023-11-19 07:37:01,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:37:01,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:37:01,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:37:01,986 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:37:01,987 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:37:01,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2023-11-19 07:37:05,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:37:06,134 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:37:06,135 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2023-11-19 07:37:06,164 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/data/6dc99ef15/59a02cb4adc3477f9093997955b9f8a1/FLAGdd7c3d2ad [2023-11-19 07:37:06,384 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/data/6dc99ef15/59a02cb4adc3477f9093997955b9f8a1 [2023-11-19 07:37:06,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:37:06,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:37:06,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:37:06,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:37:06,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:37:06,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:06" (1/1) ... [2023-11-19 07:37:06,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14672a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:06, skipping insertion in model container [2023-11-19 07:37:06,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:06" (1/1) ... [2023-11-19 07:37:06,465 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:37:06,680 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_e98e9e84-0b39-4d43-b846-c895639c05cc/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2023-11-19 07:37:06,895 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:37:06,914 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:37:06,928 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_e98e9e84-0b39-4d43-b846-c895639c05cc/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2023-11-19 07:37:07,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:37:07,058 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:37:07,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07 WrapperNode [2023-11-19 07:37:07,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:37:07,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:37:07,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:37:07,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:37:07,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07" (1/1) ... [2023-11-19 07:37:07,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07" (1/1) ... [2023-11-19 07:37:07,286 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1571 [2023-11-19 07:37:07,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:37:07,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:37:07,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:37:07,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:37:07,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07" (1/1) ... [2023-11-19 07:37:07,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07" (1/1) ... [2023-11-19 07:37:07,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07" (1/1) ... [2023-11-19 07:37:07,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07" (1/1) ... [2023-11-19 07:37:07,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07" (1/1) ... [2023-11-19 07:37:07,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07" (1/1) ... [2023-11-19 07:37:07,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07" (1/1) ... [2023-11-19 07:37:07,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07" (1/1) ... [2023-11-19 07:37:07,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:37:07,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:37:07,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:37:07,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:37:07,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07" (1/1) ... [2023-11-19 07:37:07,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:37:07,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:07,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:37:07,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98e9e84-0b39-4d43-b846-c895639c05cc/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:37:07,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:37:07,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:37:07,660 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:37:07,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:37:07,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:37:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:37:07,941 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:37:07,945 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:37:10,216 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:37:10,241 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:37:10,241 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:37:10,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:10 BoogieIcfgContainer [2023-11-19 07:37:10,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:37:10,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:37:10,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:37:10,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:37:10,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:37:06" (1/3) ... [2023-11-19 07:37:10,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453e731f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:10, skipping insertion in model container [2023-11-19 07:37:10,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:07" (2/3) ... [2023-11-19 07:37:10,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453e731f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:10, skipping insertion in model container [2023-11-19 07:37:10,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:10" (3/3) ... [2023-11-19 07:37:10,272 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2023-11-19 07:37:10,295 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:37:10,296 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:37:10,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:37:10,368 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;@30e24093, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:37:10,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:37:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 300 states, 294 states have (on average 1.6496598639455782) internal successors, (485), 295 states have internal predecessors, (485), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:37:10,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:10,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:10,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:10,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:10,401 INFO L85 PathProgramCache]: Analyzing trace with hash -814456904, now seen corresponding path program 1 times [2023-11-19 07:37:10,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:10,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914975631] [2023-11-19 07:37:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:10,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:10,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:37:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:10,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:37:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:10,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914975631] [2023-11-19 07:37:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914975631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:10,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:10,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:37:10,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097307003] [2023-11-19 07:37:10,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:10,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:37:10,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:11,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:37:11,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:37:11,067 INFO L87 Difference]: Start difference. First operand has 300 states, 294 states have (on average 1.6496598639455782) internal successors, (485), 295 states have internal predecessors, (485), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:37:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:11,174 INFO L93 Difference]: Finished difference Result 543 states and 895 transitions. [2023-11-19 07:37:11,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:37:11,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 117 [2023-11-19 07:37:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:11,201 INFO L225 Difference]: With dead ends: 543 [2023-11-19 07:37:11,201 INFO L226 Difference]: Without dead ends: 296 [2023-11-19 07:37:11,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:37:11,218 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:11,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:37:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-11-19 07:37:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2023-11-19 07:37:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 291 states have (on average 1.6426116838487972) internal successors, (478), 291 states have internal predecessors, (478), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 484 transitions. [2023-11-19 07:37:11,341 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 484 transitions. Word has length 117 [2023-11-19 07:37:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:11,343 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 484 transitions. [2023-11-19 07:37:11,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:37:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 484 transitions. [2023-11-19 07:37:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:37:11,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:11,357 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:11,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:37:11,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:11,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1624445682, now seen corresponding path program 1 times [2023-11-19 07:37:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:11,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388088846] [2023-11-19 07:37:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:12,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:12,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:37:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:12,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:37:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:12,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:12,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388088846] [2023-11-19 07:37:12,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388088846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:12,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:12,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955338904] [2023-11-19 07:37:12,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:12,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:12,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:12,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:12,890 INFO L87 Difference]: Start difference. First operand 296 states and 484 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:12,965 INFO L93 Difference]: Finished difference Result 300 states and 488 transitions. [2023-11-19 07:37:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:12,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2023-11-19 07:37:12,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:12,973 INFO L225 Difference]: With dead ends: 300 [2023-11-19 07:37:12,974 INFO L226 Difference]: Without dead ends: 298 [2023-11-19 07:37:12,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:12,983 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 1 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:12,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1440 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:37:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-11-19 07:37:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-11-19 07:37:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 293 states have (on average 1.6382252559726962) internal successors, (480), 293 states have internal predecessors, (480), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 486 transitions. [2023-11-19 07:37:13,026 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 486 transitions. Word has length 117 [2023-11-19 07:37:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:13,032 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 486 transitions. [2023-11-19 07:37:13,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 486 transitions. [2023-11-19 07:37:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:37:13,038 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:13,038 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:13,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:37:13,039 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:13,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:13,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1180065892, now seen corresponding path program 1 times [2023-11-19 07:37:13,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:13,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964983215] [2023-11-19 07:37:13,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:13,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:13,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:37:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:13,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:37:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:13,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:13,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964983215] [2023-11-19 07:37:13,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964983215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:13,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:13,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4543416] [2023-11-19 07:37:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:13,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:13,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:13,807 INFO L87 Difference]: Start difference. First operand 298 states and 486 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:14,401 INFO L93 Difference]: Finished difference Result 753 states and 1223 transitions. [2023-11-19 07:37:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:37:14,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2023-11-19 07:37:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:14,406 INFO L225 Difference]: With dead ends: 753 [2023-11-19 07:37:14,407 INFO L226 Difference]: Without dead ends: 298 [2023-11-19 07:37:14,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:37:14,411 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-19 07:37:14,412 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-19 07:37:14,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-11-19 07:37:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-11-19 07:37:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 293 states have (on average 1.6348122866894197) internal successors, (479), 293 states have internal predecessors, (479), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 485 transitions. [2023-11-19 07:37:14,432 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 485 transitions. Word has length 118 [2023-11-19 07:37:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:14,433 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 485 transitions. [2023-11-19 07:37:14,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 485 transitions. [2023-11-19 07:37:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:37:14,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:14,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:14,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:37:14,438 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:14,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:14,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1807819958, now seen corresponding path program 1 times [2023-11-19 07:37:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870220363] [2023-11-19 07:37:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:14,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:37:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:15,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:37:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:15,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:15,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870220363] [2023-11-19 07:37:15,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870220363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:15,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:15,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:15,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440421499] [2023-11-19 07:37:15,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:15,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:15,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:15,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:15,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:15,038 INFO L87 Difference]: Start difference. First operand 298 states and 485 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:15,085 INFO L93 Difference]: Finished difference Result 546 states and 887 transitions. [2023-11-19 07:37:15,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:15,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2023-11-19 07:37:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:15,089 INFO L225 Difference]: With dead ends: 546 [2023-11-19 07:37:15,090 INFO L226 Difference]: Without dead ends: 301 [2023-11-19 07:37:15,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:15,092 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 1 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:15,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1434 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:37:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-11-19 07:37:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2023-11-19 07:37:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6305084745762712) internal successors, (481), 295 states have internal predecessors, (481), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 487 transitions. [2023-11-19 07:37:15,105 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 487 transitions. Word has length 119 [2023-11-19 07:37:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:15,106 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 487 transitions. [2023-11-19 07:37:15,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 487 transitions. [2023-11-19 07:37:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-19 07:37:15,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:15,108 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:15,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:37:15,109 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:15,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2588046, now seen corresponding path program 1 times [2023-11-19 07:37:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:15,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900175927] [2023-11-19 07:37:15,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:15,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:15,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:37:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:15,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:37:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900175927] [2023-11-19 07:37:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900175927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:15,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:15,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012787067] [2023-11-19 07:37:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:15,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:15,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:15,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:15,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:15,756 INFO L87 Difference]: Start difference. First operand 300 states and 487 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:15,880 INFO L93 Difference]: Finished difference Result 547 states and 887 transitions. [2023-11-19 07:37:15,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:15,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2023-11-19 07:37:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:15,884 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:37:15,884 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:37:15,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:15,886 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-19 07:37:15,886 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-19 07:37:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:37:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:37:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6271186440677967) internal successors, (480), 295 states have internal predecessors, (480), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 486 transitions. [2023-11-19 07:37:15,899 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 486 transitions. Word has length 120 [2023-11-19 07:37:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:15,899 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 486 transitions. [2023-11-19 07:37:15,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 486 transitions. [2023-11-19 07:37:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-19 07:37:15,901 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:15,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:15,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:37:15,902 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:15,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash -437020774, now seen corresponding path program 1 times [2023-11-19 07:37:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:15,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964460882] [2023-11-19 07:37:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:16,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:16,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:37:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:16,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:37:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:16,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964460882] [2023-11-19 07:37:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964460882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:16,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:16,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:16,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947773783] [2023-11-19 07:37:16,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:16,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:16,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:16,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:16,415 INFO L87 Difference]: Start difference. First operand 300 states and 486 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:16,573 INFO L93 Difference]: Finished difference Result 547 states and 885 transitions. [2023-11-19 07:37:16,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:16,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2023-11-19 07:37:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:16,577 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:37:16,577 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:37:16,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:16,580 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-19 07:37:16,580 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-19 07:37:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:37:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:37:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.623728813559322) internal successors, (479), 295 states have internal predecessors, (479), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 485 transitions. [2023-11-19 07:37:16,595 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 485 transitions. Word has length 121 [2023-11-19 07:37:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:16,596 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 485 transitions. [2023-11-19 07:37:16,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 485 transitions. [2023-11-19 07:37:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:37:16,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:16,599 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:16,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:37:16,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:16,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash 599648588, now seen corresponding path program 1 times [2023-11-19 07:37:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:16,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807424349] [2023-11-19 07:37:16,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:16,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:37:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:17,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:37:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:17,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807424349] [2023-11-19 07:37:17,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807424349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:17,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561612515] [2023-11-19 07:37:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:17,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:17,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:17,096 INFO L87 Difference]: Start difference. First operand 300 states and 485 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:17,251 INFO L93 Difference]: Finished difference Result 547 states and 883 transitions. [2023-11-19 07:37:17,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2023-11-19 07:37:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:17,256 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:37:17,256 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:37:17,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:17,258 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-19 07:37:17,259 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-19 07:37:17,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:37:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:37:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6203389830508474) internal successors, (478), 295 states have internal predecessors, (478), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 484 transitions. [2023-11-19 07:37:17,275 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 484 transitions. Word has length 122 [2023-11-19 07:37:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:17,276 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 484 transitions. [2023-11-19 07:37:17,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 484 transitions. [2023-11-19 07:37:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-19 07:37:17,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:17,279 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:17,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:37:17,279 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:17,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash 291192372, now seen corresponding path program 1 times [2023-11-19 07:37:17,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:17,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516925771] [2023-11-19 07:37:17,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:17,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:17,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:17,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:37:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:17,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:37:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:17,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:17,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516925771] [2023-11-19 07:37:17,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516925771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:17,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:17,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:17,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999827264] [2023-11-19 07:37:17,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:17,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:17,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:17,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:17,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:17,794 INFO L87 Difference]: Start difference. First operand 300 states and 484 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:17,957 INFO L93 Difference]: Finished difference Result 547 states and 881 transitions. [2023-11-19 07:37:17,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:17,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2023-11-19 07:37:17,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:17,961 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:37:17,962 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:37:17,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:17,964 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-19 07:37:17,964 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-19 07:37:17,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:37:17,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:37:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.616949152542373) internal successors, (477), 295 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 483 transitions. [2023-11-19 07:37:17,980 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 483 transitions. Word has length 123 [2023-11-19 07:37:17,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:17,980 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 483 transitions. [2023-11-19 07:37:17,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 483 transitions. [2023-11-19 07:37:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:37:17,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:17,984 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:17,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:37:17,984 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:17,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash -419805914, now seen corresponding path program 1 times [2023-11-19 07:37:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:17,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660181981] [2023-11-19 07:37:17,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:17,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:37:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:37:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:18,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:18,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660181981] [2023-11-19 07:37:18,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660181981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:18,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:18,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230699485] [2023-11-19 07:37:18,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:18,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:18,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:18,742 INFO L87 Difference]: Start difference. First operand 300 states and 483 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:18,843 INFO L93 Difference]: Finished difference Result 547 states and 879 transitions. [2023-11-19 07:37:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:18,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2023-11-19 07:37:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:18,847 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:37:18,848 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:37:18,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:18,852 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.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:18,853 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.1s Time] [2023-11-19 07:37:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:37:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:37:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6101694915254237) internal successors, (475), 295 states have internal predecessors, (475), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 481 transitions. [2023-11-19 07:37:18,873 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 481 transitions. Word has length 124 [2023-11-19 07:37:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:18,874 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 481 transitions. [2023-11-19 07:37:18,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 481 transitions. [2023-11-19 07:37:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-19 07:37:18,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:18,878 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:18,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:37:18,878 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:18,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1524377896, now seen corresponding path program 1 times [2023-11-19 07:37:18,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:18,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777814709] [2023-11-19 07:37:18,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:18,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:19,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:19,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:37:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:37:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:19,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:19,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777814709] [2023-11-19 07:37:19,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777814709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:19,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:19,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722235890] [2023-11-19 07:37:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:19,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:19,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:19,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:19,440 INFO L87 Difference]: Start difference. First operand 300 states and 481 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:19,525 INFO L93 Difference]: Finished difference Result 547 states and 875 transitions. [2023-11-19 07:37:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:19,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125 [2023-11-19 07:37:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:19,528 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:37:19,529 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:37:19,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:19,530 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-19 07:37:19,532 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-19 07:37:19,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:37:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:37:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6067796610169491) internal successors, (474), 295 states have internal predecessors, (474), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 480 transitions. [2023-11-19 07:37:19,546 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 480 transitions. Word has length 125 [2023-11-19 07:37:19,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:19,547 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 480 transitions. [2023-11-19 07:37:19,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 480 transitions. [2023-11-19 07:37:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:37:19,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:19,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:19,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:37:19,550 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:19,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:19,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1661121666, now seen corresponding path program 1 times [2023-11-19 07:37:19,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:19,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271998619] [2023-11-19 07:37:19,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:19,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:37:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-19 07:37:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:20,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:20,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271998619] [2023-11-19 07:37:20,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271998619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:20,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:20,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:20,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475329661] [2023-11-19 07:37:20,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:20,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:20,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:20,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:20,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:20,237 INFO L87 Difference]: Start difference. First operand 300 states and 480 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:37:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:20,306 INFO L93 Difference]: Finished difference Result 547 states and 873 transitions. [2023-11-19 07:37:20,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:20,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 126 [2023-11-19 07:37:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:20,309 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:37:20,309 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:37:20,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:20,310 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 426 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:20,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 928 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:37:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:37:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:37:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6033898305084746) internal successors, (473), 295 states have internal predecessors, (473), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 479 transitions. [2023-11-19 07:37:20,324 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 479 transitions. Word has length 126 [2023-11-19 07:37:20,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:20,324 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 479 transitions. [2023-11-19 07:37:20,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:37:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 479 transitions. [2023-11-19 07:37:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:37:20,326 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:20,327 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:20,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:37:20,328 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:20,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:20,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2113030220, now seen corresponding path program 1 times [2023-11-19 07:37:20,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:20,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690987290] [2023-11-19 07:37:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:20,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:21,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:21,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:21,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:21,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690987290] [2023-11-19 07:37:21,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690987290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:21,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:21,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:21,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377729065] [2023-11-19 07:37:21,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:21,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:21,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:21,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:21,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:21,028 INFO L87 Difference]: Start difference. First operand 300 states and 479 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:21,140 INFO L93 Difference]: Finished difference Result 547 states and 871 transitions. [2023-11-19 07:37:21,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:21,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2023-11-19 07:37:21,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:21,143 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:37:21,143 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:37:21,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:21,144 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-19 07:37:21,145 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-19 07:37:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:37:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:37:21,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.6) internal successors, (472), 295 states have internal predecessors, (472), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 478 transitions. [2023-11-19 07:37:21,158 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 478 transitions. Word has length 127 [2023-11-19 07:37:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:21,159 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 478 transitions. [2023-11-19 07:37:21,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 478 transitions. [2023-11-19 07:37:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:37:21,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:21,161 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:21,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:37:21,162 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:21,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash 307591886, now seen corresponding path program 1 times [2023-11-19 07:37:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:21,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600116834] [2023-11-19 07:37:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:21,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:21,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:21,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600116834] [2023-11-19 07:37:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600116834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:21,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:21,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:21,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786275604] [2023-11-19 07:37:21,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:21,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:21,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:21,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:21,813 INFO L87 Difference]: Start difference. First operand 300 states and 478 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:21,955 INFO L93 Difference]: Finished difference Result 547 states and 869 transitions. [2023-11-19 07:37:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:21,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2023-11-19 07:37:21,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:21,958 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:37:21,958 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:37:21,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:21,960 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 751 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:21,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 892 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:37:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:37:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.5966101694915253) internal successors, (471), 295 states have internal predecessors, (471), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 477 transitions. [2023-11-19 07:37:21,976 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 477 transitions. Word has length 127 [2023-11-19 07:37:21,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:21,976 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 477 transitions. [2023-11-19 07:37:21,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 477 transitions. [2023-11-19 07:37:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:37:21,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:21,979 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:21,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:37:21,979 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:21,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:21,980 INFO L85 PathProgramCache]: Analyzing trace with hash -510056564, now seen corresponding path program 1 times [2023-11-19 07:37:21,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:21,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876617242] [2023-11-19 07:37:21,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:21,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:22,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:22,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:22,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876617242] [2023-11-19 07:37:22,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876617242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:22,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:22,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:22,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447561449] [2023-11-19 07:37:22,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:22,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:22,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:22,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:22,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:22,690 INFO L87 Difference]: Start difference. First operand 300 states and 477 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:22,885 INFO L93 Difference]: Finished difference Result 547 states and 867 transitions. [2023-11-19 07:37:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:22,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2023-11-19 07:37:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:22,888 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:37:22,888 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:37:22,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:22,890 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 376 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:22,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 899 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:37:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:37:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.5932203389830508) internal successors, (470), 295 states have internal predecessors, (470), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 476 transitions. [2023-11-19 07:37:22,906 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 476 transitions. Word has length 127 [2023-11-19 07:37:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:22,907 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 476 transitions. [2023-11-19 07:37:22,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 476 transitions. [2023-11-19 07:37:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:37:22,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:22,909 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:22,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:37:22,909 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:22,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:22,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2098404466, now seen corresponding path program 1 times [2023-11-19 07:37:22,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:22,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250923657] [2023-11-19 07:37:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:22,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:23,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:23,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:23,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:23,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:23,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250923657] [2023-11-19 07:37:23,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250923657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:23,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:23,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:23,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352319527] [2023-11-19 07:37:23,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:23,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:23,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:23,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:23,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:23,367 INFO L87 Difference]: Start difference. First operand 300 states and 476 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:37:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:23,447 INFO L93 Difference]: Finished difference Result 547 states and 865 transitions. [2023-11-19 07:37:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:23,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 127 [2023-11-19 07:37:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:23,450 INFO L225 Difference]: With dead ends: 547 [2023-11-19 07:37:23,450 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 07:37:23,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:23,454 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 420 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:23,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 922 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:37:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 07:37:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2023-11-19 07:37:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.5898305084745763) internal successors, (469), 295 states have internal predecessors, (469), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:37:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 475 transitions. [2023-11-19 07:37:23,469 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 475 transitions. Word has length 127 [2023-11-19 07:37:23,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:23,469 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 475 transitions. [2023-11-19 07:37:23,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:37:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 475 transitions. [2023-11-19 07:37:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:37:23,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:23,471 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:23,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:37:23,472 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:23,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2071338864, now seen corresponding path program 1 times [2023-11-19 07:37:23,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:23,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915062071] [2023-11-19 07:37:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:24,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:24,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:24,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:24,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915062071] [2023-11-19 07:37:24,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915062071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:24,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:24,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:37:24,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244640855] [2023-11-19 07:37:24,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:24,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:37:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:24,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:37:24,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:24,588 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-19 07:37:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:24,832 INFO L93 Difference]: Finished difference Result 873 states and 1374 transitions. [2023-11-19 07:37:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:37:24,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2023-11-19 07:37:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:24,837 INFO L225 Difference]: With dead ends: 873 [2023-11-19 07:37:24,837 INFO L226 Difference]: Without dead ends: 626 [2023-11-19 07:37:24,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:37:24,839 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-19 07:37:24,839 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-19 07:37:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2023-11-19 07:37:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 392. [2023-11-19 07:37:24,868 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-19 07:37:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 613 transitions. [2023-11-19 07:37:24,871 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 613 transitions. Word has length 127 [2023-11-19 07:37:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:24,872 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 613 transitions. [2023-11-19 07:37:24,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:37:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 613 transitions. [2023-11-19 07:37:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2023-11-19 07:37:24,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:24,879 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:24,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:37:24,879 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:24,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1200497368, now seen corresponding path program 1 times [2023-11-19 07:37:24,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:24,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959858736] [2023-11-19 07:37:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:24,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:25,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:25,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:25,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:25,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-19 07:37:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:25,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-19 07:37:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:25,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-19 07:37:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:25,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:25,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959858736] [2023-11-19 07:37:25,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959858736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:25,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:25,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:25,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542682103] [2023-11-19 07:37:25,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:25,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:25,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:25,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:25,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:25,988 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-19 07:37:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:26,142 INFO L93 Difference]: Finished difference Result 639 states and 1001 transitions. [2023-11-19 07:37:26,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:26,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 308 [2023-11-19 07:37:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:26,146 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:37:26,146 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:37:26,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:26,148 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-19 07:37:26,148 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-19 07:37:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:37:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:37:26,171 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-19 07:37:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 612 transitions. [2023-11-19 07:37:26,174 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 612 transitions. Word has length 308 [2023-11-19 07:37:26,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:26,175 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 612 transitions. [2023-11-19 07:37:26,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:37:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 612 transitions. [2023-11-19 07:37:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2023-11-19 07:37:26,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:26,182 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:26,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:37:26,182 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:26,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 287320224, now seen corresponding path program 1 times [2023-11-19 07:37:26,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:26,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993295055] [2023-11-19 07:37:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:27,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:27,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:27,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:27,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-11-19 07:37:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:27,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-11-19 07:37:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:27,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-19 07:37:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:27,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993295055] [2023-11-19 07:37:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993295055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:27,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:27,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:27,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817497288] [2023-11-19 07:37:27,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:27,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:27,185 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-19 07:37:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:27,302 INFO L93 Difference]: Finished difference Result 639 states and 999 transitions. [2023-11-19 07:37:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:27,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 309 [2023-11-19 07:37:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:27,306 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:37:27,306 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:37:27,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:27,307 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-19 07:37:27,308 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-19 07:37:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:37:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:37:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5598958333333333) internal successors, (599), 384 states have internal predecessors, (599), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 611 transitions. [2023-11-19 07:37:27,337 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 611 transitions. Word has length 309 [2023-11-19 07:37:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:27,338 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 611 transitions. [2023-11-19 07:37:27,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:37:27,339 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 611 transitions. [2023-11-19 07:37:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2023-11-19 07:37:27,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:27,345 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:27,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:37:27,346 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:27,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1215824116, now seen corresponding path program 1 times [2023-11-19 07:37:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876023072] [2023-11-19 07:37:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:28,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:28,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:28,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-11-19 07:37:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-19 07:37:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:28,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-11-19 07:37:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:28,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:28,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876023072] [2023-11-19 07:37:28,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876023072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:28,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:28,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:28,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652478403] [2023-11-19 07:37:28,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:28,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:28,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:28,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:28,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:28,302 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-19 07:37:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:28,437 INFO L93 Difference]: Finished difference Result 639 states and 997 transitions. [2023-11-19 07:37:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:28,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 310 [2023-11-19 07:37:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:28,450 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:37:28,450 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:37:28,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:28,452 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-19 07:37:28,452 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-19 07:37:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:37:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:37:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5572916666666667) internal successors, (598), 384 states have internal predecessors, (598), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 610 transitions. [2023-11-19 07:37:28,493 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 610 transitions. Word has length 310 [2023-11-19 07:37:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:28,493 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 610 transitions. [2023-11-19 07:37:28,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:37:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 610 transitions. [2023-11-19 07:37:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2023-11-19 07:37:28,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:28,504 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:28,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 07:37:28,504 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:28,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:28,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1730578384, now seen corresponding path program 1 times [2023-11-19 07:37:28,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234329806] [2023-11-19 07:37:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:28,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:29,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:29,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:29,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-19 07:37:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:29,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-19 07:37:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-19 07:37:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:29,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:29,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234329806] [2023-11-19 07:37:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234329806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:29,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:29,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053278797] [2023-11-19 07:37:29,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:29,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:29,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:29,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:29,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:29,549 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-19 07:37:29,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:29,673 INFO L93 Difference]: Finished difference Result 639 states and 995 transitions. [2023-11-19 07:37:29,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:29,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 311 [2023-11-19 07:37:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:29,677 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:37:29,678 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:37:29,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:29,679 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-19 07:37:29,680 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-19 07:37:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:37:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:37:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5546875) internal successors, (597), 384 states have internal predecessors, (597), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 609 transitions. [2023-11-19 07:37:29,711 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 609 transitions. Word has length 311 [2023-11-19 07:37:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:29,712 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 609 transitions. [2023-11-19 07:37:29,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:37:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 609 transitions. [2023-11-19 07:37:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-11-19 07:37:29,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:29,719 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:29,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 07:37:29,720 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:29,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1767025090, now seen corresponding path program 1 times [2023-11-19 07:37:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:29,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980294850] [2023-11-19 07:37:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:30,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:30,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-11-19 07:37:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:30,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-11-19 07:37:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-19 07:37:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:30,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:30,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980294850] [2023-11-19 07:37:30,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980294850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:30,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:30,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:30,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705478535] [2023-11-19 07:37:30,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:30,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:30,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:30,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:30,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:30,850 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-19 07:37:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:30,938 INFO L93 Difference]: Finished difference Result 639 states and 993 transitions. [2023-11-19 07:37:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 312 [2023-11-19 07:37:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:30,942 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:37:30,942 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:37:30,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:30,944 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-19 07:37:30,944 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-19 07:37:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:37:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:37:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5520833333333333) internal successors, (596), 384 states have internal predecessors, (596), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 608 transitions. [2023-11-19 07:37:30,969 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 608 transitions. Word has length 312 [2023-11-19 07:37:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:30,970 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 608 transitions. [2023-11-19 07:37:30,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:37:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 608 transitions. [2023-11-19 07:37:30,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-11-19 07:37:30,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:30,976 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:30,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 07:37:30,977 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:30,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1817051586, now seen corresponding path program 1 times [2023-11-19 07:37:30,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:30,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234425622] [2023-11-19 07:37:30,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:30,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:32,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:32,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:32,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-11-19 07:37:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:32,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-11-19 07:37:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:32,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-11-19 07:37:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:32,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:32,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234425622] [2023-11-19 07:37:32,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234425622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:32,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:32,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:32,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395447615] [2023-11-19 07:37:32,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:32,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:32,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:32,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:32,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:32,064 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-19 07:37:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:32,143 INFO L93 Difference]: Finished difference Result 639 states and 991 transitions. [2023-11-19 07:37:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:32,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 313 [2023-11-19 07:37:32,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:32,148 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:37:32,148 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:37:32,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:32,150 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-19 07:37:32,150 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-19 07:37:32,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:37:32,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:37:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5494791666666667) internal successors, (595), 384 states have internal predecessors, (595), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 607 transitions. [2023-11-19 07:37:32,177 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 607 transitions. Word has length 313 [2023-11-19 07:37:32,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:32,178 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 607 transitions. [2023-11-19 07:37:32,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:37:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 607 transitions. [2023-11-19 07:37:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-11-19 07:37:32,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:32,184 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:32,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-19 07:37:32,184 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:32,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:32,185 INFO L85 PathProgramCache]: Analyzing trace with hash -92715534, now seen corresponding path program 1 times [2023-11-19 07:37:32,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:32,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417455406] [2023-11-19 07:37:32,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:32,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:33,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:33,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:33,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-19 07:37:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:33,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-19 07:37:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:33,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-11-19 07:37:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:33,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:33,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417455406] [2023-11-19 07:37:33,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417455406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:33,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:33,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825210797] [2023-11-19 07:37:33,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:33,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:33,209 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-19 07:37:33,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:33,531 INFO L93 Difference]: Finished difference Result 639 states and 989 transitions. [2023-11-19 07:37:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:33,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 314 [2023-11-19 07:37:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:33,535 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:37:33,536 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:37:33,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:33,537 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 370 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-19 07:37:33,537 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-19 07:37:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:37:33,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:37:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.546875) internal successors, (594), 384 states have internal predecessors, (594), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 606 transitions. [2023-11-19 07:37:33,564 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 606 transitions. Word has length 314 [2023-11-19 07:37:33,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:33,564 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 606 transitions. [2023-11-19 07:37:33,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:37:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 606 transitions. [2023-11-19 07:37:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-11-19 07:37:33,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:33,571 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:33,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-19 07:37:33,571 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:33,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:33,572 INFO L85 PathProgramCache]: Analyzing trace with hash -467654286, now seen corresponding path program 1 times [2023-11-19 07:37:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:33,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54320520] [2023-11-19 07:37:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:33,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:35,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:35,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:35,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:35,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-19 07:37:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:35,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-19 07:37:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:35,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-19 07:37:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:35,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:35,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54320520] [2023-11-19 07:37:35,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54320520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:35,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:35,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:35,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565494686] [2023-11-19 07:37:35,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:35,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:35,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:35,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:35,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:35,628 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-19 07:37:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:35,751 INFO L93 Difference]: Finished difference Result 639 states and 987 transitions. [2023-11-19 07:37:35,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:35,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 315 [2023-11-19 07:37:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:35,755 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:37:35,755 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:37:35,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:35,757 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-19 07:37:35,757 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-19 07:37:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:37:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:37:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5442708333333333) internal successors, (593), 384 states have internal predecessors, (593), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 605 transitions. [2023-11-19 07:37:35,782 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 605 transitions. Word has length 315 [2023-11-19 07:37:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:35,783 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 605 transitions. [2023-11-19 07:37:35,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:37:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 605 transitions. [2023-11-19 07:37:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-11-19 07:37:35,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:35,789 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:35,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-19 07:37:35,789 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:35,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:35,790 INFO L85 PathProgramCache]: Analyzing trace with hash 936214900, now seen corresponding path program 1 times [2023-11-19 07:37:35,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:35,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956614265] [2023-11-19 07:37:35,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:35,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:37,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-19 07:37:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:37,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-19 07:37:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:37,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-19 07:37:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:37,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:37,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956614265] [2023-11-19 07:37:37,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956614265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:37,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:37,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:37,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760430006] [2023-11-19 07:37:37,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:37,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:37,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:37,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:37,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:37,752 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-19 07:37:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:37,849 INFO L93 Difference]: Finished difference Result 639 states and 985 transitions. [2023-11-19 07:37:37,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:37,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 315 [2023-11-19 07:37:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:37,853 INFO L225 Difference]: With dead ends: 639 [2023-11-19 07:37:37,853 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:37:37,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:37,855 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 310 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-19 07:37:37,856 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-19 07:37:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:37:37,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:37:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5416666666666667) internal successors, (592), 384 states have internal predecessors, (592), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 604 transitions. [2023-11-19 07:37:37,879 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 604 transitions. Word has length 315 [2023-11-19 07:37:37,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:37,880 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 604 transitions. [2023-11-19 07:37:37,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:37:37,881 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 604 transitions. [2023-11-19 07:37:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-11-19 07:37:37,886 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:37,886 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:37,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-19 07:37:37,887 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:37,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:37,888 INFO L85 PathProgramCache]: Analyzing trace with hash 324945842, now seen corresponding path program 1 times [2023-11-19 07:37:37,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:37,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230347337] [2023-11-19 07:37:37,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:37,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:40,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:40,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:40,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-19 07:37:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:40,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-19 07:37:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:40,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-19 07:37:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-11-19 07:37:40,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230347337] [2023-11-19 07:37:40,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230347337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:40,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:40,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715209681] [2023-11-19 07:37:40,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:40,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:40,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:40,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:40,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:40,056 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-19 07:37:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:40,284 INFO L93 Difference]: Finished difference Result 670 states and 1021 transitions. [2023-11-19 07:37:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:37:40,285 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-19 07:37:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:40,288 INFO L225 Difference]: With dead ends: 670 [2023-11-19 07:37:40,288 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:37:40,289 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-19 07:37:40,290 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-19 07:37:40,292 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-19 07:37:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:37:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-19 07:37:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.5364583333333333) internal successors, (590), 384 states have internal predecessors, (590), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 602 transitions. [2023-11-19 07:37:40,314 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 602 transitions. Word has length 315 [2023-11-19 07:37:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:40,315 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 602 transitions. [2023-11-19 07:37:40,315 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-19 07:37:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 602 transitions. [2023-11-19 07:37:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2023-11-19 07:37:40,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:40,321 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-19 07:37:40,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-19 07:37:40,321 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:40,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:40,322 INFO L85 PathProgramCache]: Analyzing trace with hash 932762414, now seen corresponding path program 1 times [2023-11-19 07:37:40,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:40,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883046304] [2023-11-19 07:37:40,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:40,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:42,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:37:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:42,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:37:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:42,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-19 07:37:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:42,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-19 07:37:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:42,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-11-19 07:37:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:42,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-11-19 07:37:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:42,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:42,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883046304] [2023-11-19 07:37:42,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883046304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:42,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:42,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:37:42,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785479271] [2023-11-19 07:37:42,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:42,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:37:42,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:42,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:37:42,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:42,396 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-19 07:37:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:43,100 INFO L93 Difference]: Finished difference Result 958 states and 1475 transitions. [2023-11-19 07:37:43,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:37:43,101 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-19 07:37:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:43,107 INFO L225 Difference]: With dead ends: 958 [2023-11-19 07:37:43,107 INFO L226 Difference]: Without dead ends: 711 [2023-11-19 07:37:43,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:37:43,109 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-19 07:37:43,109 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-19 07:37:43,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2023-11-19 07:37:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 605. [2023-11-19 07:37:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 594 states have (on average 1.5303030303030303) internal successors, (909), 594 states have internal predecessors, (909), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-19 07:37:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 927 transitions. [2023-11-19 07:37:43,160 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 927 transitions. Word has length 317 [2023-11-19 07:37:43,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:43,161 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 927 transitions. [2023-11-19 07:37:43,162 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-19 07:37:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 927 transitions. [2023-11-19 07:37:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2023-11-19 07:37:43,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:43,170 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:43,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-19 07:37:43,170 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:43,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:43,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1165478474, now seen corresponding path program 1 times [2023-11-19 07:37:43,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:43,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809729290] [2023-11-19 07:37:43,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:43,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat