./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:33:52,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:33:52,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:33:52,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:33:52,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:33:52,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:33:52,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:33:52,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:33:52,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:33:52,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:33:52,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:33:52,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:33:52,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:33:52,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:33:52,241 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:33:52,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:33:52,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:33:52,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:33:52,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:33:52,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:33:52,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:33:52,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:33:52,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:33:52,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:33:52,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:33:52,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:33:52,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:33:52,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:33:52,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:33:52,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:33:52,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:33:52,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:33:52,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:33:52,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:33:52,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:33:52,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:33:52,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:33:52,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:33:52,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:33:52,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:33:52,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:33:52,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:33:52,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:33:52,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:33:52,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:33:52,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:33:52,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:33:52,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:33:52,244 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 [2025-01-09 14:33:52,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:33:52,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:33:52,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:33:52,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:33:52,513 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:33:52,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2025-01-09 14:33:53,704 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5702e3db/c8a1efbda7684628a33b4a213b8012bd/FLAG23cd23021 [2025-01-09 14:33:53,911 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:33:53,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2025-01-09 14:33:53,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5702e3db/c8a1efbda7684628a33b4a213b8012bd/FLAG23cd23021 [2025-01-09 14:33:54,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5702e3db/c8a1efbda7684628a33b4a213b8012bd [2025-01-09 14:33:54,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:33:54,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:33:54,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:33:54,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:33:54,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:33:54,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f53711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54, skipping insertion in model container [2025-01-09 14:33:54,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:33:54,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2025-01-09 14:33:54,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:33:54,393 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:33:54,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2025-01-09 14:33:54,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:33:54,430 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:33:54,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54 WrapperNode [2025-01-09 14:33:54,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:33:54,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:33:54,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:33:54,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:33:54,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,482 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-01-09 14:33:54,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:33:54,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:33:54,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:33:54,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:33:54,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,511 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]. [2025-01-09 14:33:54,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:33:54,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:33:54,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:33:54,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:33:54,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (1/1) ... [2025-01-09 14:33:54,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:33:54,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:33:54,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:33:54,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:33:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:33:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:33:54,575 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:33:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:33:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:33:54,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:33:54,634 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:33:54,635 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:33:54,873 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-01-09 14:33:54,873 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:33:54,880 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:33:54,880 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:33:54,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:33:54 BoogieIcfgContainer [2025-01-09 14:33:54,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:33:54,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:33:54,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:33:54,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:33:54,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:33:54" (1/3) ... [2025-01-09 14:33:54,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f550b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:33:54, skipping insertion in model container [2025-01-09 14:33:54,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:54" (2/3) ... [2025-01-09 14:33:54,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f550b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:33:54, skipping insertion in model container [2025-01-09 14:33:54,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:33:54" (3/3) ... [2025-01-09 14:33:54,886 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-32.i [2025-01-09 14:33:54,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:33:54,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-32.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:33:54,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:33:54,944 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;@2cecb17e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:33:54,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:33:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 14:33:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 14:33:54,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:33:54,953 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:33:54,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:33:54,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:33:54,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1545768325, now seen corresponding path program 1 times [2025-01-09 14:33:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:33:54,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64078017] [2025-01-09 14:33:54,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:33:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:33:55,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 14:33:55,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 14:33:55,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:33:55,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:33:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 14:33:55,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:33:55,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64078017] [2025-01-09 14:33:55,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64078017] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:33:55,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143842567] [2025-01-09 14:33:55,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:33:55,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:33:55,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:33:55,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:33:55,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:33:55,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 14:33:55,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 14:33:55,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:33:55,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:33:55,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:33:55,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:33:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 14:33:55,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:33:55,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143842567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:33:55,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:33:55,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:33:55,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807066026] [2025-01-09 14:33:55,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:33:55,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:33:55,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:33:55,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:33:55,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:33:55,317 INFO L87 Difference]: Start difference. First operand has 78 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 14:33:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:33:55,340 INFO L93 Difference]: Finished difference Result 150 states and 245 transitions. [2025-01-09 14:33:55,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:33:55,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2025-01-09 14:33:55,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:33:55,345 INFO L225 Difference]: With dead ends: 150 [2025-01-09 14:33:55,345 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 14:33:55,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:33:55,349 INFO L435 NwaCegarLoop]: 112 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, 112 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 [2025-01-09 14:33:55,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:33:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 14:33:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-09 14:33:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 14:33:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2025-01-09 14:33:55,373 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 110 [2025-01-09 14:33:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:33:55,373 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2025-01-09 14:33:55,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 14:33:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2025-01-09 14:33:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 14:33:55,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:33:55,375 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:33:55,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:33:55,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:33:55,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:33:55,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:33:55,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2024182395, now seen corresponding path program 1 times [2025-01-09 14:33:55,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:33:55,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518025706] [2025-01-09 14:33:55,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:33:55,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:33:55,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 14:33:55,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 14:33:55,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:33:55,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:33:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:33:55,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:33:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518025706] [2025-01-09 14:33:55,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518025706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:33:55,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:33:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:33:55,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733146770] [2025-01-09 14:33:55,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:33:55,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:33:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:33:55,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:33:55,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:33:55,924 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:33:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:33:56,077 INFO L93 Difference]: Finished difference Result 255 states and 383 transitions. [2025-01-09 14:33:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:33:56,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2025-01-09 14:33:56,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:33:56,081 INFO L225 Difference]: With dead ends: 255 [2025-01-09 14:33:56,081 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 14:33:56,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:33:56,083 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 142 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:33:56,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 366 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:33:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 14:33:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2025-01-09 14:33:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 14:33:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 219 transitions. [2025-01-09 14:33:56,106 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 219 transitions. Word has length 110 [2025-01-09 14:33:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:33:56,107 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 219 transitions. [2025-01-09 14:33:56,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:33:56,107 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2025-01-09 14:33:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 14:33:56,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:33:56,109 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:33:56,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:33:56,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:33:56,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:33:56,110 INFO L85 PathProgramCache]: Analyzing trace with hash 682436999, now seen corresponding path program 1 times [2025-01-09 14:33:56,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:33:56,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155124196] [2025-01-09 14:33:56,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:33:56,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:33:56,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 14:33:56,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 14:33:56,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:33:56,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:33:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:33:56,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:33:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155124196] [2025-01-09 14:33:56,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155124196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:33:56,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:33:56,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:33:56,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066006367] [2025-01-09 14:33:56,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:33:56,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:33:56,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:33:56,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:33:56,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:33:56,269 INFO L87 Difference]: Start difference. First operand 145 states and 219 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:33:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:33:56,403 INFO L93 Difference]: Finished difference Result 406 states and 616 transitions. [2025-01-09 14:33:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:33:56,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2025-01-09 14:33:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:33:56,405 INFO L225 Difference]: With dead ends: 406 [2025-01-09 14:33:56,405 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 14:33:56,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:33:56,407 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 125 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:33:56,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 405 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:33:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 14:33:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 192. [2025-01-09 14:33:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 140 states have internal predecessors, (195), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:33:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2025-01-09 14:33:56,424 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 110 [2025-01-09 14:33:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:33:56,424 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2025-01-09 14:33:56,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:33:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2025-01-09 14:33:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 14:33:56,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:33:56,430 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:33:56,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:33:56,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:33:56,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:33:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1172298092, now seen corresponding path program 1 times [2025-01-09 14:33:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:33:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683128005] [2025-01-09 14:33:56,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:33:56,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:33:56,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 14:33:56,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 14:33:56,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:33:56,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:33:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:33:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:33:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683128005] [2025-01-09 14:33:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683128005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:33:56,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:33:56,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:33:56,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051476137] [2025-01-09 14:33:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:33:56,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:33:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:33:56,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:33:56,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:33:56,901 INFO L87 Difference]: Start difference. First operand 192 states and 291 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:33:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:33:57,210 INFO L93 Difference]: Finished difference Result 422 states and 633 transitions. [2025-01-09 14:33:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:33:57,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2025-01-09 14:33:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:33:57,213 INFO L225 Difference]: With dead ends: 422 [2025-01-09 14:33:57,213 INFO L226 Difference]: Without dead ends: 276 [2025-01-09 14:33:57,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:33:57,214 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 163 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:33:57,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 296 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:33:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-01-09 14:33:57,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 248. [2025-01-09 14:33:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 196 states have (on average 1.4234693877551021) internal successors, (279), 196 states have internal predecessors, (279), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:33:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 375 transitions. [2025-01-09 14:33:57,250 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 375 transitions. Word has length 111 [2025-01-09 14:33:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:33:57,250 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 375 transitions. [2025-01-09 14:33:57,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:33:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 375 transitions. [2025-01-09 14:33:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 14:33:57,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:33:57,252 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:33:57,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:33:57,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:33:57,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:33:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2013281218, now seen corresponding path program 1 times [2025-01-09 14:33:57,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:33:57,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330764305] [2025-01-09 14:33:57,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:33:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:33:57,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 14:33:57,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 14:33:57,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:33:57,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:33:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:33:57,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:33:57,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330764305] [2025-01-09 14:33:57,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330764305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:33:57,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:33:57,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:33:57,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042674881] [2025-01-09 14:33:57,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:33:57,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:33:57,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:33:57,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:33:57,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:33:57,552 INFO L87 Difference]: Start difference. First operand 248 states and 375 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:33:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:33:57,654 INFO L93 Difference]: Finished difference Result 503 states and 761 transitions. [2025-01-09 14:33:57,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:33:57,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2025-01-09 14:33:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:33:57,657 INFO L225 Difference]: With dead ends: 503 [2025-01-09 14:33:57,657 INFO L226 Difference]: Without dead ends: 314 [2025-01-09 14:33:57,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:33:57,659 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 98 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:33:57,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 307 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:33:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-01-09 14:33:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 266. [2025-01-09 14:33:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 214 states have (on average 1.4345794392523366) internal successors, (307), 214 states have internal predecessors, (307), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:33:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 403 transitions. [2025-01-09 14:33:57,686 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 403 transitions. Word has length 112 [2025-01-09 14:33:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:33:57,687 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 403 transitions. [2025-01-09 14:33:57,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:33:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 403 transitions. [2025-01-09 14:33:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 14:33:57,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:33:57,688 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:33:57,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:33:57,688 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:33:57,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:33:57,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1230892488, now seen corresponding path program 1 times [2025-01-09 14:33:57,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:33:57,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306625873] [2025-01-09 14:33:57,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:33:57,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:33:57,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 14:33:57,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 14:33:57,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:33:57,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:33:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:33:57,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:33:57,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306625873] [2025-01-09 14:33:57,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306625873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:33:57,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:33:57,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:33:57,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662609910] [2025-01-09 14:33:57,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:33:57,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:33:57,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:33:57,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:33:57,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:33:57,827 INFO L87 Difference]: Start difference. First operand 266 states and 403 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:33:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:33:57,948 INFO L93 Difference]: Finished difference Result 607 states and 919 transitions. [2025-01-09 14:33:57,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:33:57,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2025-01-09 14:33:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:33:57,951 INFO L225 Difference]: With dead ends: 607 [2025-01-09 14:33:57,951 INFO L226 Difference]: Without dead ends: 400 [2025-01-09 14:33:57,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:33:57,953 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 108 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:33:57,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 401 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:33:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-09 14:33:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 322. [2025-01-09 14:33:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 270 states have (on average 1.4481481481481482) internal successors, (391), 270 states have internal predecessors, (391), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:33:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 487 transitions. [2025-01-09 14:33:57,974 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 487 transitions. Word has length 115 [2025-01-09 14:33:57,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:33:57,975 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 487 transitions. [2025-01-09 14:33:57,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:33:57,975 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 487 transitions. [2025-01-09 14:33:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 14:33:57,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:33:57,976 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:33:57,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:33:57,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:33:57,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:33:57,977 INFO L85 PathProgramCache]: Analyzing trace with hash -37899922, now seen corresponding path program 1 times [2025-01-09 14:33:57,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:33:57,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274814488] [2025-01-09 14:33:57,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:33:57,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:33:57,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 14:33:58,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 14:33:58,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:33:58,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:33:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:33:59,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:33:59,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274814488] [2025-01-09 14:33:59,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274814488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:33:59,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:33:59,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:33:59,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558491992] [2025-01-09 14:33:59,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:33:59,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:33:59,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:33:59,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:33:59,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:33:59,093 INFO L87 Difference]: Start difference. First operand 322 states and 487 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:00,295 INFO L93 Difference]: Finished difference Result 720 states and 1090 transitions. [2025-01-09 14:34:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:34:00,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-01-09 14:34:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:00,297 INFO L225 Difference]: With dead ends: 720 [2025-01-09 14:34:00,297 INFO L226 Difference]: Without dead ends: 513 [2025-01-09 14:34:00,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:34:00,299 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 53 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:00,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 612 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:34:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-01-09 14:34:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 421. [2025-01-09 14:34:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 369 states have (on average 1.4715447154471544) internal successors, (543), 369 states have internal predecessors, (543), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:34:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 639 transitions. [2025-01-09 14:34:00,315 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 639 transitions. Word has length 116 [2025-01-09 14:34:00,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:00,315 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 639 transitions. [2025-01-09 14:34:00,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:00,316 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 639 transitions. [2025-01-09 14:34:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 14:34:00,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:00,317 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:00,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:34:00,317 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:00,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash 412322576, now seen corresponding path program 1 times [2025-01-09 14:34:00,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:00,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952013142] [2025-01-09 14:34:00,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:00,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:00,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 14:34:00,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 14:34:00,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:00,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:00,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952013142] [2025-01-09 14:34:00,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952013142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:00,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:34:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641275096] [2025-01-09 14:34:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:00,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:34:00,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:00,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:34:00,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:34:00,374 INFO L87 Difference]: Start difference. First operand 421 states and 639 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:00,408 INFO L93 Difference]: Finished difference Result 810 states and 1227 transitions. [2025-01-09 14:34:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:34:00,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-01-09 14:34:00,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:00,411 INFO L225 Difference]: With dead ends: 810 [2025-01-09 14:34:00,411 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 14:34:00,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:34:00,412 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 41 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:00,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 207 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:34:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 14:34:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 474. [2025-01-09 14:34:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 422 states have (on average 1.438388625592417) internal successors, (607), 422 states have internal predecessors, (607), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:34:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 703 transitions. [2025-01-09 14:34:00,439 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 703 transitions. Word has length 116 [2025-01-09 14:34:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:00,439 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 703 transitions. [2025-01-09 14:34:00,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 703 transitions. [2025-01-09 14:34:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 14:34:00,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:00,440 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:00,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:34:00,441 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:00,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:00,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1049017172, now seen corresponding path program 1 times [2025-01-09 14:34:00,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:00,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240549374] [2025-01-09 14:34:00,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:00,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:00,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 14:34:00,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 14:34:00,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:00,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:01,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:01,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240549374] [2025-01-09 14:34:01,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240549374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:01,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:01,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:34:01,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069505845] [2025-01-09 14:34:01,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:01,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:34:01,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:01,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:34:01,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:34:01,320 INFO L87 Difference]: Start difference. First operand 474 states and 703 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:02,790 INFO L93 Difference]: Finished difference Result 889 states and 1306 transitions. [2025-01-09 14:34:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:34:02,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-01-09 14:34:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:02,793 INFO L225 Difference]: With dead ends: 889 [2025-01-09 14:34:02,793 INFO L226 Difference]: Without dead ends: 586 [2025-01-09 14:34:02,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:34:02,794 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 42 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:02,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 801 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:34:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-01-09 14:34:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 474. [2025-01-09 14:34:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 422 states have (on average 1.438388625592417) internal successors, (607), 422 states have internal predecessors, (607), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:34:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 703 transitions. [2025-01-09 14:34:02,811 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 703 transitions. Word has length 116 [2025-01-09 14:34:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:02,811 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 703 transitions. [2025-01-09 14:34:02,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 703 transitions. [2025-01-09 14:34:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 14:34:02,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:02,813 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:02,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:34:02,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:02,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1798300276, now seen corresponding path program 1 times [2025-01-09 14:34:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:02,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61992834] [2025-01-09 14:34:02,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:02,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 14:34:02,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 14:34:02,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:02,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:02,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:02,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61992834] [2025-01-09 14:34:02,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61992834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:02,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:02,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:34:02,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285031643] [2025-01-09 14:34:02,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:02,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:34:02,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:02,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:34:02,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:34:02,861 INFO L87 Difference]: Start difference. First operand 474 states and 703 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:02,890 INFO L93 Difference]: Finished difference Result 851 states and 1263 transitions. [2025-01-09 14:34:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:34:02,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-01-09 14:34:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:02,892 INFO L225 Difference]: With dead ends: 851 [2025-01-09 14:34:02,892 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 14:34:02,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:34:02,893 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 41 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:02,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 241 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:34:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 14:34:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 430. [2025-01-09 14:34:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 378 states have (on average 1.4153439153439153) internal successors, (535), 378 states have internal predecessors, (535), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:34:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 631 transitions. [2025-01-09 14:34:02,910 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 631 transitions. Word has length 116 [2025-01-09 14:34:02,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:02,910 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 631 transitions. [2025-01-09 14:34:02,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 631 transitions. [2025-01-09 14:34:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 14:34:02,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:02,911 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:02,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:34:02,912 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:02,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:02,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1348077778, now seen corresponding path program 1 times [2025-01-09 14:34:02,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:02,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651667357] [2025-01-09 14:34:02,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:02,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:02,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 14:34:02,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 14:34:02,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:02,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:02,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651667357] [2025-01-09 14:34:02,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651667357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:02,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:02,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:34:02,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589211833] [2025-01-09 14:34:02,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:02,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:34:02,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:02,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:34:02,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:34:02,993 INFO L87 Difference]: Start difference. First operand 430 states and 631 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:03,022 INFO L93 Difference]: Finished difference Result 823 states and 1216 transitions. [2025-01-09 14:34:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:34:03,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-01-09 14:34:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:03,024 INFO L225 Difference]: With dead ends: 823 [2025-01-09 14:34:03,025 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 14:34:03,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:34:03,025 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:03,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 204 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:34:03,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 14:34:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2025-01-09 14:34:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 449 states have (on average 1.398663697104677) internal successors, (628), 449 states have internal predecessors, (628), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 14:34:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 756 transitions. [2025-01-09 14:34:03,042 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 756 transitions. Word has length 116 [2025-01-09 14:34:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:03,043 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 756 transitions. [2025-01-09 14:34:03,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 756 transitions. [2025-01-09 14:34:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 14:34:03,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:03,044 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:03,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:34:03,044 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:03,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash -591641885, now seen corresponding path program 1 times [2025-01-09 14:34:03,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:03,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089640939] [2025-01-09 14:34:03,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:03,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:03,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 14:34:03,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 14:34:03,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:03,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:03,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:03,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089640939] [2025-01-09 14:34:03,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089640939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:03,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:03,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:34:03,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586318750] [2025-01-09 14:34:03,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:03,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:34:03,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:03,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:34:03,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:34:03,189 INFO L87 Difference]: Start difference. First operand 518 states and 756 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:03,438 INFO L93 Difference]: Finished difference Result 1089 states and 1578 transitions. [2025-01-09 14:34:03,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:34:03,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2025-01-09 14:34:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:03,442 INFO L225 Difference]: With dead ends: 1089 [2025-01-09 14:34:03,442 INFO L226 Difference]: Without dead ends: 698 [2025-01-09 14:34:03,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:34:03,443 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 172 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:03,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 613 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:34:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-01-09 14:34:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 554. [2025-01-09 14:34:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 485 states have (on average 1.3938144329896907) internal successors, (676), 485 states have internal predecessors, (676), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 14:34:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 804 transitions. [2025-01-09 14:34:03,463 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 804 transitions. Word has length 117 [2025-01-09 14:34:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:03,463 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 804 transitions. [2025-01-09 14:34:03,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 804 transitions. [2025-01-09 14:34:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 14:34:03,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:03,464 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:03,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:34:03,464 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:03,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash 725156864, now seen corresponding path program 1 times [2025-01-09 14:34:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:03,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417931698] [2025-01-09 14:34:03,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:03,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 14:34:03,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 14:34:03,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:03,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:03,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:03,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417931698] [2025-01-09 14:34:03,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417931698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:03,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:03,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:34:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30321151] [2025-01-09 14:34:03,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:03,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:34:03,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:03,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:34:03,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:34:03,581 INFO L87 Difference]: Start difference. First operand 554 states and 804 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:03,801 INFO L93 Difference]: Finished difference Result 1147 states and 1662 transitions. [2025-01-09 14:34:03,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:34:03,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2025-01-09 14:34:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:03,805 INFO L225 Difference]: With dead ends: 1147 [2025-01-09 14:34:03,805 INFO L226 Difference]: Without dead ends: 756 [2025-01-09 14:34:03,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:34:03,807 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 174 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:03,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 919 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:34:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-01-09 14:34:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 674. [2025-01-09 14:34:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 587 states have (on average 1.3798977853492334) internal successors, (810), 589 states have internal predecessors, (810), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 14:34:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 970 transitions. [2025-01-09 14:34:03,834 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 970 transitions. Word has length 117 [2025-01-09 14:34:03,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:03,835 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 970 transitions. [2025-01-09 14:34:03,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 970 transitions. [2025-01-09 14:34:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 14:34:03,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:03,836 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:03,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:34:03,836 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:03,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash -719232471, now seen corresponding path program 1 times [2025-01-09 14:34:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:03,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048729574] [2025-01-09 14:34:03,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:03,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:03,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 14:34:03,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 14:34:03,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:03,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:04,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:04,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048729574] [2025-01-09 14:34:04,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048729574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:04,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:04,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:34:04,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752068670] [2025-01-09 14:34:04,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:04,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:34:04,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:04,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:34:04,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:34:04,104 INFO L87 Difference]: Start difference. First operand 674 states and 970 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:04,265 INFO L93 Difference]: Finished difference Result 890 states and 1269 transitions. [2025-01-09 14:34:04,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:34:04,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-01-09 14:34:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:04,270 INFO L225 Difference]: With dead ends: 890 [2025-01-09 14:34:04,270 INFO L226 Difference]: Without dead ends: 888 [2025-01-09 14:34:04,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:34:04,271 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 65 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:04,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 742 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:34:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-01-09 14:34:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 884. [2025-01-09 14:34:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 762 states have (on average 1.3622047244094488) internal successors, (1038), 767 states have internal predecessors, (1038), 112 states have call successors, (112), 9 states have call predecessors, (112), 9 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 14:34:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1262 transitions. [2025-01-09 14:34:04,310 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1262 transitions. Word has length 118 [2025-01-09 14:34:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:04,310 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1262 transitions. [2025-01-09 14:34:04,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1262 transitions. [2025-01-09 14:34:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 14:34:04,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:04,311 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:04,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:34:04,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:04,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash -992896602, now seen corresponding path program 1 times [2025-01-09 14:34:04,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:04,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645937921] [2025-01-09 14:34:04,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:04,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 14:34:04,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 14:34:04,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:04,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:04,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645937921] [2025-01-09 14:34:04,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645937921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:04,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:04,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:34:04,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959854017] [2025-01-09 14:34:04,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:04,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:34:04,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:04,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:34:04,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:34:04,364 INFO L87 Difference]: Start difference. First operand 884 states and 1262 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:04,420 INFO L93 Difference]: Finished difference Result 1961 states and 2788 transitions. [2025-01-09 14:34:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:34:04,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-01-09 14:34:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:04,427 INFO L225 Difference]: With dead ends: 1961 [2025-01-09 14:34:04,427 INFO L226 Difference]: Without dead ends: 1290 [2025-01-09 14:34:04,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:34:04,429 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 52 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:04,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 205 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:34:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-01-09 14:34:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1283. [2025-01-09 14:34:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1132 states have (on average 1.3462897526501767) internal successors, (1524), 1142 states have internal predecessors, (1524), 132 states have call successors, (132), 18 states have call predecessors, (132), 18 states have return successors, (132), 122 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 14:34:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1788 transitions. [2025-01-09 14:34:04,493 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1788 transitions. Word has length 118 [2025-01-09 14:34:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:04,493 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1788 transitions. [2025-01-09 14:34:04,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1788 transitions. [2025-01-09 14:34:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 14:34:04,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:04,496 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:04,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:34:04,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:04,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:04,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1588282001, now seen corresponding path program 1 times [2025-01-09 14:34:04,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:04,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532319910] [2025-01-09 14:34:04,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:04,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:04,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 14:34:04,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 14:34:04,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:04,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:04,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:04,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532319910] [2025-01-09 14:34:04,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532319910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:04,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:04,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:34:04,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976332700] [2025-01-09 14:34:04,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:04,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:34:04,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:04,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:34:04,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:34:04,977 INFO L87 Difference]: Start difference. First operand 1283 states and 1788 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:05,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:05,809 INFO L93 Difference]: Finished difference Result 2897 states and 4003 transitions. [2025-01-09 14:34:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:34:05,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-01-09 14:34:05,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:05,816 INFO L225 Difference]: With dead ends: 2897 [2025-01-09 14:34:05,816 INFO L226 Difference]: Without dead ends: 1935 [2025-01-09 14:34:05,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:34:05,818 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 40 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:05,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 638 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:34:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2025-01-09 14:34:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1920. [2025-01-09 14:34:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1730 states have (on average 1.3184971098265896) internal successors, (2281), 1753 states have internal predecessors, (2281), 158 states have call successors, (158), 31 states have call predecessors, (158), 31 states have return successors, (158), 135 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 14:34:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2597 transitions. [2025-01-09 14:34:05,912 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2597 transitions. Word has length 118 [2025-01-09 14:34:05,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:05,912 INFO L471 AbstractCegarLoop]: Abstraction has 1920 states and 2597 transitions. [2025-01-09 14:34:05,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2597 transitions. [2025-01-09 14:34:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 14:34:05,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:05,914 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:05,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:34:05,914 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:05,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 308418323, now seen corresponding path program 1 times [2025-01-09 14:34:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:05,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141099488] [2025-01-09 14:34:05,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:05,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:05,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 14:34:05,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 14:34:05,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:05,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141099488] [2025-01-09 14:34:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141099488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:06,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:06,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:34:06,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113600538] [2025-01-09 14:34:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:06,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:34:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:06,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:34:06,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:34:06,497 INFO L87 Difference]: Start difference. First operand 1920 states and 2597 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:07,576 INFO L93 Difference]: Finished difference Result 3996 states and 5433 transitions. [2025-01-09 14:34:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:34:07,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-01-09 14:34:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:07,586 INFO L225 Difference]: With dead ends: 3996 [2025-01-09 14:34:07,587 INFO L226 Difference]: Without dead ends: 2562 [2025-01-09 14:34:07,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:34:07,590 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 65 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:07,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 762 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:34:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2025-01-09 14:34:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2306. [2025-01-09 14:34:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2089 states have (on average 1.3097175682144566) internal successors, (2736), 2113 states have internal predecessors, (2736), 180 states have call successors, (180), 36 states have call predecessors, (180), 36 states have return successors, (180), 156 states have call predecessors, (180), 180 states have call successors, (180) [2025-01-09 14:34:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3096 transitions. [2025-01-09 14:34:07,734 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3096 transitions. Word has length 118 [2025-01-09 14:34:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:07,735 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 3096 transitions. [2025-01-09 14:34:07,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3096 transitions. [2025-01-09 14:34:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 14:34:07,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:07,737 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:07,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:34:07,737 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:07,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:07,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1162198415, now seen corresponding path program 1 times [2025-01-09 14:34:07,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:07,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470810903] [2025-01-09 14:34:07,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:07,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:07,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 14:34:07,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 14:34:07,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:07,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:07,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:07,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470810903] [2025-01-09 14:34:07,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470810903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:07,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:07,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:34:07,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538638965] [2025-01-09 14:34:07,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:07,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:34:07,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:07,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:34:07,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:34:07,855 INFO L87 Difference]: Start difference. First operand 2306 states and 3096 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:08,126 INFO L93 Difference]: Finished difference Result 4564 states and 6174 transitions. [2025-01-09 14:34:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:34:08,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-01-09 14:34:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:08,140 INFO L225 Difference]: With dead ends: 4564 [2025-01-09 14:34:08,141 INFO L226 Difference]: Without dead ends: 2885 [2025-01-09 14:34:08,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:34:08,144 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 62 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:08,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 472 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:34:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2025-01-09 14:34:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2743. [2025-01-09 14:34:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2743 states, 2480 states have (on average 1.303225806451613) internal successors, (3232), 2513 states have internal predecessors, (3232), 214 states have call successors, (214), 48 states have call predecessors, (214), 48 states have return successors, (214), 181 states have call predecessors, (214), 214 states have call successors, (214) [2025-01-09 14:34:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 3660 transitions. [2025-01-09 14:34:08,302 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 3660 transitions. Word has length 118 [2025-01-09 14:34:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:08,303 INFO L471 AbstractCegarLoop]: Abstraction has 2743 states and 3660 transitions. [2025-01-09 14:34:08,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 3660 transitions. [2025-01-09 14:34:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 14:34:08,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:08,305 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:08,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:34:08,305 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:08,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1667894777, now seen corresponding path program 1 times [2025-01-09 14:34:08,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049186720] [2025-01-09 14:34:08,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:08,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 14:34:08,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 14:34:08,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:08,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:08,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:08,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049186720] [2025-01-09 14:34:08,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049186720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:08,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:08,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:34:08,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78324713] [2025-01-09 14:34:08,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:08,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:34:08,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:08,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:34:08,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:34:08,350 INFO L87 Difference]: Start difference. First operand 2743 states and 3660 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:08,530 INFO L93 Difference]: Finished difference Result 4742 states and 6356 transitions. [2025-01-09 14:34:08,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:34:08,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2025-01-09 14:34:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:08,540 INFO L225 Difference]: With dead ends: 4742 [2025-01-09 14:34:08,540 INFO L226 Difference]: Without dead ends: 2481 [2025-01-09 14:34:08,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:34:08,545 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 51 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:08,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 261 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:34:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-01-09 14:34:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2272. [2025-01-09 14:34:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2048 states have (on average 1.26953125) internal successors, (2600), 2070 states have internal predecessors, (2600), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2025-01-09 14:34:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2960 transitions. [2025-01-09 14:34:08,699 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2960 transitions. Word has length 118 [2025-01-09 14:34:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:08,699 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 2960 transitions. [2025-01-09 14:34:08,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2960 transitions. [2025-01-09 14:34:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 14:34:08,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:08,702 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:08,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 14:34:08,702 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:08,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:08,703 INFO L85 PathProgramCache]: Analyzing trace with hash -786146115, now seen corresponding path program 1 times [2025-01-09 14:34:08,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:08,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173699681] [2025-01-09 14:34:08,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:08,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:08,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:34:08,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:34:08,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:08,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:08,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:08,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173699681] [2025-01-09 14:34:08,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173699681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:08,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:08,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:34:08,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746491019] [2025-01-09 14:34:08,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:08,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:34:08,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:08,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:34:08,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:34:08,966 INFO L87 Difference]: Start difference. First operand 2272 states and 2960 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:09,329 INFO L93 Difference]: Finished difference Result 4477 states and 5872 transitions. [2025-01-09 14:34:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:34:09,330 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-01-09 14:34:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:09,341 INFO L225 Difference]: With dead ends: 4477 [2025-01-09 14:34:09,341 INFO L226 Difference]: Without dead ends: 2591 [2025-01-09 14:34:09,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:34:09,346 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 137 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:09,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 755 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:34:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-01-09 14:34:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2259. [2025-01-09 14:34:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2259 states, 2035 states have (on average 1.2658476658476658) internal successors, (2576), 2057 states have internal predecessors, (2576), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2025-01-09 14:34:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 2936 transitions. [2025-01-09 14:34:09,467 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 2936 transitions. Word has length 119 [2025-01-09 14:34:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:09,468 INFO L471 AbstractCegarLoop]: Abstraction has 2259 states and 2936 transitions. [2025-01-09 14:34:09,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 2936 transitions. [2025-01-09 14:34:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 14:34:09,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:09,470 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:09,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 14:34:09,470 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:09,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1085156800, now seen corresponding path program 1 times [2025-01-09 14:34:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:09,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214572002] [2025-01-09 14:34:09,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:09,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:09,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:34:09,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:34:09,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:09,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:09,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:09,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214572002] [2025-01-09 14:34:09,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214572002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:09,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:09,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:34:09,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770864615] [2025-01-09 14:34:09,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:09,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:34:09,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:09,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:34:09,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:34:09,856 INFO L87 Difference]: Start difference. First operand 2259 states and 2936 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:10,396 INFO L93 Difference]: Finished difference Result 4427 states and 5800 transitions. [2025-01-09 14:34:10,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:34:10,397 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-01-09 14:34:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:10,406 INFO L225 Difference]: With dead ends: 4427 [2025-01-09 14:34:10,407 INFO L226 Difference]: Without dead ends: 2637 [2025-01-09 14:34:10,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:34:10,411 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 187 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:10,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 697 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:34:10,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2025-01-09 14:34:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2269. [2025-01-09 14:34:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2269 states, 2045 states have (on average 1.2645476772616138) internal successors, (2586), 2067 states have internal predecessors, (2586), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2025-01-09 14:34:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 2269 states and 2946 transitions. [2025-01-09 14:34:10,568 INFO L78 Accepts]: Start accepts. Automaton has 2269 states and 2946 transitions. Word has length 119 [2025-01-09 14:34:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:10,568 INFO L471 AbstractCegarLoop]: Abstraction has 2269 states and 2946 transitions. [2025-01-09 14:34:10,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 2946 transitions. [2025-01-09 14:34:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 14:34:10,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:10,570 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:10,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 14:34:10,570 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:10,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash 333263184, now seen corresponding path program 1 times [2025-01-09 14:34:10,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:10,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989261350] [2025-01-09 14:34:10,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:10,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:34:10,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:34:10,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:10,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 14:34:10,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:10,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989261350] [2025-01-09 14:34:10,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989261350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:34:10,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805442553] [2025-01-09 14:34:10,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:10,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:34:10,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:34:10,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:34:10,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:34:10,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:34:10,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:34:10,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:10,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:10,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 14:34:10,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:34:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 194 proven. 9 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-01-09 14:34:10,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:34:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 12 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-01-09 14:34:11,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805442553] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:34:11,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:34:11,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2025-01-09 14:34:11,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399293317] [2025-01-09 14:34:11,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:34:11,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:34:11,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:11,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:34:11,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:34:11,022 INFO L87 Difference]: Start difference. First operand 2269 states and 2946 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 14:34:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:11,331 INFO L93 Difference]: Finished difference Result 4609 states and 5940 transitions. [2025-01-09 14:34:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:34:11,332 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 119 [2025-01-09 14:34:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:11,339 INFO L225 Difference]: With dead ends: 4609 [2025-01-09 14:34:11,339 INFO L226 Difference]: Without dead ends: 2385 [2025-01-09 14:34:11,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:34:11,344 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 85 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:11,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 202 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:34:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2025-01-09 14:34:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2301. [2025-01-09 14:34:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2069 states have (on average 1.24939584340261) internal successors, (2585), 2091 states have internal predecessors, (2585), 180 states have call successors, (180), 51 states have call predecessors, (180), 51 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2025-01-09 14:34:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 2945 transitions. [2025-01-09 14:34:11,559 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 2945 transitions. Word has length 119 [2025-01-09 14:34:11,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:11,560 INFO L471 AbstractCegarLoop]: Abstraction has 2301 states and 2945 transitions. [2025-01-09 14:34:11,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 14:34:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2945 transitions. [2025-01-09 14:34:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 14:34:11,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:11,562 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:11,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:34:11,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:34:11,763 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:11,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1586041513, now seen corresponding path program 1 times [2025-01-09 14:34:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:11,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828352714] [2025-01-09 14:34:11,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:11,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 14:34:11,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 14:34:11,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:11,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:34:11,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001846438] [2025-01-09 14:34:11,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:11,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:34:11,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:34:11,794 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:34:11,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:34:11,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 14:34:11,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 14:34:11,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:11,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:34:11,887 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:34:11,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 14:34:11,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 14:34:11,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:11,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:34:11,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:34:11,952 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:34:11,953 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:34:11,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:34:12,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:34:12,158 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:12,203 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:34:12,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:34:12 BoogieIcfgContainer [2025-01-09 14:34:12,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:34:12,208 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:34:12,209 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:34:12,209 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:34:12,209 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:33:54" (3/4) ... [2025-01-09 14:34:12,210 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:34:12,211 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:34:12,211 INFO L158 Benchmark]: Toolchain (without parser) took 17961.92ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 105.9MB in the beginning and 459.4MB in the end (delta: -353.5MB). Peak memory consumption was 200.5MB. Max. memory is 16.1GB. [2025-01-09 14:34:12,211 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:34:12,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.00ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 92.6MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:34:12,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.62ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 88.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:34:12,212 INFO L158 Benchmark]: Boogie Preprocessor took 45.71ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 84.3MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:34:12,212 INFO L158 Benchmark]: RCFGBuilder took 349.67ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 60.7MB in the end (delta: 23.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:34:12,212 INFO L158 Benchmark]: TraceAbstraction took 17323.90ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 60.1MB in the beginning and 459.4MB in the end (delta: -399.3MB). Peak memory consumption was 158.5MB. Max. memory is 16.1GB. [2025-01-09 14:34:12,212 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 696.3MB. Free memory is still 459.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:34:12,214 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.00ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 92.6MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.62ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 88.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.71ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 84.3MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 349.67ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 60.7MB in the end (delta: 23.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17323.90ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 60.1MB in the beginning and 459.4MB in the end (delta: -399.3MB). Peak memory consumption was 158.5MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 696.3MB. Free memory is still 459.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 90, overapproximation of shiftLeft at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_3 = 128; [L24] unsigned short int var_1_4 = 4; [L25] unsigned short int var_1_5 = 0; [L26] signed short int var_1_6 = 0; [L27] unsigned char var_1_7 = 1; [L28] signed short int var_1_8 = -2; [L29] signed short int var_1_9 = 500; [L30] unsigned long int var_1_10 = 10; [L31] unsigned char var_1_11 = 2; [L32] unsigned char var_1_12 = 64; [L33] unsigned long int var_1_13 = 1; [L34] unsigned long int last_1_var_1_10 = 10; [L35] unsigned long int last_1_var_1_13 = 1; VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L94] isInitial = 1 [L95] FCALL initially() [L97] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L97] RET updateLastVariables() [L98] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L63] var_1_4 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L64] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L66] var_1_5 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L69] var_1_7 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L71] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L71] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L73] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L76] RET assume_abort_if_not(var_1_9 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L80] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L83] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L98] RET updateVariables() [L99] CALL step() [L39] COND FALSE !(last_1_var_1_13 >= -50) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L42] EXPR var_1_11 & var_1_12 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L42] signed long int stepLocal_0 = var_1_11 & var_1_12; [L43] COND TRUE \read(var_1_7) [L44] var_1_13 = ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L50] COND TRUE \read(var_1_7) [L51] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=10, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] COND TRUE (var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5)) [L54] var_1_10 = ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=0, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90-L91] return ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=-255, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 23, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1988 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1975 mSDsluCounter, 10218 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7567 mSDsCounter, 394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2581 IncrementalHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 394 mSolverCounterUnsat, 2651 mSDtfsCounter, 2581 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 400 SyntacticMatches, 2 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2743occurred in iteration=18, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 2281 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 3016 NumberOfCodeBlocks, 3016 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2870 ConstructedInterpolants, 0 QuantifiedInterpolants, 10580 SizeOfPredicates, 1 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 11940/12000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 14:34:12,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:34:14,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:34:14,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:34:14,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:34:14,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:34:14,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:34:14,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:34:14,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:34:14,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:34:14,157 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:34:14,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:34:14,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:34:14,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:34:14,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:34:14,158 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:34:14,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:34:14,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:34:14,158 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:34:14,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:34:14,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:34:14,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:34:14,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:34:14,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:34:14,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:34:14,159 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:34:14,159 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:34:14,159 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:34:14,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:34:14,159 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:34:14,159 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:34:14,159 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:34:14,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:34:14,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:34:14,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:34:14,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:34:14,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:34:14,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:34:14,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:34:14,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:34:14,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:34:14,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:34:14,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:34:14,160 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:34:14,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:34:14,160 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:34:14,160 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:34:14,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:34:14,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:34:14,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:34:14,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:34:14,161 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 736d11fbaff9bd8217e7f35fe2915a40a2ccc3f0b056dd854b0369e62e08ee86 [2025-01-09 14:34:14,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:34:14,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:34:14,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:34:14,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:34:14,378 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:34:14,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2025-01-09 14:34:15,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaa845cdf/f60d6485cba84f56ac48825019ae2834/FLAG9c251494f [2025-01-09 14:34:15,774 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:34:15,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i [2025-01-09 14:34:15,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaa845cdf/f60d6485cba84f56ac48825019ae2834/FLAG9c251494f [2025-01-09 14:34:15,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaa845cdf/f60d6485cba84f56ac48825019ae2834 [2025-01-09 14:34:15,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:34:15,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:34:15,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:34:15,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:34:15,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:34:15,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:34:15" (1/1) ... [2025-01-09 14:34:15,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226c2f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:15, skipping insertion in model container [2025-01-09 14:34:15,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:34:15" (1/1) ... [2025-01-09 14:34:15,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:34:15,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2025-01-09 14:34:15,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:34:15,980 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:34:15,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-32.i[915,928] [2025-01-09 14:34:16,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:34:16,014 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:34:16,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16 WrapperNode [2025-01-09 14:34:16,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:34:16,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:34:16,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:34:16,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:34:16,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,052 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2025-01-09 14:34:16,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:34:16,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:34:16,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:34:16,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:34:16,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,072 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]. [2025-01-09 14:34:16,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:34:16,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:34:16,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:34:16,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:34:16,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (1/1) ... [2025-01-09 14:34:16,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:34:16,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:34:16,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:34:16,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:34:16,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:34:16,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:34:16,135 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:34:16,135 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:34:16,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:34:16,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:34:16,190 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:34:16,192 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:34:16,401 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 14:34:16,401 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:34:16,411 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:34:16,411 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:34:16,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:34:16 BoogieIcfgContainer [2025-01-09 14:34:16,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:34:16,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:34:16,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:34:16,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:34:16,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:34:15" (1/3) ... [2025-01-09 14:34:16,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cf4ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:34:16, skipping insertion in model container [2025-01-09 14:34:16,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:16" (2/3) ... [2025-01-09 14:34:16,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cf4ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:34:16, skipping insertion in model container [2025-01-09 14:34:16,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:34:16" (3/3) ... [2025-01-09 14:34:16,420 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-32.i [2025-01-09 14:34:16,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:34:16,432 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-32.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:34:16,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:34:16,485 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;@1990dcfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:34:16,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:34:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 14:34:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 14:34:16,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:16,497 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:16,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:16,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:16,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2015384805, now seen corresponding path program 1 times [2025-01-09 14:34:16,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:34:16,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147944931] [2025-01-09 14:34:16,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:16,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:34:16,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:34:16,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:34:16,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:34:16,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:34:16,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:34:16,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:16,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:16,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:34:16,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:34:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 14:34:16,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:34:16,707 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:34:16,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147944931] [2025-01-09 14:34:16,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147944931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:16,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:16,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:34:16,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250771790] [2025-01-09 14:34:16,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:16,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:34:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:34:16,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:34:16,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:34:16,729 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 14:34:16,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:16,743 INFO L93 Difference]: Finished difference Result 90 states and 151 transitions. [2025-01-09 14:34:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:34:16,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2025-01-09 14:34:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:16,748 INFO L225 Difference]: With dead ends: 90 [2025-01-09 14:34:16,748 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 14:34:16,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:34:16,752 INFO L435 NwaCegarLoop]: 65 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, 65 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 [2025-01-09 14:34:16,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:34:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 14:34:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 14:34:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 14:34:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2025-01-09 14:34:16,798 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 102 [2025-01-09 14:34:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:16,798 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2025-01-09 14:34:16,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 14:34:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2025-01-09 14:34:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 14:34:16,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:16,801 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:16,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:34:17,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:34:17,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:17,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash 943142117, now seen corresponding path program 1 times [2025-01-09 14:34:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:34:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1458807466] [2025-01-09 14:34:17,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:17,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:34:17,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:34:17,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:34:17,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:34:17,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:34:17,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:34:17,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:17,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:17,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 14:34:17,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:34:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 14:34:17,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:34:17,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:34:17,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458807466] [2025-01-09 14:34:17,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458807466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:17,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:17,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:34:17,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061870853] [2025-01-09 14:34:17,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:17,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:34:17,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:34:17,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:34:17,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:34:17,335 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:17,454 INFO L93 Difference]: Finished difference Result 138 states and 200 transitions. [2025-01-09 14:34:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:34:17,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2025-01-09 14:34:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:17,458 INFO L225 Difference]: With dead ends: 138 [2025-01-09 14:34:17,458 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 14:34:17,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:34:17,460 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 45 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:17,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 187 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:34:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 14:34:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2025-01-09 14:34:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 14:34:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2025-01-09 14:34:17,478 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 102 [2025-01-09 14:34:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:17,480 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2025-01-09 14:34:17,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 14:34:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2025-01-09 14:34:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 14:34:17,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:17,482 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:17,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:34:17,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:34:17,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:17,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:17,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1623200487, now seen corresponding path program 1 times [2025-01-09 14:34:17,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:34:17,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [655483547] [2025-01-09 14:34:17,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:17,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:34:17,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:34:17,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:34:17,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:34:17,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:34:17,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:34:17,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:17,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:17,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 14:34:17,760 INFO L279 TraceCheckSpWp]: Computing forward predicates...