./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.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 c6cb51264034a58d9c2ef3f9375bfc11beb33c3340de6aeb50b163cdf8e9c8d1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:00:17,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:00:17,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:00:17,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:00:17,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:00:17,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:00:17,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:00:17,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:00:17,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:00:17,632 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:00:17,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:00:17,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:00:17,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:00:17,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:00:17,634 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:00:17,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:00:17,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:00:17,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:00:17,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:00:17,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:00:17,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:00:17,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:00:17,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:00:17,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:00:17,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:00:17,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:00:17,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:00:17,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:00:17,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:00:17,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:00:17,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:00:17,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:00:17,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:00:17,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:00:17,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:00:17,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:00:17,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:00:17,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:00:17,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:00:17,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:00:17,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:00:17,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:00:17,647 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 -> c6cb51264034a58d9c2ef3f9375bfc11beb33c3340de6aeb50b163cdf8e9c8d1 [2024-10-24 11:00:17,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:00:17,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:00:17,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:00:17,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:00:17,947 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:00:17,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i [2024-10-24 11:00:19,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:00:19,674 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:00:19,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i [2024-10-24 11:00:19,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f38bbbf5c/73d2a876b05a4751b5a38324b3f190c5/FLAG70dff74f0 [2024-10-24 11:00:20,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f38bbbf5c/73d2a876b05a4751b5a38324b3f190c5 [2024-10-24 11:00:20,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:00:20,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:00:20,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:00:20,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:00:20,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:00:20,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@caf8525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20, skipping insertion in model container [2024-10-24 11:00:20,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:00:20,262 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i[914,927] [2024-10-24 11:00:20,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:00:20,328 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:00:20,339 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i[914,927] [2024-10-24 11:00:20,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:00:20,387 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:00:20,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20 WrapperNode [2024-10-24 11:00:20,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:00:20,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:00:20,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:00:20,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:00:20,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,445 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-10-24 11:00:20,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:00:20,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:00:20,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:00:20,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:00:20,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,483 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-10-24 11:00:20,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:00:20,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:00:20,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:00:20,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:00:20,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (1/1) ... [2024-10-24 11:00:20,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:00:20,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:00:20,547 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-10-24 11:00:20,550 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-10-24 11:00:20,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:00:20,607 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:00:20,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:00:20,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:00:20,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:00:20,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:00:20,699 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:00:20,702 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:00:21,085 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-24 11:00:21,086 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:00:21,161 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:00:21,162 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:00:21,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:00:21 BoogieIcfgContainer [2024-10-24 11:00:21,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:00:21,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:00:21,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:00:21,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:00:21,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:00:20" (1/3) ... [2024-10-24 11:00:21,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17faa598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:00:21, skipping insertion in model container [2024-10-24 11:00:21,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:20" (2/3) ... [2024-10-24 11:00:21,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17faa598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:00:21, skipping insertion in model container [2024-10-24 11:00:21,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:00:21" (3/3) ... [2024-10-24 11:00:21,173 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-9.i [2024-10-24 11:00:21,188 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:00:21,188 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:00:21,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:00:21,248 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;@4e34110e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:00:21,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:00:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:00:21,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:21,266 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:21,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:21,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:21,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1780658127, now seen corresponding path program 1 times [2024-10-24 11:00:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:21,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916338605] [2024-10-24 11:00:21,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:21,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:00:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:00:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:00:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:00:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:00:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:00:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:00:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:00:21,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:21,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916338605] [2024-10-24 11:00:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916338605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:21,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:21,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:00:21,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030140447] [2024-10-24 11:00:21,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:21,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:00:21,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:21,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:00:21,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:00:21,729 INFO L87 Difference]: Start difference. First operand has 69 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:00:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:21,779 INFO L93 Difference]: Finished difference Result 135 states and 221 transitions. [2024-10-24 11:00:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:00:21,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 105 [2024-10-24 11:00:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:21,791 INFO L225 Difference]: With dead ends: 135 [2024-10-24 11:00:21,792 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 11:00:21,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:00:21,801 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:21,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:00:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 11:00:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-24 11:00:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2024-10-24 11:00:21,856 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 105 [2024-10-24 11:00:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:21,857 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2024-10-24 11:00:21,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:00:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2024-10-24 11:00:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:00:21,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:21,864 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:21,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:00:21,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:21,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash 646779785, now seen corresponding path program 1 times [2024-10-24 11:00:21,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:21,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276745208] [2024-10-24 11:00:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:00:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:00:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:00:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:00:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:00:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:00:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:00:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:00:22,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:22,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276745208] [2024-10-24 11:00:22,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276745208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:22,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:22,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:00:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616024840] [2024-10-24 11:00:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:22,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:00:22,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:22,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:00:22,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:00:22,197 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:22,233 INFO L93 Difference]: Finished difference Result 134 states and 199 transitions. [2024-10-24 11:00:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:00:22,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-10-24 11:00:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:22,237 INFO L225 Difference]: With dead ends: 134 [2024-10-24 11:00:22,237 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 11:00:22,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-10-24 11:00:22,239 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:22,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:00:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 11:00:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-24 11:00:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2024-10-24 11:00:22,250 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 105 [2024-10-24 11:00:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:22,251 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2024-10-24 11:00:22,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2024-10-24 11:00:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:00:22,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:22,257 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:22,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:00:22,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:22,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash -316104405, now seen corresponding path program 1 times [2024-10-24 11:00:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:22,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253256176] [2024-10-24 11:00:22,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:22,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:00:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:00:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:00:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:00:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:00:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:00:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:00:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:00:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253256176] [2024-10-24 11:00:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253256176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:26,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:26,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:00:26,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108379413] [2024-10-24 11:00:26,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:26,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:00:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:26,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:00:26,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:00:26,218 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:00:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:28,612 INFO L93 Difference]: Finished difference Result 244 states and 355 transitions. [2024-10-24 11:00:28,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:00:28,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 106 [2024-10-24 11:00:28,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:28,615 INFO L225 Difference]: With dead ends: 244 [2024-10-24 11:00:28,615 INFO L226 Difference]: Without dead ends: 177 [2024-10-24 11:00:28,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:00:28,617 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 386 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:28,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 271 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 11:00:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-24 11:00:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2024-10-24 11:00:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2024-10-24 11:00:28,638 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 106 [2024-10-24 11:00:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:28,641 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2024-10-24 11:00:28,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:00:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2024-10-24 11:00:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:00:28,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:28,644 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:28,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:00:28,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:28,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1595968083, now seen corresponding path program 1 times [2024-10-24 11:00:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:28,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864254646] [2024-10-24 11:00:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:00:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:00:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:00:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:00:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:00:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:00:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:00:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:00:30,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:30,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864254646] [2024-10-24 11:00:30,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864254646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:30,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:30,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:00:30,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144578133] [2024-10-24 11:00:30,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:30,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:00:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:30,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:00:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:00:30,580 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:31,327 INFO L93 Difference]: Finished difference Result 259 states and 381 transitions. [2024-10-24 11:00:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:00:31,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2024-10-24 11:00:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:31,329 INFO L225 Difference]: With dead ends: 259 [2024-10-24 11:00:31,329 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 11:00:31,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:00:31,334 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 93 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:31,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 355 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:00:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 11:00:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 95. [2024-10-24 11:00:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2024-10-24 11:00:31,353 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 106 [2024-10-24 11:00:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:31,354 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2024-10-24 11:00:31,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2024-10-24 11:00:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:00:31,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:31,359 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:31,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:00:31,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:31,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:31,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2005048147, now seen corresponding path program 1 times [2024-10-24 11:00:31,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:31,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885200232] [2024-10-24 11:00:31,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:31,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:00:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:00:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:00:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:00:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:00:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:00:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:00:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:00:34,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:34,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885200232] [2024-10-24 11:00:34,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885200232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:34,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:34,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:00:34,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076970989] [2024-10-24 11:00:34,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:34,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:00:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:34,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:00:34,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:00:34,732 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:00:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:37,060 INFO L93 Difference]: Finished difference Result 273 states and 398 transitions. [2024-10-24 11:00:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:00:37,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 106 [2024-10-24 11:00:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:37,062 INFO L225 Difference]: With dead ends: 273 [2024-10-24 11:00:37,062 INFO L226 Difference]: Without dead ends: 179 [2024-10-24 11:00:37,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:00:37,069 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 317 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:37,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 344 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 11:00:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-24 11:00:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 101. [2024-10-24 11:00:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2024-10-24 11:00:37,090 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 106 [2024-10-24 11:00:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:37,094 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2024-10-24 11:00:37,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:00:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2024-10-24 11:00:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:00:37,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:37,096 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:37,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:00:37,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:37,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:37,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1010055471, now seen corresponding path program 1 times [2024-10-24 11:00:37,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:37,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708416358] [2024-10-24 11:00:37,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:37,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:38,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:38,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:38,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:00:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:38,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:38,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:00:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:38,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:38,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:38,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:39,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:00:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:39,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:00:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:39,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:00:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:39,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:00:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:39,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:00:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:00:39,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:39,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708416358] [2024-10-24 11:00:39,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708416358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:39,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:39,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:00:39,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532603285] [2024-10-24 11:00:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:39,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:00:39,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:39,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:00:39,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:00:39,021 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:39,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:39,972 INFO L93 Difference]: Finished difference Result 267 states and 392 transitions. [2024-10-24 11:00:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:00:39,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2024-10-24 11:00:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:39,974 INFO L225 Difference]: With dead ends: 267 [2024-10-24 11:00:39,974 INFO L226 Difference]: Without dead ends: 167 [2024-10-24 11:00:39,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:00:39,976 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 133 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:39,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 450 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:00:39,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-24 11:00:39,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 95. [2024-10-24 11:00:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2024-10-24 11:00:39,990 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 106 [2024-10-24 11:00:39,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:39,991 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2024-10-24 11:00:39,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2024-10-24 11:00:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:00:39,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:39,992 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:39,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:00:39,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:39,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash 106597421, now seen corresponding path program 1 times [2024-10-24 11:00:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:39,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220457316] [2024-10-24 11:00:39,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:39,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:00:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:00:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:00:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:00:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:00:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:00:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:00:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:00:41,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:41,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220457316] [2024-10-24 11:00:41,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220457316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:41,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:41,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:00:41,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320370858] [2024-10-24 11:00:41,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:41,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:00:41,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:41,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:00:41,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:00:41,278 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:41,714 INFO L93 Difference]: Finished difference Result 254 states and 376 transitions. [2024-10-24 11:00:41,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:00:41,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2024-10-24 11:00:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:41,716 INFO L225 Difference]: With dead ends: 254 [2024-10-24 11:00:41,717 INFO L226 Difference]: Without dead ends: 160 [2024-10-24 11:00:41,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:00:41,718 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 93 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:41,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 316 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:00:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-24 11:00:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 95. [2024-10-24 11:00:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2024-10-24 11:00:41,730 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 106 [2024-10-24 11:00:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:41,730 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2024-10-24 11:00:41,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2024-10-24 11:00:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:00:41,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:41,732 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:41,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:00:41,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:41,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:41,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1582346321, now seen corresponding path program 1 times [2024-10-24 11:00:41,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:41,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438609133] [2024-10-24 11:00:41,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:41,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:00:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:00:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:00:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:00:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:00:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:00:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:00:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:00:42,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:42,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438609133] [2024-10-24 11:00:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438609133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:42,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:42,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:00:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631449656] [2024-10-24 11:00:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:42,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:00:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:42,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:00:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:00:42,780 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:43,224 INFO L93 Difference]: Finished difference Result 231 states and 340 transitions. [2024-10-24 11:00:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:00:43,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2024-10-24 11:00:43,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:43,225 INFO L225 Difference]: With dead ends: 231 [2024-10-24 11:00:43,225 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 11:00:43,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:00:43,227 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 93 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:43,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 347 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:00:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 11:00:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 70. [2024-10-24 11:00:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-10-24 11:00:43,235 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 106 [2024-10-24 11:00:43,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:43,235 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-10-24 11:00:43,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:43,235 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-10-24 11:00:43,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:00:43,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:43,236 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:43,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:00:43,237 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:43,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:43,237 INFO L85 PathProgramCache]: Analyzing trace with hash 812428304, now seen corresponding path program 1 times [2024-10-24 11:00:43,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:43,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582813332] [2024-10-24 11:00:43,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:43,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:00:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:00:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:00:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:00:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:00:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:00:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:00:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 11:00:43,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:43,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582813332] [2024-10-24 11:00:43,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582813332] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:00:43,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934781314] [2024-10-24 11:00:43,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:43,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:00:43,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:00:43,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:00:43,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:00:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:43,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:00:43,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:00:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-24 11:00:43,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:00:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 11:00:43,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934781314] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:00:43,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:00:43,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-24 11:00:43,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127883246] [2024-10-24 11:00:43,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:00:43,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:00:43,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:43,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:00:43,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:00:43,975 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-10-24 11:00:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:44,184 INFO L93 Difference]: Finished difference Result 149 states and 211 transitions. [2024-10-24 11:00:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:00:44,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 108 [2024-10-24 11:00:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:44,186 INFO L225 Difference]: With dead ends: 149 [2024-10-24 11:00:44,186 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 11:00:44,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:00:44,187 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 197 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:44,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 157 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:00:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 11:00:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-10-24 11:00:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.305084745762712) internal successors, (77), 59 states have internal predecessors, (77), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2024-10-24 11:00:44,196 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 108 [2024-10-24 11:00:44,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:44,196 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2024-10-24 11:00:44,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-10-24 11:00:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2024-10-24 11:00:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:00:44,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:44,198 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:44,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:00:44,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:00:44,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:44,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash -775919598, now seen corresponding path program 1 times [2024-10-24 11:00:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:44,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366218763] [2024-10-24 11:00:44,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:00:44,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [202353267] [2024-10-24 11:00:44,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:44,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:00:44,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:00:44,485 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:00:44,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:00:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:44,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:00:44,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:00:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-24 11:00:45,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:00:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 11:00:45,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366218763] [2024-10-24 11:00:45,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:00:45,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202353267] [2024-10-24 11:00:45,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202353267] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:00:45,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:00:45,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2024-10-24 11:00:45,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909694480] [2024-10-24 11:00:45,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:00:45,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 11:00:45,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:45,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 11:00:45,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:00:45,583 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-24 11:00:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:46,724 INFO L93 Difference]: Finished difference Result 352 states and 469 transitions. [2024-10-24 11:00:46,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-24 11:00:46,725 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 108 [2024-10-24 11:00:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:46,726 INFO L225 Difference]: With dead ends: 352 [2024-10-24 11:00:46,726 INFO L226 Difference]: Without dead ends: 275 [2024-10-24 11:00:46,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=308, Invalid=1174, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 11:00:46,728 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 594 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:46,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 806 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:00:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-24 11:00:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 127. [2024-10-24 11:00:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 107 states have internal predecessors, (142), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 172 transitions. [2024-10-24 11:00:46,741 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 172 transitions. Word has length 108 [2024-10-24 11:00:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:46,742 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 172 transitions. [2024-10-24 11:00:46,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-24 11:00:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 172 transitions. [2024-10-24 11:00:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:00:46,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:46,743 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:46,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:00:46,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 11:00:46,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:46,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:46,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1288387867, now seen corresponding path program 1 times [2024-10-24 11:00:46,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:46,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786305767] [2024-10-24 11:00:46,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:46,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:00:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:00:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:00:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:00:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:00:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:00:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:00:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:00:47,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:47,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786305767] [2024-10-24 11:00:47,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786305767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:47,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:47,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:00:47,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72132844] [2024-10-24 11:00:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:47,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:00:47,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:47,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:00:47,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:00:47,051 INFO L87 Difference]: Start difference. First operand 127 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:47,098 INFO L93 Difference]: Finished difference Result 325 states and 440 transitions. [2024-10-24 11:00:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:00:47,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-10-24 11:00:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:47,100 INFO L225 Difference]: With dead ends: 325 [2024-10-24 11:00:47,101 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 11:00:47,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-10-24 11:00:47,102 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 78 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:47,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 187 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:00:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 11:00:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 150. [2024-10-24 11:00:47,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 130 states have (on average 1.353846153846154) internal successors, (176), 130 states have internal predecessors, (176), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 206 transitions. [2024-10-24 11:00:47,119 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 206 transitions. Word has length 108 [2024-10-24 11:00:47,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:47,121 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 206 transitions. [2024-10-24 11:00:47,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 206 transitions. [2024-10-24 11:00:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:00:47,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:47,122 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:47,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:00:47,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:47,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1436669563, now seen corresponding path program 1 times [2024-10-24 11:00:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:47,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120867063] [2024-10-24 11:00:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:47,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:00:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:00:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:00:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:00:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:00:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:00:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:00:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 11:00:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120867063] [2024-10-24 11:00:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120867063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:00:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100836024] [2024-10-24 11:00:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:47,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:00:47,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:00:47,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:00:47,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 11:00:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:48,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:00:48,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:00:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:00:48,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:00:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100836024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:48,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:00:48,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-10-24 11:00:48,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273767776] [2024-10-24 11:00:48,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:48,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:00:48,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:48,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:00:48,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:00:48,189 INFO L87 Difference]: Start difference. First operand 150 states and 206 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:48,315 INFO L93 Difference]: Finished difference Result 363 states and 494 transitions. [2024-10-24 11:00:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:00:48,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-10-24 11:00:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:48,317 INFO L225 Difference]: With dead ends: 363 [2024-10-24 11:00:48,317 INFO L226 Difference]: Without dead ends: 214 [2024-10-24 11:00:48,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:00:48,318 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 30 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:48,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 363 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:00:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-24 11:00:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 165. [2024-10-24 11:00:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 145 states have (on average 1.3586206896551725) internal successors, (197), 145 states have internal predecessors, (197), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 227 transitions. [2024-10-24 11:00:48,331 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 227 transitions. Word has length 108 [2024-10-24 11:00:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:48,331 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 227 transitions. [2024-10-24 11:00:48,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 227 transitions. [2024-10-24 11:00:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:00:48,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:48,333 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:48,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 11:00:48,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:00:48,534 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash -640752315, now seen corresponding path program 1 times [2024-10-24 11:00:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984975268] [2024-10-24 11:00:48,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:48,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:00:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 11:00:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:00:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:00:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:00:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:00:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:00:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:00:51,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:51,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984975268] [2024-10-24 11:00:51,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984975268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:51,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:51,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 11:00:51,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273138853] [2024-10-24 11:00:51,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:51,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 11:00:51,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:51,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 11:00:51,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:00:51,002 INFO L87 Difference]: Start difference. First operand 165 states and 227 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:53,200 INFO L93 Difference]: Finished difference Result 278 states and 371 transitions. [2024-10-24 11:00:53,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 11:00:53,201 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-10-24 11:00:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:53,202 INFO L225 Difference]: With dead ends: 278 [2024-10-24 11:00:53,202 INFO L226 Difference]: Without dead ends: 276 [2024-10-24 11:00:53,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2024-10-24 11:00:53,203 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 328 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:53,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 513 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 11:00:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-24 11:00:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 198. [2024-10-24 11:00:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 178 states have (on average 1.3651685393258426) internal successors, (243), 178 states have internal predecessors, (243), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:00:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 273 transitions. [2024-10-24 11:00:53,218 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 273 transitions. Word has length 109 [2024-10-24 11:00:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:53,218 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 273 transitions. [2024-10-24 11:00:53,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:00:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 273 transitions. [2024-10-24 11:00:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:00:53,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:53,220 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:53,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:00:53,220 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:53,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1338760492, now seen corresponding path program 1 times [2024-10-24 11:00:53,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:53,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037703828] [2024-10-24 11:00:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:53,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:00:53,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122331916] [2024-10-24 11:00:53,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:53,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:00:53,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:00:53,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:00:53,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 11:00:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:00:53,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:00:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:00:53,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:00:53,763 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:00:53,764 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:00:53,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 11:00:53,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:00:53,970 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:54,055 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:00:54,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:00:54 BoogieIcfgContainer [2024-10-24 11:00:54,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:00:54,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:00:54,058 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:00:54,058 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:00:54,059 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:00:21" (3/4) ... [2024-10-24 11:00:54,061 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:00:54,062 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:00:54,062 INFO L158 Benchmark]: Toolchain (without parser) took 34000.34ms. Allocated memory was 165.7MB in the beginning and 362.8MB in the end (delta: 197.1MB). Free memory was 110.3MB in the beginning and 130.1MB in the end (delta: -19.8MB). Peak memory consumption was 179.2MB. Max. memory is 16.1GB. [2024-10-24 11:00:54,063 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 165.7MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:00:54,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.01ms. Allocated memory is still 165.7MB. Free memory was 110.3MB in the beginning and 95.4MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:00:54,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.25ms. Allocated memory is still 165.7MB. Free memory was 95.4MB in the beginning and 92.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:00:54,063 INFO L158 Benchmark]: Boogie Preprocessor took 52.15ms. Allocated memory is still 165.7MB. Free memory was 92.4MB in the beginning and 89.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:00:54,063 INFO L158 Benchmark]: RCFGBuilder took 659.15ms. Allocated memory is still 165.7MB. Free memory was 88.6MB in the beginning and 134.6MB in the end (delta: -45.9MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-10-24 11:00:54,064 INFO L158 Benchmark]: TraceAbstraction took 32893.26ms. Allocated memory was 165.7MB in the beginning and 362.8MB in the end (delta: 197.1MB). Free memory was 133.7MB in the beginning and 130.1MB in the end (delta: 3.6MB). Peak memory consumption was 200.7MB. Max. memory is 16.1GB. [2024-10-24 11:00:54,064 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 362.8MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:00:54,065 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 165.7MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.01ms. Allocated memory is still 165.7MB. Free memory was 110.3MB in the beginning and 95.4MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.25ms. Allocated memory is still 165.7MB. Free memory was 95.4MB in the beginning and 92.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.15ms. Allocated memory is still 165.7MB. Free memory was 92.4MB in the beginning and 89.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 659.15ms. Allocated memory is still 165.7MB. Free memory was 88.6MB in the beginning and 134.6MB in the end (delta: -45.9MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32893.26ms. Allocated memory was 165.7MB in the beginning and 362.8MB in the end (delta: 197.1MB). Free memory was 133.7MB in the beginning and 130.1MB in the end (delta: 3.6MB). Peak memory consumption was 200.7MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 362.8MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=4, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=4, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=4, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=4, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=4, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=4, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=4, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=4, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=4, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L127] RET updateVariables() [L128] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=4, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=4, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L51] var_1_18 = var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L52] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L52] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L59] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=4, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=4, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=4, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=4, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=4, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=4, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=4, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=4, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=4, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=4, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=4, var_1_11=4, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=4, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=7, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.7s, OverallIterations: 14, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2344 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2342 mSDsluCounter, 4390 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3272 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4344 IncrementalHoareTripleChecker+Invalid, 4403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 1118 mSDtfsCounter, 4344 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1076 GetRequests, 925 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=13, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 760 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1802 ConstructedInterpolants, 0 QuantifiedInterpolants, 11707 SizeOfPredicates, 16 NumberOfNonLiveVariables, 792 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 6948/7140 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:00:54,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c6cb51264034a58d9c2ef3f9375bfc11beb33c3340de6aeb50b163cdf8e9c8d1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:00:56,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:00:56,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:00:56,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:00:56,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:00:56,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:00:56,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:00:56,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:00:56,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:00:56,402 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:00:56,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:00:56,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:00:56,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:00:56,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:00:56,406 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:00:56,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:00:56,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:00:56,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:00:56,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:00:56,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:00:56,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:00:56,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:00:56,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:00:56,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:00:56,414 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:00:56,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:00:56,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:00:56,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:00:56,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:00:56,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:00:56,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:00:56,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:00:56,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:00:56,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:00:56,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:00:56,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:00:56,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:00:56,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:00:56,421 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:00:56,421 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:00:56,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:00:56,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:00:56,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:00:56,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:00:56,423 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:00:56,423 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 -> c6cb51264034a58d9c2ef3f9375bfc11beb33c3340de6aeb50b163cdf8e9c8d1 [2024-10-24 11:00:56,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:00:56,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:00:56,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:00:56,794 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:00:56,794 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:00:56,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i [2024-10-24 11:00:58,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:00:58,639 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:00:58,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i [2024-10-24 11:00:58,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd379a27/18ef89834f1e43028b7af3c31e33891e/FLAGd21800ce3 [2024-10-24 11:00:58,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd379a27/18ef89834f1e43028b7af3c31e33891e [2024-10-24 11:00:58,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:00:58,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:00:58,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:00:58,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:00:58,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:00:58,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:00:58" (1/1) ... [2024-10-24 11:00:58,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a7a0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:58, skipping insertion in model container [2024-10-24 11:00:58,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:00:58" (1/1) ... [2024-10-24 11:00:58,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:00:58,921 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i[914,927] [2024-10-24 11:00:58,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:00:59,007 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:00:59,020 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-9.i[914,927] [2024-10-24 11:00:59,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:00:59,082 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:00:59,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59 WrapperNode [2024-10-24 11:00:59,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:00:59,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:00:59,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:00:59,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:00:59,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (1/1) ... [2024-10-24 11:00:59,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (1/1) ... [2024-10-24 11:00:59,140 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-24 11:00:59,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:00:59,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:00:59,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:00:59,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:00:59,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (1/1) ... [2024-10-24 11:00:59,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (1/1) ... [2024-10-24 11:00:59,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (1/1) ... [2024-10-24 11:00:59,178 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-10-24 11:00:59,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (1/1) ... [2024-10-24 11:00:59,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (1/1) ... [2024-10-24 11:00:59,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (1/1) ... [2024-10-24 11:00:59,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (1/1) ... [2024-10-24 11:00:59,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (1/1) ... [2024-10-24 11:00:59,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (1/1) ... [2024-10-24 11:00:59,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:00:59,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:00:59,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:00:59,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:00:59,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (1/1) ... [2024-10-24 11:00:59,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:00:59,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:00:59,257 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-10-24 11:00:59,259 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-10-24 11:00:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:00:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:00:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:00:59,312 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:00:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:00:59,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:00:59,392 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:00:59,394 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:00:59,829 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 11:00:59,829 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:00:59,887 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:00:59,887 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:00:59,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:00:59 BoogieIcfgContainer [2024-10-24 11:00:59,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:00:59,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:00:59,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:00:59,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:00:59,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:00:58" (1/3) ... [2024-10-24 11:00:59,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fade223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:00:59, skipping insertion in model container [2024-10-24 11:00:59,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:59" (2/3) ... [2024-10-24 11:00:59,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fade223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:00:59, skipping insertion in model container [2024-10-24 11:00:59,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:00:59" (3/3) ... [2024-10-24 11:00:59,899 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-9.i [2024-10-24 11:00:59,916 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:00:59,916 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:00:59,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:01:00,004 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;@ffe4924, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:01:00,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:01:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:01:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 11:01:00,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:01:00,020 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:01:00,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:01:00,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:01:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash 799804676, now seen corresponding path program 1 times [2024-10-24 11:01:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:01:00,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704419647] [2024-10-24 11:01:00,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:01:00,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:01:00,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:01:00,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:01:00,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:01:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:00,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:01:00,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:01:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-24 11:01:00,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:01:00,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:01:00,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704419647] [2024-10-24 11:01:00,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704419647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:01:00,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:01:00,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:01:00,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017090944] [2024-10-24 11:01:00,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:01:00,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:01:00,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:01:00,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:01:00,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:01:00,339 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:01:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:01:00,421 INFO L93 Difference]: Finished difference Result 97 states and 167 transitions. [2024-10-24 11:01:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:01:00,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-10-24 11:01:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:01:00,442 INFO L225 Difference]: With dead ends: 97 [2024-10-24 11:01:00,442 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 11:01:00,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:01:00,452 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:01:00,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:01:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 11:01:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-24 11:01:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:01:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-10-24 11:01:00,502 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 97 [2024-10-24 11:01:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:01:00,502 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-10-24 11:01:00,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:01:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-10-24 11:01:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:01:00,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:01:00,508 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:01:00,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:01:00,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:01:00,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:01:00,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:01:00,710 INFO L85 PathProgramCache]: Analyzing trace with hash -992890513, now seen corresponding path program 1 times [2024-10-24 11:01:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:01:00,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705583291] [2024-10-24 11:01:00,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:01:00,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:01:00,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:01:00,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:01:00,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:01:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:01:00,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:01:00,938 INFO L278 TraceCheckSpWp]: Computing forward predicates...