./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-23.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d07b7415c3fe9e96ce75813c6dc74e1ba61589ee27a287636eeb985665ada946 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:16:30,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:16:30,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:16:30,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:16:30,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:16:30,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:16:30,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:16:30,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:16:30,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:16:30,991 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:16:30,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:16:30,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:16:30,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:16:30,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:16:30,995 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:16:30,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:16:30,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:16:30,996 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:16:30,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:16:30,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:16:30,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:16:31,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:16:31,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:16:31,001 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:16:31,001 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:16:31,001 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:16:31,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:16:31,001 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:16:31,002 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:16:31,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:16:31,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:16:31,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:16:31,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:31,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:16:31,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:16:31,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:16:31,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:16:31,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:16:31,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:16:31,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:16:31,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:16:31,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:16:31,008 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d07b7415c3fe9e96ce75813c6dc74e1ba61589ee27a287636eeb985665ada946 [2024-11-10 08:16:31,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:16:31,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:16:31,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:16:31,290 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:16:31,291 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:16:31,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-23.i [2024-11-10 08:16:32,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:16:33,016 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:16:33,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-23.i [2024-11-10 08:16:33,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9400bc73/157334a031384b1488efea158da0a99c/FLAG0518c522a [2024-11-10 08:16:33,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9400bc73/157334a031384b1488efea158da0a99c [2024-11-10 08:16:33,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:16:33,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:16:33,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:16:33,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:16:33,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:16:33,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@143d783d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33, skipping insertion in model container [2024-11-10 08:16:33,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:16:33,245 WARN L250 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_operatoramount_amount10_file-23.i[915,928] [2024-11-10 08:16:33,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:16:33,286 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:16:33,299 WARN L250 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_operatoramount_amount10_file-23.i[915,928] [2024-11-10 08:16:33,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:16:33,345 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:16:33,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33 WrapperNode [2024-11-10 08:16:33,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:16:33,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:16:33,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:16:33,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:16:33,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,414 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-10 08:16:33,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:16:33,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:16:33,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:16:33,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:16:33,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,455 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:16:33,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:16:33,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:16:33,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:16:33,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:16:33,478 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (1/1) ... [2024-11-10 08:16:33,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:33,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:16:33,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:16:33,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:16:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:16:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:16:33,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:16:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:16:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:16:33,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:16:33,658 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:16:33,662 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:16:33,899 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: havoc property_#t~ite17#1;havoc property_#t~bitwise14#1;havoc property_#t~ite16#1;havoc property_#t~bitwise15#1; [2024-11-10 08:16:33,934 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 08:16:33,937 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:16:33,968 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:16:33,970 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:16:33,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:33 BoogieIcfgContainer [2024-11-10 08:16:33,971 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:16:33,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:16:33,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:16:33,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:16:33,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:16:33" (1/3) ... [2024-11-10 08:16:33,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f159fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:16:33, skipping insertion in model container [2024-11-10 08:16:33,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:33" (2/3) ... [2024-11-10 08:16:33,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f159fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:16:33, skipping insertion in model container [2024-11-10 08:16:33,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:33" (3/3) ... [2024-11-10 08:16:33,985 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-23.i [2024-11-10 08:16:34,001 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:16:34,002 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:16:34,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:16:34,073 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;@78c45384, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:16:34,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:16:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 08:16:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 08:16:34,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:34,089 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:34,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:34,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:34,094 INFO L85 PathProgramCache]: Analyzing trace with hash 594390050, now seen corresponding path program 1 times [2024-11-10 08:16:34,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:34,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046577866] [2024-11-10 08:16:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:34,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:34,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:34,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046577866] [2024-11-10 08:16:34,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046577866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:34,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:34,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:16:34,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328548038] [2024-11-10 08:16:34,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:34,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:16:34,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:34,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:16:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:16:34,466 INFO L87 Difference]: Start difference. First operand has 65 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 08:16:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:34,511 INFO L93 Difference]: Finished difference Result 122 states and 197 transitions. [2024-11-10 08:16:34,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:16:34,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2024-11-10 08:16:34,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:34,529 INFO L225 Difference]: With dead ends: 122 [2024-11-10 08:16:34,529 INFO L226 Difference]: Without dead ends: 60 [2024-11-10 08:16:34,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-11-10 08:16:34,536 INFO L432 NwaCegarLoop]: 83 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, 83 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-11-10 08:16:34,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:16:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-10 08:16:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-10 08:16:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 08:16:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2024-11-10 08:16:34,602 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 91 [2024-11-10 08:16:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:34,605 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2024-11-10 08:16:34,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 08:16:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-11-10 08:16:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 08:16:34,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:34,625 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:34,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:16:34,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:34,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash 594297730, now seen corresponding path program 1 times [2024-11-10 08:16:34,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:34,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139362933] [2024-11-10 08:16:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:34,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:35,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139362933] [2024-11-10 08:16:35,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139362933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:35,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:35,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:16:35,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385296751] [2024-11-10 08:16:35,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:35,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:16:35,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:35,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:16:35,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:16:35,362 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:35,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:35,527 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2024-11-10 08:16:35,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:16:35,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-11-10 08:16:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:35,530 INFO L225 Difference]: With dead ends: 109 [2024-11-10 08:16:35,530 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 08:16:35,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:16:35,535 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 63 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:35,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 379 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:16:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 08:16:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-11-10 08:16:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 74 states have internal predecessors, (95), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:16:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2024-11-10 08:16:35,561 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 91 [2024-11-10 08:16:35,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:35,561 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2024-11-10 08:16:35,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2024-11-10 08:16:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 08:16:35,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:35,564 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:35,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:16:35,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:35,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:35,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1372065565, now seen corresponding path program 1 times [2024-11-10 08:16:35,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:35,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558168365] [2024-11-10 08:16:35,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:35,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:35,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558168365] [2024-11-10 08:16:35,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558168365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:35,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:35,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:16:35,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220592970] [2024-11-10 08:16:35,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:35,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:16:35,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:35,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:16:35,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:16:35,662 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:35,745 INFO L93 Difference]: Finished difference Result 202 states and 286 transitions. [2024-11-10 08:16:35,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:16:35,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-10 08:16:35,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:35,753 INFO L225 Difference]: With dead ends: 202 [2024-11-10 08:16:35,754 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 08:16:35,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:16:35,757 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 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-11-10 08:16:35,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:16:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 08:16:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2024-11-10 08:16:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 62 states have internal predecessors, (76), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:16:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2024-11-10 08:16:35,784 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 94 [2024-11-10 08:16:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:35,785 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2024-11-10 08:16:35,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2024-11-10 08:16:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 08:16:35,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:35,788 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:35,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:16:35,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:35,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:35,789 INFO L85 PathProgramCache]: Analyzing trace with hash 963714891, now seen corresponding path program 1 times [2024-11-10 08:16:35,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:35,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26879006] [2024-11-10 08:16:35,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:35,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:35,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:35,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26879006] [2024-11-10 08:16:35,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26879006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:35,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:35,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:16:35,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525855579] [2024-11-10 08:16:35,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:35,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:16:35,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:35,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:16:35,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:16:35,883 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:35,941 INFO L93 Difference]: Finished difference Result 180 states and 256 transitions. [2024-11-10 08:16:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:16:35,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-10 08:16:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:35,943 INFO L225 Difference]: With dead ends: 180 [2024-11-10 08:16:35,943 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 08:16:35,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:16:35,945 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 40 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:35,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 120 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:16:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 08:16:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-11-10 08:16:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:16:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-11-10 08:16:35,963 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 94 [2024-11-10 08:16:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:35,963 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-11-10 08:16:35,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-11-10 08:16:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 08:16:35,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:35,968 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:35,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:16:35,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:35,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:35,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1322470732, now seen corresponding path program 1 times [2024-11-10 08:16:35,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:35,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120465704] [2024-11-10 08:16:35,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:35,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:36,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:36,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120465704] [2024-11-10 08:16:36,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120465704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:36,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:36,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 08:16:36,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900440930] [2024-11-10 08:16:36,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:36,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 08:16:36,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:36,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 08:16:36,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:16:36,534 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:36,735 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2024-11-10 08:16:36,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:16:36,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-10 08:16:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:36,737 INFO L225 Difference]: With dead ends: 122 [2024-11-10 08:16:36,737 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 08:16:36,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-10 08:16:36,738 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 28 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:36,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 496 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:16:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 08:16:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2024-11-10 08:16:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:16:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 142 transitions. [2024-11-10 08:16:36,751 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 142 transitions. Word has length 97 [2024-11-10 08:16:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:36,751 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 142 transitions. [2024-11-10 08:16:36,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 142 transitions. [2024-11-10 08:16:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 08:16:36,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:36,753 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:36,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:16:36,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:36,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:36,754 INFO L85 PathProgramCache]: Analyzing trace with hash -512358861, now seen corresponding path program 1 times [2024-11-10 08:16:36,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:36,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111288732] [2024-11-10 08:16:36,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:36,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:37,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:37,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111288732] [2024-11-10 08:16:37,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111288732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:37,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:37,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 08:16:37,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845844814] [2024-11-10 08:16:37,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:37,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 08:16:37,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:37,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 08:16:37,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:16:37,044 INFO L87 Difference]: Start difference. First operand 101 states and 142 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:37,346 INFO L93 Difference]: Finished difference Result 151 states and 203 transitions. [2024-11-10 08:16:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:16:37,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-10 08:16:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:37,349 INFO L225 Difference]: With dead ends: 151 [2024-11-10 08:16:37,349 INFO L226 Difference]: Without dead ends: 148 [2024-11-10 08:16:37,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-10 08:16:37,350 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 52 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:37,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 559 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:16:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-10 08:16:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 102. [2024-11-10 08:16:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 74 states have internal predecessors, (92), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:16:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-10 08:16:37,371 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 98 [2024-11-10 08:16:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:37,372 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-10 08:16:37,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-10 08:16:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 08:16:37,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:37,375 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:37,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 08:16:37,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:37,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:37,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1985657076, now seen corresponding path program 1 times [2024-11-10 08:16:37,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:37,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420399828] [2024-11-10 08:16:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:37,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:37,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:37,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420399828] [2024-11-10 08:16:37,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420399828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:37,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:37,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 08:16:37,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484398252] [2024-11-10 08:16:37,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:37,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 08:16:37,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:37,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 08:16:37,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:16:37,836 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:38,195 INFO L93 Difference]: Finished difference Result 149 states and 201 transitions. [2024-11-10 08:16:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:16:38,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-10 08:16:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:38,197 INFO L225 Difference]: With dead ends: 149 [2024-11-10 08:16:38,197 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 08:16:38,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-10 08:16:38,198 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 46 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:38,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 637 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:16:38,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 08:16:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2024-11-10 08:16:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 84 states have internal predecessors, (107), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:16:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 159 transitions. [2024-11-10 08:16:38,221 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 159 transitions. Word has length 98 [2024-11-10 08:16:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:38,222 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 159 transitions. [2024-11-10 08:16:38,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 159 transitions. [2024-11-10 08:16:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 08:16:38,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:38,223 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:38,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 08:16:38,223 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:38,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:38,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1738554437, now seen corresponding path program 1 times [2024-11-10 08:16:38,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:38,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552849009] [2024-11-10 08:16:38,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:38,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:38,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:38,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552849009] [2024-11-10 08:16:38,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552849009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:38,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:38,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:16:38,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532525177] [2024-11-10 08:16:38,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:38,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:16:38,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:16:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:16:38,330 INFO L87 Difference]: Start difference. First operand 112 states and 159 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:38,411 INFO L93 Difference]: Finished difference Result 261 states and 370 transitions. [2024-11-10 08:16:38,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:16:38,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-11-10 08:16:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:38,413 INFO L225 Difference]: With dead ends: 261 [2024-11-10 08:16:38,413 INFO L226 Difference]: Without dead ends: 152 [2024-11-10 08:16:38,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:16:38,414 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 26 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:38,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 314 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:16:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-10 08:16:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2024-11-10 08:16:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 94 states have internal predecessors, (122), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:16:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2024-11-10 08:16:38,426 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 99 [2024-11-10 08:16:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:38,426 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2024-11-10 08:16:38,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2024-11-10 08:16:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 08:16:38,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:38,428 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:38,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 08:16:38,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:38,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1881768461, now seen corresponding path program 1 times [2024-11-10 08:16:38,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:38,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236441974] [2024-11-10 08:16:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:38,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:38,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236441974] [2024-11-10 08:16:38,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236441974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:38,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:38,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:16:38,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868300670] [2024-11-10 08:16:38,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:38,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:16:38,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:38,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:16:38,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:16:38,539 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:38,627 INFO L93 Difference]: Finished difference Result 272 states and 386 transitions. [2024-11-10 08:16:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:16:38,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-11-10 08:16:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:38,630 INFO L225 Difference]: With dead ends: 272 [2024-11-10 08:16:38,631 INFO L226 Difference]: Without dead ends: 153 [2024-11-10 08:16:38,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:16:38,633 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 32 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:38,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 328 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:16:38,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-10 08:16:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2024-11-10 08:16:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 104 states have internal predecessors, (137), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:16:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 189 transitions. [2024-11-10 08:16:38,647 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 189 transitions. Word has length 99 [2024-11-10 08:16:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:38,647 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 189 transitions. [2024-11-10 08:16:38,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 189 transitions. [2024-11-10 08:16:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 08:16:38,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:38,650 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:38,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 08:16:38,650 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:38,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1431459360, now seen corresponding path program 1 times [2024-11-10 08:16:38,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:38,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983505551] [2024-11-10 08:16:38,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:38,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:38,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:38,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983505551] [2024-11-10 08:16:38,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983505551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:38,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:38,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:16:38,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431183984] [2024-11-10 08:16:38,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:38,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:16:38,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:38,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:16:38,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:16:38,747 INFO L87 Difference]: Start difference. First operand 132 states and 189 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:38,799 INFO L93 Difference]: Finished difference Result 313 states and 441 transitions. [2024-11-10 08:16:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:16:38,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 100 [2024-11-10 08:16:38,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:38,801 INFO L225 Difference]: With dead ends: 313 [2024-11-10 08:16:38,802 INFO L226 Difference]: Without dead ends: 184 [2024-11-10 08:16:38,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:16:38,803 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 50 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:38,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 141 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:16:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-10 08:16:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 171. [2024-11-10 08:16:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 128 states have (on average 1.2265625) internal successors, (157), 131 states have internal predecessors, (157), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 08:16:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 233 transitions. [2024-11-10 08:16:38,821 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 233 transitions. Word has length 100 [2024-11-10 08:16:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:38,821 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 233 transitions. [2024-11-10 08:16:38,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 233 transitions. [2024-11-10 08:16:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 08:16:38,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:38,823 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:38,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 08:16:38,823 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:38,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:38,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1074859434, now seen corresponding path program 1 times [2024-11-10 08:16:38,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:38,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046131063] [2024-11-10 08:16:38,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:38,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:38,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:38,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046131063] [2024-11-10 08:16:38,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046131063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:38,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:38,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:16:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806327376] [2024-11-10 08:16:38,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:38,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:16:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:38,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:16:38,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:16:38,893 INFO L87 Difference]: Start difference. First operand 171 states and 233 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:38,945 INFO L93 Difference]: Finished difference Result 332 states and 449 transitions. [2024-11-10 08:16:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:16:38,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 100 [2024-11-10 08:16:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:38,947 INFO L225 Difference]: With dead ends: 332 [2024-11-10 08:16:38,948 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 08:16:38,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:16:38,949 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:38,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 161 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:16:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 08:16:38,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2024-11-10 08:16:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 110 states have (on average 1.209090909090909) internal successors, (133), 112 states have internal predecessors, (133), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 08:16:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 197 transitions. [2024-11-10 08:16:38,969 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 197 transitions. Word has length 100 [2024-11-10 08:16:38,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:38,970 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 197 transitions. [2024-11-10 08:16:38,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 197 transitions. [2024-11-10 08:16:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 08:16:38,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:38,972 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:38,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 08:16:38,972 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:38,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1956241196, now seen corresponding path program 1 times [2024-11-10 08:16:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:38,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794078168] [2024-11-10 08:16:38,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:38,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:39,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:39,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794078168] [2024-11-10 08:16:39,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794078168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:39,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:39,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 08:16:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591766932] [2024-11-10 08:16:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:39,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:16:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:39,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:16:39,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:16:39,499 INFO L87 Difference]: Start difference. First operand 147 states and 197 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:39,798 INFO L93 Difference]: Finished difference Result 178 states and 228 transitions. [2024-11-10 08:16:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 08:16:39,798 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 101 [2024-11-10 08:16:39,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:39,800 INFO L225 Difference]: With dead ends: 178 [2024-11-10 08:16:39,800 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 08:16:39,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-10 08:16:39,801 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 29 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:39,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 635 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:16:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 08:16:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2024-11-10 08:16:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 130 states have (on average 1.176923076923077) internal successors, (153), 133 states have internal predecessors, (153), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 08:16:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 221 transitions. [2024-11-10 08:16:39,818 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 221 transitions. Word has length 101 [2024-11-10 08:16:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:39,818 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 221 transitions. [2024-11-10 08:16:39,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 221 transitions. [2024-11-10 08:16:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 08:16:39,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:39,820 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:39,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 08:16:39,820 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:39,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:39,820 INFO L85 PathProgramCache]: Analyzing trace with hash 318558747, now seen corresponding path program 1 times [2024-11-10 08:16:39,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:39,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421702813] [2024-11-10 08:16:39,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:39,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:39,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:39,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421702813] [2024-11-10 08:16:39,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421702813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:39,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:39,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:16:39,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137396139] [2024-11-10 08:16:39,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:39,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:16:39,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:16:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:16:39,915 INFO L87 Difference]: Start difference. First operand 171 states and 221 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:40,045 INFO L93 Difference]: Finished difference Result 360 states and 467 transitions. [2024-11-10 08:16:40,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:16:40,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 102 [2024-11-10 08:16:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:40,047 INFO L225 Difference]: With dead ends: 360 [2024-11-10 08:16:40,047 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 08:16:40,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:16:40,051 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 24 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:40,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 270 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:16:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 08:16:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 182. [2024-11-10 08:16:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 141 states have (on average 1.198581560283688) internal successors, (169), 144 states have internal predecessors, (169), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 08:16:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 237 transitions. [2024-11-10 08:16:40,082 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 237 transitions. Word has length 102 [2024-11-10 08:16:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:40,083 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 237 transitions. [2024-11-10 08:16:40,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 237 transitions. [2024-11-10 08:16:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 08:16:40,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:40,085 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:40,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 08:16:40,085 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:40,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash 494110545, now seen corresponding path program 1 times [2024-11-10 08:16:40,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:40,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8492721] [2024-11-10 08:16:40,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:40,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:40,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8492721] [2024-11-10 08:16:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8492721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:40,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:40,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:16:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013735419] [2024-11-10 08:16:40,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:40,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:16:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:40,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:16:40,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:16:40,176 INFO L87 Difference]: Start difference. First operand 182 states and 237 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:40,309 INFO L93 Difference]: Finished difference Result 370 states and 483 transitions. [2024-11-10 08:16:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:16:40,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 102 [2024-11-10 08:16:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:40,311 INFO L225 Difference]: With dead ends: 370 [2024-11-10 08:16:40,311 INFO L226 Difference]: Without dead ends: 210 [2024-11-10 08:16:40,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:16:40,312 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 28 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:40,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 268 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:16:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-10 08:16:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 193. [2024-11-10 08:16:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 152 states have (on average 1.2105263157894737) internal successors, (184), 155 states have internal predecessors, (184), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 08:16:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 252 transitions. [2024-11-10 08:16:40,330 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 252 transitions. Word has length 102 [2024-11-10 08:16:40,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:40,330 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 252 transitions. [2024-11-10 08:16:40,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 252 transitions. [2024-11-10 08:16:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 08:16:40,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:40,331 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:40,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 08:16:40,332 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:40,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1231518081, now seen corresponding path program 1 times [2024-11-10 08:16:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:40,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737035011] [2024-11-10 08:16:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:40,582 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:40,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:40,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737035011] [2024-11-10 08:16:40,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737035011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:40,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:40,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 08:16:40,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162660609] [2024-11-10 08:16:40,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:40,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 08:16:40,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:40,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 08:16:40,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:16:40,585 INFO L87 Difference]: Start difference. First operand 193 states and 252 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:40,848 INFO L93 Difference]: Finished difference Result 236 states and 297 transitions. [2024-11-10 08:16:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 08:16:40,849 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 102 [2024-11-10 08:16:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:40,851 INFO L225 Difference]: With dead ends: 236 [2024-11-10 08:16:40,851 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 08:16:40,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-10 08:16:40,852 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 55 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:40,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 732 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:16:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 08:16:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 198. [2024-11-10 08:16:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 157 states have (on average 1.2101910828025477) internal successors, (190), 160 states have internal predecessors, (190), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 08:16:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 258 transitions. [2024-11-10 08:16:40,868 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 258 transitions. Word has length 102 [2024-11-10 08:16:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:40,869 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 258 transitions. [2024-11-10 08:16:40,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 258 transitions. [2024-11-10 08:16:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 08:16:40,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:40,870 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:40,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 08:16:40,871 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:40,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash 938115074, now seen corresponding path program 1 times [2024-11-10 08:16:40,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:40,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731457695] [2024-11-10 08:16:40,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:40,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731457695] [2024-11-10 08:16:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731457695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:41,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:41,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 08:16:41,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337689745] [2024-11-10 08:16:41,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:41,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 08:16:41,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:41,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 08:16:41,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:16:41,318 INFO L87 Difference]: Start difference. First operand 198 states and 258 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:41,715 INFO L93 Difference]: Finished difference Result 239 states and 302 transitions. [2024-11-10 08:16:41,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 08:16:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 102 [2024-11-10 08:16:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:41,718 INFO L225 Difference]: With dead ends: 239 [2024-11-10 08:16:41,718 INFO L226 Difference]: Without dead ends: 236 [2024-11-10 08:16:41,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-10 08:16:41,719 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 44 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:41,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 893 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:16:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-10 08:16:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 188. [2024-11-10 08:16:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 147 states have (on average 1.217687074829932) internal successors, (179), 150 states have internal predecessors, (179), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 08:16:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 247 transitions. [2024-11-10 08:16:41,734 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 247 transitions. Word has length 102 [2024-11-10 08:16:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:41,735 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 247 transitions. [2024-11-10 08:16:41,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 247 transitions. [2024-11-10 08:16:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 08:16:41,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:41,736 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:41,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 08:16:41,737 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:41,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1170246932, now seen corresponding path program 1 times [2024-11-10 08:16:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:41,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946314461] [2024-11-10 08:16:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:41,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:41,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:41,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946314461] [2024-11-10 08:16:41,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946314461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:41,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:41,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:16:41,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814964854] [2024-11-10 08:16:41,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:41,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:16:41,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:41,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:16:41,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:16:41,792 INFO L87 Difference]: Start difference. First operand 188 states and 247 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:41,847 INFO L93 Difference]: Finished difference Result 398 states and 525 transitions. [2024-11-10 08:16:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:16:41,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 103 [2024-11-10 08:16:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:41,850 INFO L225 Difference]: With dead ends: 398 [2024-11-10 08:16:41,850 INFO L226 Difference]: Without dead ends: 232 [2024-11-10 08:16:41,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:16:41,851 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 41 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:41,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 169 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:16:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-10 08:16:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 197. [2024-11-10 08:16:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 156 states have (on average 1.2115384615384615) internal successors, (189), 159 states have internal predecessors, (189), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 08:16:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 257 transitions. [2024-11-10 08:16:41,869 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 257 transitions. Word has length 103 [2024-11-10 08:16:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:41,870 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 257 transitions. [2024-11-10 08:16:41,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 257 transitions. [2024-11-10 08:16:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 08:16:41,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:41,871 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:41,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 08:16:41,872 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:41,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash -481472094, now seen corresponding path program 1 times [2024-11-10 08:16:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:41,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574812740] [2024-11-10 08:16:41,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:41,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:41,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574812740] [2024-11-10 08:16:41,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574812740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:41,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:41,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:16:41,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479586302] [2024-11-10 08:16:41,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:41,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:16:41,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:41,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:16:41,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:16:41,927 INFO L87 Difference]: Start difference. First operand 197 states and 257 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:41,981 INFO L93 Difference]: Finished difference Result 390 states and 506 transitions. [2024-11-10 08:16:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:16:41,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 103 [2024-11-10 08:16:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:41,984 INFO L225 Difference]: With dead ends: 390 [2024-11-10 08:16:41,984 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 08:16:41,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:16:41,986 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 46 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:41,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 151 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:16:41,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 08:16:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 185. [2024-11-10 08:16:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 144 states have (on average 1.1527777777777777) internal successors, (166), 147 states have internal predecessors, (166), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 08:16:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 234 transitions. [2024-11-10 08:16:42,001 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 234 transitions. Word has length 103 [2024-11-10 08:16:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:42,002 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 234 transitions. [2024-11-10 08:16:42,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 234 transitions. [2024-11-10 08:16:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 08:16:42,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:42,003 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:42,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 08:16:42,004 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:42,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash -620903180, now seen corresponding path program 1 times [2024-11-10 08:16:42,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:42,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581772582] [2024-11-10 08:16:42,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:42,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 08:16:42,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:42,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581772582] [2024-11-10 08:16:42,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581772582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:42,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:42,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 08:16:42,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964902054] [2024-11-10 08:16:42,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:42,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:16:42,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:42,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:16:42,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:16:42,530 INFO L87 Difference]: Start difference. First operand 185 states and 234 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:42,805 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2024-11-10 08:16:42,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 08:16:42,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 105 [2024-11-10 08:16:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:42,807 INFO L225 Difference]: With dead ends: 211 [2024-11-10 08:16:42,807 INFO L226 Difference]: Without dead ends: 208 [2024-11-10 08:16:42,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-10 08:16:42,809 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 19 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:42,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 595 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:16:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-10 08:16:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 192. [2024-11-10 08:16:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 154 states have internal predecessors, (173), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 08:16:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 241 transitions. [2024-11-10 08:16:42,825 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 241 transitions. Word has length 105 [2024-11-10 08:16:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:42,825 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 241 transitions. [2024-11-10 08:16:42,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 08:16:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 241 transitions. [2024-11-10 08:16:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 08:16:42,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:42,827 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:16:42,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 08:16:42,827 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:42,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:42,828 INFO L85 PathProgramCache]: Analyzing trace with hash 403657857, now seen corresponding path program 1 times [2024-11-10 08:16:42,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:42,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732415964] [2024-11-10 08:16:42,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:42,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:16:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 08:16:43,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732415964] [2024-11-10 08:16:43,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732415964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:16:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742345013] [2024-11-10 08:16:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:43,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:16:43,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:16:43,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:16:43,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 08:16:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:43,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 08:16:43,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:16:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-10 08:16:43,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:16:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 08:16:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742345013] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:16:44,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:16:44,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2024-11-10 08:16:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114881239] [2024-11-10 08:16:44,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:16:44,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 08:16:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:44,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 08:16:44,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-10 08:16:44,078 INFO L87 Difference]: Start difference. First operand 192 states and 241 transitions. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 08:16:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:44,590 INFO L93 Difference]: Finished difference Result 305 states and 366 transitions. [2024-11-10 08:16:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 08:16:44,591 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 105 [2024-11-10 08:16:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:44,591 INFO L225 Difference]: With dead ends: 305 [2024-11-10 08:16:44,592 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:16:44,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 226 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2024-11-10 08:16:44,593 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 163 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:44,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 449 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:16:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:16:44,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:16:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 08:16:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:16:44,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2024-11-10 08:16:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:44,595 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:16:44,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 08:16:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:16:44,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:16:44,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:16:44,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 08:16:44,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:16:44,806 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:16:44,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:16:50,671 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:16:50,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:16:50 BoogieIcfgContainer [2024-11-10 08:16:50,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:16:50,691 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:16:50,691 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:16:50,691 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:16:50,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:33" (3/4) ... [2024-11-10 08:16:50,696 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:16:50,700 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:16:50,707 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:16:50,707 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 08:16:50,707 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:16:50,707 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:16:50,801 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:16:50,801 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:16:50,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:16:50,802 INFO L158 Benchmark]: Toolchain (without parser) took 17747.58ms. Allocated memory was 138.4MB in the beginning and 578.8MB in the end (delta: 440.4MB). Free memory was 67.2MB in the beginning and 452.9MB in the end (delta: -385.7MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,802 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory was 99.2MB in the beginning and 98.9MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:16:50,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.94ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 66.9MB in the beginning and 161.6MB in the end (delta: -94.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.48ms. Allocated memory is still 190.8MB. Free memory was 161.5MB in the beginning and 160.8MB in the end (delta: 741.4kB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,803 INFO L158 Benchmark]: Boogie Preprocessor took 57.06ms. Allocated memory is still 190.8MB. Free memory was 160.8MB in the beginning and 158.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,803 INFO L158 Benchmark]: IcfgBuilder took 498.20ms. Allocated memory is still 190.8MB. Free memory was 158.7MB in the beginning and 139.5MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,804 INFO L158 Benchmark]: TraceAbstraction took 16716.46ms. Allocated memory was 190.8MB in the beginning and 578.8MB in the end (delta: 388.0MB). Free memory was 139.5MB in the beginning and 459.2MB in the end (delta: -319.6MB). Peak memory consumption was 330.7MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,804 INFO L158 Benchmark]: Witness Printer took 110.77ms. Allocated memory is still 578.8MB. Free memory was 459.2MB in the beginning and 452.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,805 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory was 99.2MB in the beginning and 98.9MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.94ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 66.9MB in the beginning and 161.6MB in the end (delta: -94.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.48ms. Allocated memory is still 190.8MB. Free memory was 161.5MB in the beginning and 160.8MB in the end (delta: 741.4kB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.06ms. Allocated memory is still 190.8MB. Free memory was 160.8MB in the beginning and 158.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 498.20ms. Allocated memory is still 190.8MB. Free memory was 158.7MB in the beginning and 139.5MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16716.46ms. Allocated memory was 190.8MB in the beginning and 578.8MB in the end (delta: 388.0MB). Free memory was 139.5MB in the beginning and 459.2MB in the end (delta: -319.6MB). Peak memory consumption was 330.7MB. Max. memory is 16.1GB. * Witness Printer took 110.77ms. Allocated memory is still 578.8MB. Free memory was 459.2MB in the beginning and 452.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 20, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 867 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 833 mSDsluCounter, 7530 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5703 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3183 IncrementalHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 1827 mSDtfsCounter, 3183 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 961 GetRequests, 817 SyntacticMatches, 4 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=15, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 428 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2091 NumberOfCodeBlocks, 2091 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2174 ConstructedInterpolants, 0 QuantifiedInterpolants, 4043 SizeOfPredicates, 8 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 7990/8008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 79]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8)))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:16:50,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE