./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 32bit --witnessprinter.graph.data.programhash d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:10:21,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:10:21,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:10:21,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:10:21,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:10:21,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:10:21,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:10:21,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:10:21,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:10:21,409 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:10:21,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:10:21,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:10:21,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:10:21,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:10:21,412 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:10:21,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:10:21,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:10:21,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:10:21,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:10:21,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:10:21,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:10:21,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:10:21,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:10:21,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:10:21,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:10:21,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:10:21,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:10:21,416 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:10:21,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:10:21,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:10:21,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:10:21,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:10:21,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:10:21,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:10:21,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:10:21,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:10:21,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:10:21,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:10:21,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:10:21,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:10:21,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:10:21,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:10:21,419 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 [2024-10-14 14:10:21,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:10:21,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:10:21,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:10:21,635 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:10:21,636 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:10:21,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2024-10-14 14:10:22,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:10:23,055 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:10:23,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2024-10-14 14:10:23,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05879c8e3/9f1df9e74f384cda96131994ce97a9f4/FLAGd3bac80cc [2024-10-14 14:10:23,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05879c8e3/9f1df9e74f384cda96131994ce97a9f4 [2024-10-14 14:10:23,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:10:23,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:10:23,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:10:23,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:10:23,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:10:23,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f7c67e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23, skipping insertion in model container [2024-10-14 14:10:23,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:10:23,641 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2024-10-14 14:10:23,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:10:23,742 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:10:23,754 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2024-10-14 14:10:23,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:10:23,811 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:10:23,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23 WrapperNode [2024-10-14 14:10:23,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:10:23,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:10:23,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:10:23,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:10:23,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,865 INFO L138 Inliner]: procedures = 29, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 528 [2024-10-14 14:10:23,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:10:23,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:10:23,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:10:23,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:10:23,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,913 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 16 writes are split as follows [0, 16]. [2024-10-14 14:10:23,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:10:23,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:10:23,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:10:23,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:10:23,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (1/1) ... [2024-10-14 14:10:23,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:10:23,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:10:23,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:10:23,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:10:24,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:10:24,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 14:10:24,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 14:10:24,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 14:10:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 14:10:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 14:10:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 14:10:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 14:10:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 14:10:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 14:10:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 14:10:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:10:24,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:10:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:10:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 14:10:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:10:24,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:10:24,164 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:10:24,166 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:10:24,581 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-10-14 14:10:24,581 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:10:24,624 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:10:24,625 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:10:24,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:10:24 BoogieIcfgContainer [2024-10-14 14:10:24,628 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:10:24,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:10:24,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:10:24,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:10:24,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:10:23" (1/3) ... [2024-10-14 14:10:24,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5296627c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:10:24, skipping insertion in model container [2024-10-14 14:10:24,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:10:23" (2/3) ... [2024-10-14 14:10:24,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5296627c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:10:24, skipping insertion in model container [2024-10-14 14:10:24,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:10:24" (3/3) ... [2024-10-14 14:10:24,634 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-70.i [2024-10-14 14:10:24,647 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:10:24,647 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:10:24,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:10:24,706 INFO L333 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, 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;@48c4e79c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:10:24,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:10:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 14:10:24,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:24,722 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:24,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:24,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:24,727 INFO L85 PathProgramCache]: Analyzing trace with hash -611823237, now seen corresponding path program 1 times [2024-10-14 14:10:24,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:24,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105753662] [2024-10-14 14:10:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:24,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:24,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:24,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:24,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:25,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:25,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105753662] [2024-10-14 14:10:25,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105753662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:25,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:25,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:10:25,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579516255] [2024-10-14 14:10:25,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:25,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:10:25,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:25,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:10:25,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:10:25,133 INFO L87 Difference]: Start difference. First operand has 104 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:10:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:25,202 INFO L93 Difference]: Finished difference Result 205 states and 320 transitions. [2024-10-14 14:10:25,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:10:25,205 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2024-10-14 14:10:25,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:25,212 INFO L225 Difference]: With dead ends: 205 [2024-10-14 14:10:25,213 INFO L226 Difference]: Without dead ends: 102 [2024-10-14 14:10:25,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:10:25,219 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:25,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:10:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-14 14:10:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-14 14:10:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2024-10-14 14:10:25,262 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 111 [2024-10-14 14:10:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:25,264 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2024-10-14 14:10:25,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:10:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2024-10-14 14:10:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 14:10:25,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:25,267 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:25,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:10:25,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:25,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash 440868875, now seen corresponding path program 1 times [2024-10-14 14:10:25,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:25,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197110113] [2024-10-14 14:10:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:25,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:25,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197110113] [2024-10-14 14:10:25,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197110113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:25,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:25,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:10:25,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083475030] [2024-10-14 14:10:25,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:25,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:10:25,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:25,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:10:25,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:10:25,560 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:10:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:25,609 INFO L93 Difference]: Finished difference Result 205 states and 302 transitions. [2024-10-14 14:10:25,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:10:25,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2024-10-14 14:10:25,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:25,614 INFO L225 Difference]: With dead ends: 205 [2024-10-14 14:10:25,614 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 14:10:25,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:10:25,615 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 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 [2024-10-14 14:10:25,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:10:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 14:10:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-14 14:10:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-10-14 14:10:25,626 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 111 [2024-10-14 14:10:25,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:25,628 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-10-14 14:10:25,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:10:25,628 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-10-14 14:10:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 14:10:25,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:25,631 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:25,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:10:25,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:25,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1657022601, now seen corresponding path program 1 times [2024-10-14 14:10:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:25,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71352708] [2024-10-14 14:10:25,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:25,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:25,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:25,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71352708] [2024-10-14 14:10:25,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71352708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:25,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:25,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:10:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081554801] [2024-10-14 14:10:25,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:25,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:10:25,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:10:25,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:10:25,940 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:25,977 INFO L93 Difference]: Finished difference Result 209 states and 306 transitions. [2024-10-14 14:10:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:10:25,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-10-14 14:10:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:25,980 INFO L225 Difference]: With dead ends: 209 [2024-10-14 14:10:25,980 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 14:10:25,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:10:25,981 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 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 [2024-10-14 14:10:25,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:10:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 14:10:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-14 14:10:25,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-10-14 14:10:25,995 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 111 [2024-10-14 14:10:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:25,995 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-10-14 14:10:25,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-10-14 14:10:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 14:10:25,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:25,999 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:25,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:10:26,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:26,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1226168046, now seen corresponding path program 1 times [2024-10-14 14:10:26,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:26,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589760593] [2024-10-14 14:10:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:26,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:26,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589760593] [2024-10-14 14:10:26,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589760593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:26,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:26,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:10:26,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906187150] [2024-10-14 14:10:26,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:26,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:10:26,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:26,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:10:26,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:10:26,170 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:26,203 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2024-10-14 14:10:26,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:10:26,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-14 14:10:26,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:26,206 INFO L225 Difference]: With dead ends: 214 [2024-10-14 14:10:26,207 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 14:10:26,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:10:26,211 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:26,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:10:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 14:10:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-10-14 14:10:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-10-14 14:10:26,218 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 113 [2024-10-14 14:10:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:26,218 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-10-14 14:10:26,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-10-14 14:10:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 14:10:26,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:26,222 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:26,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:10:26,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:26,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1283426348, now seen corresponding path program 1 times [2024-10-14 14:10:26,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:26,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169252207] [2024-10-14 14:10:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:26,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:26,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169252207] [2024-10-14 14:10:26,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169252207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:26,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:26,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:10:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580208900] [2024-10-14 14:10:26,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:26,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:10:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:26,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:10:26,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:10:26,357 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:26,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:26,387 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2024-10-14 14:10:26,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:10:26,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-14 14:10:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:26,389 INFO L225 Difference]: With dead ends: 218 [2024-10-14 14:10:26,390 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 14:10:26,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:10:26,394 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:26,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:10:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 14:10:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-10-14 14:10:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-10-14 14:10:26,404 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 113 [2024-10-14 14:10:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:26,408 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-10-14 14:10:26,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-10-14 14:10:26,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 14:10:26,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:26,409 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:26,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:10:26,409 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:26,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:26,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1283485930, now seen corresponding path program 1 times [2024-10-14 14:10:26,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:26,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128593561] [2024-10-14 14:10:26,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:26,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:27,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:27,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128593561] [2024-10-14 14:10:27,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128593561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:27,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:27,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 14:10:27,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825160850] [2024-10-14 14:10:27,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:27,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 14:10:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:27,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 14:10:27,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-14 14:10:27,357 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:10:27,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:27,723 INFO L93 Difference]: Finished difference Result 271 states and 388 transitions. [2024-10-14 14:10:27,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:10:27,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-10-14 14:10:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:27,725 INFO L225 Difference]: With dead ends: 271 [2024-10-14 14:10:27,726 INFO L226 Difference]: Without dead ends: 162 [2024-10-14 14:10:27,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-14 14:10:27,727 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 453 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:27,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 302 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:10:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-14 14:10:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 127. [2024-10-14 14:10:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.407079646017699) internal successors, (159), 113 states have internal predecessors, (159), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2024-10-14 14:10:27,735 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 113 [2024-10-14 14:10:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:27,739 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2024-10-14 14:10:27,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:10:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2024-10-14 14:10:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 14:10:27,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:27,740 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:27,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:10:27,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:27,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash 887384622, now seen corresponding path program 1 times [2024-10-14 14:10:27,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:27,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296364863] [2024-10-14 14:10:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:28,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:28,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296364863] [2024-10-14 14:10:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296364863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:28,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:28,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 14:10:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534416817] [2024-10-14 14:10:28,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:28,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:10:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:28,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:10:28,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:10:28,416 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:28,717 INFO L93 Difference]: Finished difference Result 325 states and 466 transitions. [2024-10-14 14:10:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 14:10:28,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-14 14:10:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:28,719 INFO L225 Difference]: With dead ends: 325 [2024-10-14 14:10:28,719 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 14:10:28,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-14 14:10:28,720 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 277 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:28,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 654 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:10:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 14:10:28,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 166. [2024-10-14 14:10:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 152 states have internal predecessors, (215), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:28,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2024-10-14 14:10:28,737 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 114 [2024-10-14 14:10:28,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:28,738 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2024-10-14 14:10:28,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:28,738 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2024-10-14 14:10:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 14:10:28,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:28,739 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:28,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:10:28,739 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:28,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:28,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1027933232, now seen corresponding path program 1 times [2024-10-14 14:10:28,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:28,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537623090] [2024-10-14 14:10:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:28,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:28,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:28,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537623090] [2024-10-14 14:10:28,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537623090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:28,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:28,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:10:28,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949275924] [2024-10-14 14:10:28,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:28,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:10:28,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:28,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:10:28,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:10:28,972 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:29,105 INFO L93 Difference]: Finished difference Result 368 states and 529 transitions. [2024-10-14 14:10:29,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:10:29,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-14 14:10:29,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:29,108 INFO L225 Difference]: With dead ends: 368 [2024-10-14 14:10:29,108 INFO L226 Difference]: Without dead ends: 203 [2024-10-14 14:10:29,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:10:29,109 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 39 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:29,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 502 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:10:29,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-14 14:10:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 152. [2024-10-14 14:10:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 138 states have (on average 1.4130434782608696) internal successors, (195), 138 states have internal predecessors, (195), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 219 transitions. [2024-10-14 14:10:29,126 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 219 transitions. Word has length 114 [2024-10-14 14:10:29,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:29,126 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 219 transitions. [2024-10-14 14:10:29,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:29,126 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 219 transitions. [2024-10-14 14:10:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 14:10:29,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:29,127 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:29,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:10:29,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:29,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1345506555, now seen corresponding path program 1 times [2024-10-14 14:10:29,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:29,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697054446] [2024-10-14 14:10:29,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:29,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:29,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:29,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697054446] [2024-10-14 14:10:29,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697054446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:29,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:29,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:10:29,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086776931] [2024-10-14 14:10:29,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:29,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:10:29,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:29,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:10:29,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:10:29,397 INFO L87 Difference]: Start difference. First operand 152 states and 219 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:29,431 INFO L93 Difference]: Finished difference Result 306 states and 443 transitions. [2024-10-14 14:10:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:10:29,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-10-14 14:10:29,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:29,432 INFO L225 Difference]: With dead ends: 306 [2024-10-14 14:10:29,432 INFO L226 Difference]: Without dead ends: 155 [2024-10-14 14:10:29,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:10:29,433 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:29,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 417 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:10:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-14 14:10:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-10-14 14:10:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 141 states have internal predecessors, (198), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 222 transitions. [2024-10-14 14:10:29,443 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 222 transitions. Word has length 115 [2024-10-14 14:10:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:29,444 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 222 transitions. [2024-10-14 14:10:29,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 222 transitions. [2024-10-14 14:10:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 14:10:29,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:29,445 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:29,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 14:10:29,446 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:29,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:29,446 INFO L85 PathProgramCache]: Analyzing trace with hash 35677557, now seen corresponding path program 1 times [2024-10-14 14:10:29,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:29,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321896738] [2024-10-14 14:10:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:29,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:29,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:29,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321896738] [2024-10-14 14:10:29,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321896738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:29,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:29,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:10:29,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281229395] [2024-10-14 14:10:29,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:29,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:10:29,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:29,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:10:29,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:10:29,861 INFO L87 Difference]: Start difference. First operand 155 states and 222 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:30,018 INFO L93 Difference]: Finished difference Result 309 states and 443 transitions. [2024-10-14 14:10:30,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:10:30,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-14 14:10:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:30,019 INFO L225 Difference]: With dead ends: 309 [2024-10-14 14:10:30,019 INFO L226 Difference]: Without dead ends: 155 [2024-10-14 14:10:30,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:10:30,020 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 102 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:30,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 291 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:10:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-14 14:10:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2024-10-14 14:10:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 138 states have (on average 1.391304347826087) internal successors, (192), 138 states have internal predecessors, (192), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2024-10-14 14:10:30,028 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 116 [2024-10-14 14:10:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:30,029 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2024-10-14 14:10:30,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2024-10-14 14:10:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 14:10:30,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:30,030 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:30,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 14:10:30,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:30,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1671687916, now seen corresponding path program 1 times [2024-10-14 14:10:30,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:30,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354534981] [2024-10-14 14:10:30,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:30,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:30,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:30,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354534981] [2024-10-14 14:10:30,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354534981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:30,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:30,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:10:30,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684520545] [2024-10-14 14:10:30,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:30,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:10:30,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:30,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:10:30,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:10:30,171 INFO L87 Difference]: Start difference. First operand 152 states and 216 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:30,189 INFO L93 Difference]: Finished difference Result 303 states and 431 transitions. [2024-10-14 14:10:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:10:30,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-14 14:10:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:30,190 INFO L225 Difference]: With dead ends: 303 [2024-10-14 14:10:30,190 INFO L226 Difference]: Without dead ends: 152 [2024-10-14 14:10:30,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:10:30,191 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:30,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:10:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-14 14:10:30,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-10-14 14:10:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 138 states have (on average 1.3695652173913044) internal successors, (189), 138 states have internal predecessors, (189), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 213 transitions. [2024-10-14 14:10:30,199 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 213 transitions. Word has length 117 [2024-10-14 14:10:30,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:30,199 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 213 transitions. [2024-10-14 14:10:30,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 213 transitions. [2024-10-14 14:10:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 14:10:30,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:30,200 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:30,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 14:10:30,201 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:30,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash -322456790, now seen corresponding path program 1 times [2024-10-14 14:10:30,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:30,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223320033] [2024-10-14 14:10:30,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:32,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223320033] [2024-10-14 14:10:32,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223320033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:32,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:32,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-14 14:10:32,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456314039] [2024-10-14 14:10:32,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:32,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 14:10:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:32,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 14:10:32,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-14 14:10:32,089 INFO L87 Difference]: Start difference. First operand 152 states and 213 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:10:33,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:33,380 INFO L93 Difference]: Finished difference Result 463 states and 643 transitions. [2024-10-14 14:10:33,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 14:10:33,381 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-10-14 14:10:33,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:33,382 INFO L225 Difference]: With dead ends: 463 [2024-10-14 14:10:33,382 INFO L226 Difference]: Without dead ends: 312 [2024-10-14 14:10:33,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2024-10-14 14:10:33,383 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 578 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:33,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 825 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 14:10:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-14 14:10:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 190. [2024-10-14 14:10:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 176 states have (on average 1.3693181818181819) internal successors, (241), 176 states have internal predecessors, (241), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 265 transitions. [2024-10-14 14:10:33,392 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 265 transitions. Word has length 117 [2024-10-14 14:10:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:33,393 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 265 transitions. [2024-10-14 14:10:33,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:10:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 265 transitions. [2024-10-14 14:10:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 14:10:33,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:33,394 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:33,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 14:10:33,394 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:33,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1602320468, now seen corresponding path program 1 times [2024-10-14 14:10:33,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:33,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173595754] [2024-10-14 14:10:33,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:33,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:34,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:34,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173595754] [2024-10-14 14:10:34,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173595754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:34,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:34,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 14:10:34,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068145734] [2024-10-14 14:10:34,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:34,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 14:10:34,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:34,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 14:10:34,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:10:34,209 INFO L87 Difference]: Start difference. First operand 190 states and 265 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:10:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:34,679 INFO L93 Difference]: Finished difference Result 453 states and 629 transitions. [2024-10-14 14:10:34,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:10:34,679 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-10-14 14:10:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:34,680 INFO L225 Difference]: With dead ends: 453 [2024-10-14 14:10:34,680 INFO L226 Difference]: Without dead ends: 264 [2024-10-14 14:10:34,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-14 14:10:34,681 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 344 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:34,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 551 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:10:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-14 14:10:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 216. [2024-10-14 14:10:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 202 states have (on average 1.3514851485148516) internal successors, (273), 202 states have internal predecessors, (273), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 297 transitions. [2024-10-14 14:10:34,694 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 297 transitions. Word has length 117 [2024-10-14 14:10:34,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:34,697 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 297 transitions. [2024-10-14 14:10:34,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:10:34,697 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 297 transitions. [2024-10-14 14:10:34,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 14:10:34,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:34,698 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:34,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 14:10:34,698 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:34,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:34,699 INFO L85 PathProgramCache]: Analyzing trace with hash -299824536, now seen corresponding path program 1 times [2024-10-14 14:10:34,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:34,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142149917] [2024-10-14 14:10:34,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:34,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:35,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:35,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142149917] [2024-10-14 14:10:35,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142149917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:35,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:35,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 14:10:35,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782175956] [2024-10-14 14:10:35,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:35,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 14:10:35,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:35,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 14:10:35,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-14 14:10:35,629 INFO L87 Difference]: Start difference. First operand 216 states and 297 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:10:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:36,454 INFO L93 Difference]: Finished difference Result 537 states and 735 transitions. [2024-10-14 14:10:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 14:10:36,455 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-10-14 14:10:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:36,456 INFO L225 Difference]: With dead ends: 537 [2024-10-14 14:10:36,456 INFO L226 Difference]: Without dead ends: 322 [2024-10-14 14:10:36,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-10-14 14:10:36,458 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 346 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:36,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 772 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 14:10:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-14 14:10:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 216. [2024-10-14 14:10:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 202 states have (on average 1.3415841584158417) internal successors, (271), 202 states have internal predecessors, (271), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 295 transitions. [2024-10-14 14:10:36,470 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 295 transitions. Word has length 117 [2024-10-14 14:10:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:36,470 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 295 transitions. [2024-10-14 14:10:36,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:10:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 295 transitions. [2024-10-14 14:10:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 14:10:36,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:36,471 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:36,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 14:10:36,471 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:36,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:36,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1579688214, now seen corresponding path program 1 times [2024-10-14 14:10:36,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:36,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210136301] [2024-10-14 14:10:36,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:36,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:37,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:37,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210136301] [2024-10-14 14:10:37,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210136301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:37,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:37,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 14:10:37,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947145394] [2024-10-14 14:10:37,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:37,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 14:10:37,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:37,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 14:10:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-14 14:10:37,901 INFO L87 Difference]: Start difference. First operand 216 states and 295 transitions. Second operand has 12 states, 10 states have (on average 6.0) internal successors, (60), 12 states have internal predecessors, (60), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-14 14:10:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:38,470 INFO L93 Difference]: Finished difference Result 418 states and 573 transitions. [2024-10-14 14:10:38,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 14:10:38,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 12 states have internal predecessors, (60), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 117 [2024-10-14 14:10:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:38,471 INFO L225 Difference]: With dead ends: 418 [2024-10-14 14:10:38,471 INFO L226 Difference]: Without dead ends: 203 [2024-10-14 14:10:38,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-14 14:10:38,472 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 224 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:38,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 526 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:10:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-14 14:10:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-10-14 14:10:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 189 states have (on average 1.3333333333333333) internal successors, (252), 189 states have internal predecessors, (252), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 276 transitions. [2024-10-14 14:10:38,484 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 276 transitions. Word has length 117 [2024-10-14 14:10:38,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:38,485 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 276 transitions. [2024-10-14 14:10:38,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 12 states have internal predecessors, (60), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-14 14:10:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 276 transitions. [2024-10-14 14:10:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 14:10:38,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:38,486 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:38,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 14:10:38,487 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:38,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:38,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1517648600, now seen corresponding path program 1 times [2024-10-14 14:10:38,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:38,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167669169] [2024-10-14 14:10:38,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:38,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:40,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:40,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167669169] [2024-10-14 14:10:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167669169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:40,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:40,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 14:10:40,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968925772] [2024-10-14 14:10:40,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:40,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 14:10:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:40,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 14:10:40,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-14 14:10:40,446 INFO L87 Difference]: Start difference. First operand 203 states and 276 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:41,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:41,770 INFO L93 Difference]: Finished difference Result 503 states and 679 transitions. [2024-10-14 14:10:41,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 14:10:41,770 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-14 14:10:41,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:41,771 INFO L225 Difference]: With dead ends: 503 [2024-10-14 14:10:41,771 INFO L226 Difference]: Without dead ends: 301 [2024-10-14 14:10:41,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2024-10-14 14:10:41,773 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 296 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:41,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1345 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 14:10:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-14 14:10:41,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 215. [2024-10-14 14:10:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 201 states have (on average 1.3333333333333333) internal successors, (268), 201 states have internal predecessors, (268), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 292 transitions. [2024-10-14 14:10:41,787 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 292 transitions. Word has length 117 [2024-10-14 14:10:41,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:41,787 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 292 transitions. [2024-10-14 14:10:41,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 292 transitions. [2024-10-14 14:10:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 14:10:41,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:41,788 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:41,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 14:10:41,788 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:41,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash -149419622, now seen corresponding path program 1 times [2024-10-14 14:10:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:41,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614824837] [2024-10-14 14:10:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:41,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:41,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:41,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614824837] [2024-10-14 14:10:41,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614824837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:41,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:41,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:10:41,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424700242] [2024-10-14 14:10:41,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:41,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:10:41,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:10:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:10:41,976 INFO L87 Difference]: Start difference. First operand 215 states and 292 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:42,107 INFO L93 Difference]: Finished difference Result 437 states and 594 transitions. [2024-10-14 14:10:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:10:42,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-10-14 14:10:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:42,111 INFO L225 Difference]: With dead ends: 437 [2024-10-14 14:10:42,111 INFO L226 Difference]: Without dead ends: 223 [2024-10-14 14:10:42,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:10:42,112 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 7 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:42,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 479 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:10:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-14 14:10:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2024-10-14 14:10:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 203 states have (on average 1.3152709359605912) internal successors, (267), 203 states have internal predecessors, (267), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 291 transitions. [2024-10-14 14:10:42,133 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 291 transitions. Word has length 118 [2024-10-14 14:10:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:42,134 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 291 transitions. [2024-10-14 14:10:42,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:10:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 291 transitions. [2024-10-14 14:10:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 14:10:42,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:42,135 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:42,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 14:10:42,138 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:42,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:42,139 INFO L85 PathProgramCache]: Analyzing trace with hash 486829700, now seen corresponding path program 1 times [2024-10-14 14:10:42,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:42,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711667793] [2024-10-14 14:10:42,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:42,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:10:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:10:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:10:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:10:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:10:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:10:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:10:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:10:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:10:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:10:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:10:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:10:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:10:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:10:44,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:10:44,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711667793] [2024-10-14 14:10:44,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711667793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:10:44,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:10:44,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-14 14:10:44,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407060309] [2024-10-14 14:10:44,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:10:44,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 14:10:44,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:10:44,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 14:10:44,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-10-14 14:10:44,346 INFO L87 Difference]: Start difference. First operand 217 states and 291 transitions. Second operand has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-14 14:10:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:10:45,707 INFO L93 Difference]: Finished difference Result 479 states and 640 transitions. [2024-10-14 14:10:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 14:10:45,708 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 119 [2024-10-14 14:10:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:10:45,709 INFO L225 Difference]: With dead ends: 479 [2024-10-14 14:10:45,709 INFO L226 Difference]: Without dead ends: 263 [2024-10-14 14:10:45,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2024-10-14 14:10:45,710 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 398 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 14:10:45,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1049 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 14:10:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-14 14:10:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 194. [2024-10-14 14:10:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 180 states have (on average 1.3166666666666667) internal successors, (237), 180 states have internal predecessors, (237), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:10:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 261 transitions. [2024-10-14 14:10:45,722 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 261 transitions. Word has length 119 [2024-10-14 14:10:45,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:10:45,722 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 261 transitions. [2024-10-14 14:10:45,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-14 14:10:45,723 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 261 transitions. [2024-10-14 14:10:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 14:10:45,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:10:45,723 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:10:45,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 14:10:45,724 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:10:45,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:10:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1027747454, now seen corresponding path program 1 times [2024-10-14 14:10:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:10:45,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112579315] [2024-10-14 14:10:45,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:10:45,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:10:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:11:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:11:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:11:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:11:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:11:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:11:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:11:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:11:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:11:30,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:30,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112579315] [2024-10-14 14:11:30,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112579315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:30,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:30,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-14 14:11:30,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485158247] [2024-10-14 14:11:30,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:30,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 14:11:30,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:30,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 14:11:30,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=312, Unknown=3, NotChecked=0, Total=380 [2024-10-14 14:11:30,727 INFO L87 Difference]: Start difference. First operand 194 states and 261 transitions. Second operand has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 20 states have internal predecessors, (62), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12)