./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17124c627a77300cd44285b9c4c316438e4d73c0a011ab8330c0a1114bb82733 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:00:48,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:00:48,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:00:48,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:00:48,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:00:48,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:00:48,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:00:48,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:00:48,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:00:48,332 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:00:48,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:00:48,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:00:48,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:00:48,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:00:48,335 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:00:48,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:00:48,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:00:48,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:00:48,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:00:48,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:00:48,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:00:48,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:00:48,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:00:48,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:00:48,338 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:00:48,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:00:48,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:00:48,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:00:48,338 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:00:48,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:00:48,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:00:48,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:00:48,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:00:48,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:00:48,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:00:48,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:00:48,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:00:48,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:00:48,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:00:48,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:00:48,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:00:48,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:00:48,342 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17124c627a77300cd44285b9c4c316438e4d73c0a011ab8330c0a1114bb82733 [2024-11-10 04:00:48,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:00:48,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:00:48,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:00:48,572 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:00:48,573 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:00:48,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2024-11-10 04:00:50,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:00:50,183 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:00:50,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2024-11-10 04:00:50,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ae51ee7/aa010909ed6448a0821dbb07d4eb6f89/FLAG1276b7019 [2024-11-10 04:00:50,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ae51ee7/aa010909ed6448a0821dbb07d4eb6f89 [2024-11-10 04:00:50,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:00:50,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:00:50,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:00:50,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:00:50,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:00:50,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf4ea3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50, skipping insertion in model container [2024-11-10 04:00:50,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:00:50,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i[915,928] [2024-11-10 04:00:50,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:00:50,488 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:00:50,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i[915,928] [2024-11-10 04:00:50,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:00:50,534 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:00:50,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50 WrapperNode [2024-11-10 04:00:50,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:00:50,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:00:50,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:00:50,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:00:50,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,625 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2024-11-10 04:00:50,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:00:50,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:00:50,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:00:50,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:00:50,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,679 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:00:50,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,694 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:00:50,718 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:00:50,718 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:00:50,718 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:00:50,719 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (1/1) ... [2024-11-10 04:00:50,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:00:50,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:00:50,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:00:50,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:00:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:00:50,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:00:50,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:00:50,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:00:50,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:00:50,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:00:50,891 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:00:50,893 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:00:51,202 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L150: havoc property_#t~bitwise21#1;havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short24#1; [2024-11-10 04:00:51,266 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-10 04:00:51,266 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:00:51,297 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:00:51,297 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:00:51,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:00:51 BoogieIcfgContainer [2024-11-10 04:00:51,299 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:00:51,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:00:51,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:00:51,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:00:51,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:00:50" (1/3) ... [2024-11-10 04:00:51,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cda2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:00:51, skipping insertion in model container [2024-11-10 04:00:51,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:00:50" (2/3) ... [2024-11-10 04:00:51,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cda2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:00:51, skipping insertion in model container [2024-11-10 04:00:51,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:00:51" (3/3) ... [2024-11-10 04:00:51,309 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2024-11-10 04:00:51,335 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:00:51,336 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:00:51,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:00:51,406 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;@2f32c27b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:00:51,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:00:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 68 states have internal predecessors, (93), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 04:00:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 04:00:51,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:00:51,428 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:00:51,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:00:51,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:00:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1522353538, now seen corresponding path program 1 times [2024-11-10 04:00:51,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:00:51,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122311844] [2024-11-10 04:00:51,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:00:51,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:00:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:00:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:00:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:00:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:00:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:00:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:00:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:00:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:00:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:00:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:00:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:00:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:00:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:00:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:00:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:00:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:00:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:00:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:00:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:00:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:00:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:00:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:00:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:00:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:00:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:00:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:00:51,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:00:51,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122311844] [2024-11-10 04:00:51,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122311844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:00:51,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:00:51,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:00:51,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506888002] [2024-11-10 04:00:51,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:00:51,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:00:51,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:00:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:00:51,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:00:51,954 INFO L87 Difference]: Start difference. First operand has 95 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 68 states have internal predecessors, (93), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 04:00:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:00:51,992 INFO L93 Difference]: Finished difference Result 182 states and 304 transitions. [2024-11-10 04:00:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:00:51,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 166 [2024-11-10 04:00:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:00:52,000 INFO L225 Difference]: With dead ends: 182 [2024-11-10 04:00:52,001 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 04:00:52,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:00:52,006 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:00:52,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:00:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 04:00:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 04:00:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 04:00:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-10 04:00:52,042 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 166 [2024-11-10 04:00:52,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:00:52,042 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-10 04:00:52,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 04:00:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-10 04:00:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 04:00:52,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:00:52,047 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:00:52,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:00:52,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:00:52,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:00:52,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2012682245, now seen corresponding path program 1 times [2024-11-10 04:00:52,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:00:52,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149082369] [2024-11-10 04:00:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:00:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:00:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:00:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:00:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:00:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:00:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:00:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:00:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:00:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:00:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:00:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:00:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:00:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:00:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:00:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:00:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:00:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:00:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:00:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:00:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:00:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:00:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:00:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:00:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:00:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:00:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:00:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:00:52,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:00:52,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149082369] [2024-11-10 04:00:52,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149082369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:00:52,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:00:52,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:00:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358975330] [2024-11-10 04:00:52,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:00:52,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:00:52,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:00:52,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:00:52,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:00:52,754 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:00:53,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:00:53,043 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2024-11-10 04:00:53,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:00:53,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-10 04:00:53,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:00:53,051 INFO L225 Difference]: With dead ends: 266 [2024-11-10 04:00:53,052 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 04:00:53,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:00:53,055 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 96 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:00:53,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 364 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:00:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 04:00:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 143. [2024-11-10 04:00:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 04:00:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2024-11-10 04:00:53,126 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 167 [2024-11-10 04:00:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:00:53,131 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2024-11-10 04:00:53,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:00:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2024-11-10 04:00:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 04:00:53,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:00:53,133 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:00:53,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:00:53,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:00:53,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:00:53,134 INFO L85 PathProgramCache]: Analyzing trace with hash -762191366, now seen corresponding path program 1 times [2024-11-10 04:00:53,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:00:53,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154373879] [2024-11-10 04:00:53,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:00:53,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:00:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:00:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:00:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:00:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:00:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:00:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:00:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:00:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:00:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:00:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:00:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:00:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:00:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:00:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:00:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:00:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:00:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:00:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:00:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:00:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:00:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:00:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:00:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:00:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:00:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:00:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:00:53,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:00:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154373879] [2024-11-10 04:00:53,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154373879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:00:53,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:00:53,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:00:53,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032002357] [2024-11-10 04:00:53,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:00:53,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:00:53,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:00:53,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:00:53,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:00:53,516 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:00:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:00:53,659 INFO L93 Difference]: Finished difference Result 242 states and 358 transitions. [2024-11-10 04:00:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:00:53,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-10 04:00:53,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:00:53,662 INFO L225 Difference]: With dead ends: 242 [2024-11-10 04:00:53,662 INFO L226 Difference]: Without dead ends: 153 [2024-11-10 04:00:53,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:00:53,667 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:00:53,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 220 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:00:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-10 04:00:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-10 04:00:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 98 states have internal predecessors, (123), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 04:00:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2024-11-10 04:00:53,711 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 168 [2024-11-10 04:00:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:00:53,711 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2024-11-10 04:00:53,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:00:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2024-11-10 04:00:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 04:00:53,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:00:53,714 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:00:53,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:00:53,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:00:53,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:00:53,715 INFO L85 PathProgramCache]: Analyzing trace with hash 980641883, now seen corresponding path program 1 times [2024-11-10 04:00:53,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:00:53,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606007510] [2024-11-10 04:00:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:00:53,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:00:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:00:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:00:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:00:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:00:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:00:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:00:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:00:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:00:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:00:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:00:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:00:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:00:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:00:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:00:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:00:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:00:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:00:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:00:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:00:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:00:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:00:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:00:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:00:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:00:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:00:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:00:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:00:53,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:00:53,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606007510] [2024-11-10 04:00:53,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606007510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:00:53,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:00:53,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:00:53,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920184292] [2024-11-10 04:00:53,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:00:53,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:00:53,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:00:53,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:00:53,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:00:53,944 INFO L87 Difference]: Start difference. First operand 153 states and 223 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:00:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:00:53,979 INFO L93 Difference]: Finished difference Result 247 states and 360 transitions. [2024-11-10 04:00:53,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:00:53,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2024-11-10 04:00:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:00:53,981 INFO L225 Difference]: With dead ends: 247 [2024-11-10 04:00:53,983 INFO L226 Difference]: Without dead ends: 153 [2024-11-10 04:00:53,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:00:53,985 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 126 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:00:53,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 266 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:00:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-10 04:00:54,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-10 04:00:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 98 states have internal predecessors, (121), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 04:00:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2024-11-10 04:00:54,019 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 169 [2024-11-10 04:00:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:00:54,020 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2024-11-10 04:00:54,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 04:00:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2024-11-10 04:00:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 04:00:54,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:00:54,027 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:00:54,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:00:54,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:00:54,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:00:54,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1057414406, now seen corresponding path program 1 times [2024-11-10 04:00:54,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:00:54,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658011736] [2024-11-10 04:00:54,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:00:54,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:00:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:01:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:01:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:01:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:01:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:01:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:01:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:01:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:01:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:01:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:01:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:01:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:01:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:01:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:01:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:01:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:01:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:01:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:01:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:01:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:01:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:01:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:01:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:01:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:01:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:01:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:01:11,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:01:11,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658011736] [2024-11-10 04:01:11,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658011736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:01:11,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:01:11,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 04:01:11,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674369926] [2024-11-10 04:01:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:11,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 04:01:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:01:11,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 04:01:11,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-10 04:01:11,400 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 04:01:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:13,261 INFO L93 Difference]: Finished difference Result 478 states and 671 transitions. [2024-11-10 04:01:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 04:01:13,264 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 169 [2024-11-10 04:01:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:13,270 INFO L225 Difference]: With dead ends: 478 [2024-11-10 04:01:13,270 INFO L226 Difference]: Without dead ends: 386 [2024-11-10 04:01:13,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-11-10 04:01:13,272 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 509 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:13,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1002 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 04:01:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-10 04:01:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 248. [2024-11-10 04:01:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 171 states have (on average 1.263157894736842) internal successors, (216), 172 states have internal predecessors, (216), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-10 04:01:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2024-11-10 04:01:13,296 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 169 [2024-11-10 04:01:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:13,298 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2024-11-10 04:01:13,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 04:01:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2024-11-10 04:01:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 04:01:13,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:13,302 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:13,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 04:01:13,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:13,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:13,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1350817413, now seen corresponding path program 1 times [2024-11-10 04:01:13,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:01:13,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240433524] [2024-11-10 04:01:13,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:13,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:01:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:02:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:02:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:02:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:02:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:02:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:02:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:02:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:02:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:02:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:02:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:02:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:02:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:02:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:02:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:02:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:02:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:02:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:02:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:02:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:02:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:02:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:02:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:02:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:02:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:02:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:02:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:02:14,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:02:14,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240433524] [2024-11-10 04:02:14,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240433524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:02:14,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:02:14,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 04:02:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3605300] [2024-11-10 04:02:14,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:02:14,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 04:02:14,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:02:14,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 04:02:14,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-10 04:02:14,084 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 04:02:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:02:15,992 INFO L93 Difference]: Finished difference Result 517 states and 711 transitions. [2024-11-10 04:02:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 04:02:15,993 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 169 [2024-11-10 04:02:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:02:15,996 INFO L225 Difference]: With dead ends: 517 [2024-11-10 04:02:15,996 INFO L226 Difference]: Without dead ends: 425 [2024-11-10 04:02:15,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2024-11-10 04:02:15,998 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 705 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:02:15,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 868 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 04:02:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-10 04:02:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 253. [2024-11-10 04:02:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 174 states have (on average 1.2528735632183907) internal successors, (218), 175 states have internal predecessors, (218), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-10 04:02:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 354 transitions. [2024-11-10 04:02:16,020 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 354 transitions. Word has length 169 [2024-11-10 04:02:16,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:02:16,021 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 354 transitions. [2024-11-10 04:02:16,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 04:02:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 354 transitions. [2024-11-10 04:02:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 04:02:16,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:02:16,023 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:02:16,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 04:02:16,023 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:02:16,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:02:16,023 INFO L85 PathProgramCache]: Analyzing trace with hash 99381786, now seen corresponding path program 1 times [2024-11-10 04:02:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:02:16,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283918114] [2024-11-10 04:02:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:02:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:02:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat