./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.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 e9518b729fb33f0de408129e2e0e3cb97ea8e11de366001cefdd2574471f584b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:24:32,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:24:32,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:24:32,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:24:32,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:24:32,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:24:32,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:24:32,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:24:32,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:24:32,348 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:24:32,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:24:32,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:24:32,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:24:32,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:24:32,352 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:24:32,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:24:32,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:24:32,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:24:32,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:24:32,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:24:32,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:24:32,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:24:32,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:24:32,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:24:32,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:24:32,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:24:32,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:24:32,358 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:24:32,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:24:32,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:24:32,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:24:32,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:24:32,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:24:32,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:24:32,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:24:32,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:24:32,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:24:32,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:24:32,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:24:32,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:24:32,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:24:32,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:24:32,362 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 -> e9518b729fb33f0de408129e2e0e3cb97ea8e11de366001cefdd2574471f584b [2024-11-20 07:24:32,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:24:32,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:24:32,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:24:32,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:24:32,729 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:24:32,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i [2024-11-20 07:24:34,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:24:34,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:24:34,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i [2024-11-20 07:24:34,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34955972a/613dfd1ee0ca414f9bd09bee808e081d/FLAGb588bde62 [2024-11-20 07:24:34,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34955972a/613dfd1ee0ca414f9bd09bee808e081d [2024-11-20 07:24:34,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:24:34,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:24:34,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:24:34,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:24:34,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:24:34,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:34,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df433d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34, skipping insertion in model container [2024-11-20 07:24:34,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:34,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:24:34,731 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_amount100_file-92.i[916,929] [2024-11-20 07:24:34,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:24:34,840 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:24:34,852 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_amount100_file-92.i[916,929] [2024-11-20 07:24:34,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:24:34,949 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:24:34,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34 WrapperNode [2024-11-20 07:24:34,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:24:34,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:24:34,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:24:34,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:24:34,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:34,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:35,032 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 310 [2024-11-20 07:24:35,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:24:35,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:24:35,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:24:35,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:24:35,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:35,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:35,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:35,087 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-20 07:24:35,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:35,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:35,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:35,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:35,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:35,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:35,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:24:35,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:24:35,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:24:35,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:24:35,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (1/1) ... [2024-11-20 07:24:35,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:24:35,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:24:35,171 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-20 07:24:35,179 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-20 07:24:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:24:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:24:35,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:24:35,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:24:35,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:24:35,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:24:35,403 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:24:35,415 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:24:36,184 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-20 07:24:36,185 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:24:36,210 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:24:36,210 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:24:36,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:24:36 BoogieIcfgContainer [2024-11-20 07:24:36,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:24:36,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:24:36,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:24:36,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:24:36,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:24:34" (1/3) ... [2024-11-20 07:24:36,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f99aed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:24:36, skipping insertion in model container [2024-11-20 07:24:36,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:24:34" (2/3) ... [2024-11-20 07:24:36,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f99aed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:24:36, skipping insertion in model container [2024-11-20 07:24:36,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:24:36" (3/3) ... [2024-11-20 07:24:36,223 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-92.i [2024-11-20 07:24:36,243 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:24:36,243 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:24:36,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:24:36,318 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;@2706b074, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:24:36,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:24:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 102 states have (on average 1.5) internal successors, (153), 103 states have internal predecessors, (153), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 07:24:36,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 07:24:36,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:24:36,345 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:24:36,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:24:36,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:24:36,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1137290694, now seen corresponding path program 1 times [2024-11-20 07:24:36,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:24:36,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11922672] [2024-11-20 07:24:36,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:24:36,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:24:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:24:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:24:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:24:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:24:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:24:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:24:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:24:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:24:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:24:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 07:24:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:24:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 07:24:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:24:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 07:24:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:24:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 07:24:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 07:24:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 07:24:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 07:24:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 07:24:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:24:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 07:24:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 07:24:36,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:24:36,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11922672] [2024-11-20 07:24:36,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11922672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:24:36,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:24:36,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:24:37,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341187154] [2024-11-20 07:24:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:24:37,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:24:37,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:24:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:24:37,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:24:37,040 INFO L87 Difference]: Start difference. First operand has 127 states, 102 states have (on average 1.5) internal successors, (153), 103 states have internal predecessors, (153), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 07:24:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:24:37,080 INFO L93 Difference]: Finished difference Result 247 states and 410 transitions. [2024-11-20 07:24:37,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:24:37,086 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 159 [2024-11-20 07:24:37,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:24:37,096 INFO L225 Difference]: With dead ends: 247 [2024-11-20 07:24:37,096 INFO L226 Difference]: Without dead ends: 123 [2024-11-20 07:24:37,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-20 07:24:37,105 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:24:37,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:24:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-20 07:24:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-20 07:24:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 99 states have internal predecessors, (146), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 07:24:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2024-11-20 07:24:37,162 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 159 [2024-11-20 07:24:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:24:37,163 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2024-11-20 07:24:37,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 07:24:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2024-11-20 07:24:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 07:24:37,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:24:37,173 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:24:37,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:24:37,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:24:37,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:24:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1680904898, now seen corresponding path program 1 times [2024-11-20 07:24:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:24:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41064962] [2024-11-20 07:24:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:24:37,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:24:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:24:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:24:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:24:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:24:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:24:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:24:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:24:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:24:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:24:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 07:24:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:24:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 07:24:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:24:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 07:24:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:24:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 07:24:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 07:24:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 07:24:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 07:24:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:37,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 07:24:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:24:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 07:24:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 07:24:38,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:24:38,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41064962] [2024-11-20 07:24:38,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41064962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:24:38,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:24:38,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:24:38,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381585229] [2024-11-20 07:24:38,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:24:38,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:24:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:24:38,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:24:38,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:24:38,036 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 07:24:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:24:38,190 INFO L93 Difference]: Finished difference Result 363 states and 564 transitions. [2024-11-20 07:24:38,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:24:38,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2024-11-20 07:24:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:24:38,201 INFO L225 Difference]: With dead ends: 363 [2024-11-20 07:24:38,202 INFO L226 Difference]: Without dead ends: 243 [2024-11-20 07:24:38,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-20 07:24:38,207 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 134 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:24:38,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 410 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:24:38,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-20 07:24:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2024-11-20 07:24:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 194 states have (on average 1.4742268041237114) internal successors, (286), 194 states have internal predecessors, (286), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 07:24:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 374 transitions. [2024-11-20 07:24:38,266 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 374 transitions. Word has length 159 [2024-11-20 07:24:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:24:38,270 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 374 transitions. [2024-11-20 07:24:38,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 07:24:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 374 transitions. [2024-11-20 07:24:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 07:24:38,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:24:38,277 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:24:38,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:24:38,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:24:38,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:24:38,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1831185428, now seen corresponding path program 1 times [2024-11-20 07:24:38,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:24:38,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311222412] [2024-11-20 07:24:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:24:38,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:24:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:24:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:24:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:24:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:24:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:24:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:24:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:24:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:24:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:24:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 07:24:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:24:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 07:24:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:24:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 07:24:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:24:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 07:24:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 07:24:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 07:24:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 07:24:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 07:24:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:24:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 07:24:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 07:24:38,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:24:38,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311222412] [2024-11-20 07:24:38,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311222412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:24:38,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:24:38,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 07:24:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818689112] [2024-11-20 07:24:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:24:38,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 07:24:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:24:38,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 07:24:38,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:24:38,934 INFO L87 Difference]: Start difference. First operand 241 states and 374 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 07:24:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:24:39,386 INFO L93 Difference]: Finished difference Result 1039 states and 1595 transitions. [2024-11-20 07:24:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 07:24:39,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-20 07:24:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:24:39,393 INFO L225 Difference]: With dead ends: 1039 [2024-11-20 07:24:39,393 INFO L226 Difference]: Without dead ends: 801 [2024-11-20 07:24:39,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:24:39,397 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 594 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 07:24:39,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 719 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 07:24:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-20 07:24:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 493. [2024-11-20 07:24:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 400 states have (on average 1.49) internal successors, (596), 400 states have internal predecessors, (596), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-20 07:24:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 772 transitions. [2024-11-20 07:24:39,489 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 772 transitions. Word has length 160 [2024-11-20 07:24:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:24:39,492 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 772 transitions. [2024-11-20 07:24:39,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 07:24:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 772 transitions. [2024-11-20 07:24:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 07:24:39,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:24:39,497 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:24:39,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 07:24:39,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:24:39,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:24:39,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1965198934, now seen corresponding path program 1 times [2024-11-20 07:24:39,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:24:39,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213188769] [2024-11-20 07:24:39,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:24:39,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:24:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:24:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:24:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:24:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:24:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:24:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:24:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:24:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:24:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:24:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 07:24:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:24:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 07:24:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:24:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 07:24:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:24:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 07:24:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 07:24:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 07:24:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 07:24:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 07:24:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:24:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 07:24:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:24:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 07:24:40,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:24:40,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213188769] [2024-11-20 07:24:40,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213188769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:24:40,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:24:40,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 07:24:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681001441] [2024-11-20 07:24:40,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:24:40,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 07:24:40,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:24:40,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 07:24:40,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 07:24:40,304 INFO L87 Difference]: Start difference. First operand 493 states and 772 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 07:24:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:24:41,247 INFO L93 Difference]: Finished difference Result 1163 states and 1795 transitions. [2024-11-20 07:24:41,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 07:24:41,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-20 07:24:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:24:41,257 INFO L225 Difference]: With dead ends: 1163 [2024-11-20 07:24:41,257 INFO L226 Difference]: Without dead ends: 917 [2024-11-20 07:24:41,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-20 07:24:41,263 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1178 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 07:24:41,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 895 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 07:24:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-20 07:24:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 739. [2024-11-20 07:24:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 602 states have (on average 1.4900332225913622) internal successors, (897), 603 states have internal predecessors, (897), 130 states have call successors, (130), 6 states have call predecessors, (130), 6 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-20 07:24:41,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1157 transitions. [2024-11-20 07:24:41,344 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1157 transitions. Word has length 160 [2024-11-20 07:24:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:24:41,344 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1157 transitions. [2024-11-20 07:24:41,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 07:24:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1157 transitions. [2024-11-20 07:24:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 07:24:41,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:24:41,349 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:24:41,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 07:24:41,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:24:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:24:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1230100243, now seen corresponding path program 1 times [2024-11-20 07:24:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:24:41,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866230138] [2024-11-20 07:24:41,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:24:41,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:24:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:25:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:25:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:25:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:25:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:25:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:25:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:25:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:25:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:25:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 07:25:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:25:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 07:25:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:25:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 07:25:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:25:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 07:25:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 07:25:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 07:25:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 07:25:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 07:25:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:25:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 07:25:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 07:25:06,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:25:06,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866230138] [2024-11-20 07:25:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866230138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:25:06,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:25:06,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 07:25:06,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468884364] [2024-11-20 07:25:06,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:25:06,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:25:06,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:25:06,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:25:06,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:25:06,168 INFO L87 Difference]: Start difference. First operand 739 states and 1157 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 07:25:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:25:12,813 INFO L93 Difference]: Finished difference Result 2625 states and 4046 transitions. [2024-11-20 07:25:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 07:25:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-20 07:25:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:25:12,827 INFO L225 Difference]: With dead ends: 2625 [2024-11-20 07:25:12,827 INFO L226 Difference]: Without dead ends: 1889 [2024-11-20 07:25:12,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:25:12,831 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 478 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:25:12,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 717 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-20 07:25:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2024-11-20 07:25:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 949. [2024-11-20 07:25:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 812 states have (on average 1.5160098522167487) internal successors, (1231), 813 states have internal predecessors, (1231), 130 states have call successors, (130), 6 states have call predecessors, (130), 6 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-20 07:25:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1491 transitions. [2024-11-20 07:25:12,907 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1491 transitions. Word has length 160 [2024-11-20 07:25:12,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:25:12,908 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1491 transitions. [2024-11-20 07:25:12,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 07:25:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1491 transitions. [2024-11-20 07:25:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 07:25:12,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:25:12,911 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:25:12,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 07:25:12,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:25:12,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:25:12,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1011245525, now seen corresponding path program 1 times [2024-11-20 07:25:12,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:25:12,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579799079] [2024-11-20 07:25:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:12,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:25:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:25:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:25:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:25:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:25:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:25:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:25:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:25:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:25:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:25:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 07:25:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:25:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 07:25:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:25:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 07:25:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:25:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 07:25:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 07:25:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 07:25:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 07:25:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 07:25:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:25:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 07:25:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 07:25:17,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:25:17,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579799079] [2024-11-20 07:25:17,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579799079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:25:17,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:25:17,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 07:25:17,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701357259] [2024-11-20 07:25:17,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:25:17,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:25:17,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:25:17,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:25:17,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:25:17,738 INFO L87 Difference]: Start difference. First operand 949 states and 1491 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 07:25:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:25:20,577 INFO L93 Difference]: Finished difference Result 2628 states and 4080 transitions. [2024-11-20 07:25:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 07:25:20,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-20 07:25:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:25:20,587 INFO L225 Difference]: With dead ends: 2628 [2024-11-20 07:25:20,587 INFO L226 Difference]: Without dead ends: 1682 [2024-11-20 07:25:20,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 07:25:20,592 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 384 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:25:20,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 751 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 07:25:20,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2024-11-20 07:25:20,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 949. [2024-11-20 07:25:20,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 812 states have (on average 1.5160098522167487) internal successors, (1231), 813 states have internal predecessors, (1231), 130 states have call successors, (130), 6 states have call predecessors, (130), 6 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-20 07:25:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1491 transitions. [2024-11-20 07:25:20,655 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1491 transitions. Word has length 160 [2024-11-20 07:25:20,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:25:20,656 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1491 transitions. [2024-11-20 07:25:20,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 07:25:20,656 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1491 transitions. [2024-11-20 07:25:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 07:25:20,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:25:20,658 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:25:20,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 07:25:20,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:25:20,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:25:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1013499885, now seen corresponding path program 1 times [2024-11-20 07:25:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:25:20,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993424489] [2024-11-20 07:25:20,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:25:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat