./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-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:02:38,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:02:39,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:02:39,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:02:39,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:02:39,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:02:39,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:02:39,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:02:39,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:02:39,112 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:02:39,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:02:39,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:02:39,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:02:39,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:02:39,115 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:02:39,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:02:39,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:02:39,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:02:39,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:02:39,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:02:39,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:02:39,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:02:39,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:02:39,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:02:39,118 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:02:39,118 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:02:39,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:02:39,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:02:39,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:02:39,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:02:39,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:02:39,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:02:39,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:02:39,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:02:39,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:02:39,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:02:39,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:02:39,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:02:39,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:02:39,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:02:39,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:02:39,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:02:39,127 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-clean/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-clean/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 -> 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 [2024-10-11 14:02:39,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:02:39,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:02:39,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:02:39,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:02:39,403 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:02:39,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2024-10-11 14:02:40,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:02:41,008 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:02:41,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2024-10-11 14:02:41,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0d6579ee6/2e5d798e0abc4638ba17f66f86ea4326/FLAG53eecee7d [2024-10-11 14:02:41,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0d6579ee6/2e5d798e0abc4638ba17f66f86ea4326 [2024-10-11 14:02:41,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:02:41,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:02:41,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:02:41,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:02:41,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:02:41,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63dd2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41, skipping insertion in model container [2024-10-11 14:02:41,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:02:41,284 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-71.i[917,930] [2024-10-11 14:02:41,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:02:41,369 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:02:41,380 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-71.i[917,930] [2024-10-11 14:02:41,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:02:41,455 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:02:41,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41 WrapperNode [2024-10-11 14:02:41,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:02:41,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:02:41,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:02:41,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:02:41,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,535 INFO L138 Inliner]: procedures = 26, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2024-10-11 14:02:41,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:02:41,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:02:41,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:02:41,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:02:41,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,582 INFO L175 MemorySlicer]: Split 138 memory accesses to 2 slices as follows [2, 136]. 99 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 18 writes are split as follows [0, 18]. [2024-10-11 14:02:41,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,605 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:02:41,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:02:41,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:02:41,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:02:41,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (1/1) ... [2024-10-11 14:02:41,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:02:41,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:02:41,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:02:41,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:02:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:02:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:02:41,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:02:41,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:02:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:02:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:02:41,734 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:02:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:02:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:02:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:02:41,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:02:41,876 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:02:41,879 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:02:42,460 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-11 14:02:42,461 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:02:42,506 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:02:42,506 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:02:42,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:42 BoogieIcfgContainer [2024-10-11 14:02:42,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:02:42,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:02:42,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:02:42,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:02:42,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:02:41" (1/3) ... [2024-10-11 14:02:42,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e29fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:02:42, skipping insertion in model container [2024-10-11 14:02:42,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:41" (2/3) ... [2024-10-11 14:02:42,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e29fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:02:42, skipping insertion in model container [2024-10-11 14:02:42,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:42" (3/3) ... [2024-10-11 14:02:42,518 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-71.i [2024-10-11 14:02:42,533 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:02:42,533 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:02:42,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:02:42,604 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;@6241238f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:02:42,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:02:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:02:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 14:02:42,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:42,621 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:02:42,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:42,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:42,627 INFO L85 PathProgramCache]: Analyzing trace with hash 550506585, now seen corresponding path program 1 times [2024-10-11 14:02:42,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:42,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763760803] [2024-10-11 14:02:42,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:42,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:42,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:42,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:42,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:42,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:02:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:02:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:02:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:02:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:02:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:02:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:02:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:02:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:43,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763760803] [2024-10-11 14:02:43,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763760803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:43,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:43,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:02:43,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674496873] [2024-10-11 14:02:43,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:43,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:02:43,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:43,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:02:43,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:02:43,134 INFO L87 Difference]: Start difference. First operand has 98 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 14:02:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:43,177 INFO L93 Difference]: Finished difference Result 193 states and 309 transitions. [2024-10-11 14:02:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:02:43,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 139 [2024-10-11 14:02:43,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:43,189 INFO L225 Difference]: With dead ends: 193 [2024-10-11 14:02:43,189 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 14:02:43,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-11 14:02:43,195 INFO L432 NwaCegarLoop]: 135 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, 135 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-11 14:02:43,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:02:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 14:02:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 14:02:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:02:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2024-10-11 14:02:43,246 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 139 [2024-10-11 14:02:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:43,247 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2024-10-11 14:02:43,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 14:02:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2024-10-11 14:02:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 14:02:43,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:43,254 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:02:43,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:02:43,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:43,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1928891265, now seen corresponding path program 1 times [2024-10-11 14:02:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:43,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26987404] [2024-10-11 14:02:43,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:02:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:02:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:02:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:02:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:02:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:02:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:02:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:02:43,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26987404] [2024-10-11 14:02:43,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26987404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:43,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:43,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:02:43,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918356511] [2024-10-11 14:02:43,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:43,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:02:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:02:43,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:02:43,752 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:43,819 INFO L93 Difference]: Finished difference Result 194 states and 281 transitions. [2024-10-11 14:02:43,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:02:43,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-10-11 14:02:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:43,823 INFO L225 Difference]: With dead ends: 194 [2024-10-11 14:02:43,826 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 14:02:43,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-11 14:02:43,829 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 389 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-11 14:02:43,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 389 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:02:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 14:02:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-11 14:02:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:02:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2024-10-11 14:02:43,851 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 139 [2024-10-11 14:02:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:43,853 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2024-10-11 14:02:43,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:43,853 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2024-10-11 14:02:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 14:02:43,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:43,855 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:02:43,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:02:43,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:43,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1871632963, now seen corresponding path program 1 times [2024-10-11 14:02:43,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:43,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163703979] [2024-10-11 14:02:43,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:43,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:02:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:02:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:02:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:02:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:02:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:02:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:02:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:02:44,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:44,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163703979] [2024-10-11 14:02:44,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163703979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:44,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:44,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:02:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695022086] [2024-10-11 14:02:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:44,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:02:44,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:44,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:02:44,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:02:44,116 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:44,175 INFO L93 Difference]: Finished difference Result 198 states and 285 transitions. [2024-10-11 14:02:44,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:02:44,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-10-11 14:02:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:44,180 INFO L225 Difference]: With dead ends: 198 [2024-10-11 14:02:44,181 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 14:02:44,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-11 14:02:44,185 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 393 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-11 14:02:44,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 393 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:02:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 14:02:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-11 14:02:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:02:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2024-10-11 14:02:44,202 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 139 [2024-10-11 14:02:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:44,203 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2024-10-11 14:02:44,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2024-10-11 14:02:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 14:02:44,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:44,205 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:02:44,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:02:44,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:44,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1871573381, now seen corresponding path program 1 times [2024-10-11 14:02:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:44,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353046374] [2024-10-11 14:02:44,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:02:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:02:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:02:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:02:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:02:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:02:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:02:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:02:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:45,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353046374] [2024-10-11 14:02:45,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353046374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:45,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:45,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:02:45,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521227293] [2024-10-11 14:02:45,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:45,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:02:45,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:45,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:02:45,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:02:45,427 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:45,913 INFO L93 Difference]: Finished difference Result 244 states and 349 transitions. [2024-10-11 14:02:45,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:02:45,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-10-11 14:02:45,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:45,915 INFO L225 Difference]: With dead ends: 244 [2024-10-11 14:02:45,915 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 14:02:45,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:02:45,917 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 225 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:45,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 337 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:02:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 14:02:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 108. [2024-10-11 14:02:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:02:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-10-11 14:02:45,933 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 139 [2024-10-11 14:02:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:45,934 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-10-11 14:02:45,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-10-11 14:02:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 14:02:45,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:45,937 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:02:45,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:02:45,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:45,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1203109700, now seen corresponding path program 1 times [2024-10-11 14:02:45,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:45,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227311383] [2024-10-11 14:02:45,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:45,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:02:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:02:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:02:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:02:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:02:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:02:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:02:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:02:47,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:47,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227311383] [2024-10-11 14:02:47,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227311383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:47,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:47,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:02:47,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330510194] [2024-10-11 14:02:47,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:47,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:02:47,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:47,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:02:47,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:02:47,255 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:47,872 INFO L93 Difference]: Finished difference Result 256 states and 367 transitions. [2024-10-11 14:02:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:02:47,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-10-11 14:02:47,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:47,875 INFO L225 Difference]: With dead ends: 256 [2024-10-11 14:02:47,875 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 14:02:47,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:02:47,877 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 258 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:47,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 339 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:02:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 14:02:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 108. [2024-10-11 14:02:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:02:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-10-11 14:02:47,903 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 140 [2024-10-11 14:02:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:47,903 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-10-11 14:02:47,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-10-11 14:02:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 14:02:47,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:47,907 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:02:47,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:02:47,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:47,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1223037624, now seen corresponding path program 1 times [2024-10-11 14:02:47,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:47,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470947053] [2024-10-11 14:02:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:47,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:02:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:02:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:02:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:02:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:02:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:02:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:02:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:02:48,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:48,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470947053] [2024-10-11 14:02:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470947053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:48,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:48,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:02:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299130703] [2024-10-11 14:02:48,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:48,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:02:48,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:48,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:02:48,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:02:48,953 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:49,447 INFO L93 Difference]: Finished difference Result 265 states and 382 transitions. [2024-10-11 14:02:49,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:02:49,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-10-11 14:02:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:49,449 INFO L225 Difference]: With dead ends: 265 [2024-10-11 14:02:49,450 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 14:02:49,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:02:49,451 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 191 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:49,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 297 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:02:49,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 14:02:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 124. [2024-10-11 14:02:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:02:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 179 transitions. [2024-10-11 14:02:49,472 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 179 transitions. Word has length 140 [2024-10-11 14:02:49,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:49,472 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 179 transitions. [2024-10-11 14:02:49,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 179 transitions. [2024-10-11 14:02:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 14:02:49,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:49,475 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:02:49,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:02:49,475 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:49,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:49,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1792808450, now seen corresponding path program 1 times [2024-10-11 14:02:49,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:49,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41314638] [2024-10-11 14:02:49,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:49,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:02:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:02:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:02:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:02:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:02:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:02:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:02:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:02:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41314638] [2024-10-11 14:02:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41314638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:50,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:50,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:02:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838952698] [2024-10-11 14:02:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:50,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:02:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:50,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:02:50,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:02:50,989 INFO L87 Difference]: Start difference. First operand 124 states and 179 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:51,638 INFO L93 Difference]: Finished difference Result 300 states and 430 transitions. [2024-10-11 14:02:51,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:02:51,638 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2024-10-11 14:02:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:51,640 INFO L225 Difference]: With dead ends: 300 [2024-10-11 14:02:51,640 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 14:02:51,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:02:51,641 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 225 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:51,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 527 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:02:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 14:02:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 139. [2024-10-11 14:02:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.3728813559322033) internal successors, (162), 118 states have internal predecessors, (162), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:02:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. [2024-10-11 14:02:51,660 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 200 transitions. Word has length 141 [2024-10-11 14:02:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:51,660 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 200 transitions. [2024-10-11 14:02:51,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:51,661 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 200 transitions. [2024-10-11 14:02:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 14:02:51,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:51,662 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:02:51,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:02:51,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:51,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash -397142625, now seen corresponding path program 1 times [2024-10-11 14:02:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:51,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405407236] [2024-10-11 14:02:51,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:02:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:02:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:02:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:02:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:02:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:02:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:02:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:02:52,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:52,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405407236] [2024-10-11 14:02:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405407236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:52,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:52,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:02:52,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51119516] [2024-10-11 14:02:52,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:52,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:02:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:52,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:02:52,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:02:52,146 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:52,464 INFO L93 Difference]: Finished difference Result 278 states and 400 transitions. [2024-10-11 14:02:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:02:52,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2024-10-11 14:02:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:52,466 INFO L225 Difference]: With dead ends: 278 [2024-10-11 14:02:52,466 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 14:02:52,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:02:52,467 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 117 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:52,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 284 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:02:52,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 14:02:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-10-11 14:02:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 118 states have internal predecessors, (161), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:02:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 199 transitions. [2024-10-11 14:02:52,487 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 199 transitions. Word has length 141 [2024-10-11 14:02:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:52,488 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 199 transitions. [2024-10-11 14:02:52,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 199 transitions. [2024-10-11 14:02:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 14:02:52,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:52,490 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:02:52,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:02:52,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:52,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:52,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1165170531, now seen corresponding path program 1 times [2024-10-11 14:02:52,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:52,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722319618] [2024-10-11 14:02:52,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:52,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:53,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:54,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:02:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:02:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:02:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:54,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:02:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:02:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:54,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:02:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:54,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:02:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:02:54,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:54,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722319618] [2024-10-11 14:02:54,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722319618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:54,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:54,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:02:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950156609] [2024-10-11 14:02:54,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:54,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:02:54,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:54,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:02:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:02:54,077 INFO L87 Difference]: Start difference. First operand 139 states and 199 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:54,700 INFO L93 Difference]: Finished difference Result 321 states and 457 transitions. [2024-10-11 14:02:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:02:54,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 142 [2024-10-11 14:02:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:54,702 INFO L225 Difference]: With dead ends: 321 [2024-10-11 14:02:54,702 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 14:02:54,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:02:54,703 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 227 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:54,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 554 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:02:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 14:02:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 141. [2024-10-11 14:02:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 120 states have (on average 1.3666666666666667) internal successors, (164), 120 states have internal predecessors, (164), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:02:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2024-10-11 14:02:54,750 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 142 [2024-10-11 14:02:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:54,751 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2024-10-11 14:02:54,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2024-10-11 14:02:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 14:02:54,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:54,753 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:02:54,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:02:54,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:54,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash 414348939, now seen corresponding path program 1 times [2024-10-11 14:02:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:54,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812146053] [2024-10-11 14:02:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:02:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:02:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:02:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:02:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:02:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:02:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:02:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:02:56,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:56,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812146053] [2024-10-11 14:02:56,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812146053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:56,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:56,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:02:56,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24380112] [2024-10-11 14:02:56,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:56,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:02:56,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:56,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:02:56,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:02:56,134 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:57,120 INFO L93 Difference]: Finished difference Result 314 states and 446 transitions. [2024-10-11 14:02:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:02:57,121 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 142 [2024-10-11 14:02:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:57,123 INFO L225 Difference]: With dead ends: 314 [2024-10-11 14:02:57,123 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 14:02:57,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 14:02:57,124 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 285 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:57,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 492 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 14:02:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 14:02:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 142. [2024-10-11 14:02:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 121 states have internal predecessors, (165), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:02:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 203 transitions. [2024-10-11 14:02:57,146 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 203 transitions. Word has length 142 [2024-10-11 14:02:57,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:57,146 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 203 transitions. [2024-10-11 14:02:57,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 203 transitions. [2024-10-11 14:02:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 14:02:57,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:57,148 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:02:57,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:02:57,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:57,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1775602136, now seen corresponding path program 1 times [2024-10-11 14:02:57,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:57,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697723560] [2024-10-11 14:02:57,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:57,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:02:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:02:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:02:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:02:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:02:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:02:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:02:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:02:58,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:58,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697723560] [2024-10-11 14:02:58,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697723560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:58,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:58,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:02:58,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614076292] [2024-10-11 14:02:58,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:58,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:02:58,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:58,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:02:58,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:02:58,298 INFO L87 Difference]: Start difference. First operand 142 states and 203 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:58,777 INFO L93 Difference]: Finished difference Result 321 states and 457 transitions. [2024-10-11 14:02:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:02:58,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 142 [2024-10-11 14:02:58,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:58,779 INFO L225 Difference]: With dead ends: 321 [2024-10-11 14:02:58,779 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 14:02:58,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:02:58,780 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 141 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:58,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 297 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:02:58,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 14:02:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 142. [2024-10-11 14:02:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 121 states have internal predecessors, (164), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:02:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 202 transitions. [2024-10-11 14:02:58,801 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 202 transitions. Word has length 142 [2024-10-11 14:02:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:58,801 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 202 transitions. [2024-10-11 14:02:58,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:02:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 202 transitions. [2024-10-11 14:02:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 14:02:58,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:58,804 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:02:58,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:02:58,804 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:58,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash -6157430, now seen corresponding path program 1 times [2024-10-11 14:02:58,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:58,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768636732] [2024-10-11 14:02:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:58,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:02:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:02:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:02:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:02:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:02:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:02:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:02:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:02:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:02:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:02:59,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:59,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768636732] [2024-10-11 14:02:59,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768636732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:59,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:59,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:02:59,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647456181] [2024-10-11 14:02:59,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:59,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:02:59,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:59,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:02:59,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:02:59,920 INFO L87 Difference]: Start difference. First operand 142 states and 202 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:03:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:03:00,596 INFO L93 Difference]: Finished difference Result 336 states and 474 transitions. [2024-10-11 14:03:00,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:03:00,598 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 142 [2024-10-11 14:03:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:03:00,599 INFO L225 Difference]: With dead ends: 336 [2024-10-11 14:03:00,600 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 14:03:00,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:03:00,601 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 147 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:03:00,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 580 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:03:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 14:03:00,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2024-10-11 14:03:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.3661971830985915) internal successors, (194), 142 states have internal predecessors, (194), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 14:03:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 232 transitions. [2024-10-11 14:03:00,639 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 232 transitions. Word has length 142 [2024-10-11 14:03:00,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:03:00,640 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 232 transitions. [2024-10-11 14:03:00,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:03:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 232 transitions. [2024-10-11 14:03:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 14:03:00,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:03:00,642 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 14:03:00,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:03:00,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:03:00,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:03:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1017274680, now seen corresponding path program 1 times [2024-10-11 14:03:00,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:03:00,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683536200] [2024-10-11 14:03:00,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:00,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:03:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:10,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:03:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:03:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:03:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:03:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:03:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:03:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:03:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:03:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:03:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:03:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:03:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:03:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:03:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:03:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:03:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:03:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:03:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:03:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:03:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 14:03:11,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:03:11,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683536200] [2024-10-11 14:03:11,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683536200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:03:11,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:03:11,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 14:03:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081306360] [2024-10-11 14:03:11,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:03:11,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 14:03:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:03:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 14:03:11,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:03:11,267 INFO L87 Difference]: Start difference. First operand 163 states and 232 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-11 14:03:45,145 WARN L286 SmtUtils]: Spent 33.82s on a formula simplification. DAG size of input: 157 DAG size of output: 147 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 14:03:49,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []