./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.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 e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:13:34,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:13:34,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:13:34,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:13:34,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:13:34,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:13:34,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:13:34,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:13:34,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:13:34,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:13:34,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:13:34,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:13:34,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:13:34,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:13:34,401 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:13:34,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:13:34,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:13:34,402 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:13:34,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:13:34,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:13:34,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:13:34,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:13:34,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:13:34,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:13:34,407 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:13:34,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:13:34,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:13:34,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:13:34,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:13:34,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:13:34,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:13:34,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:13:34,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:34,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:13:34,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:13:34,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:13:34,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:13:34,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:13:34,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:13:34,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:13:34,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:13:34,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:13:34,413 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 -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2024-11-12 06:13:34,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:13:34,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:13:34,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:13:34,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:13:34,746 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:13:34,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-11-12 06:13:36,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:13:36,535 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:13:36,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-11-12 06:13:36,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec8fff6c1/5cab6ee2f57e4e3bbef6b34730a982ce/FLAGc93e21f7a [2024-11-12 06:13:36,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec8fff6c1/5cab6ee2f57e4e3bbef6b34730a982ce [2024-11-12 06:13:36,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:13:36,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:13:36,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:36,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:13:36,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:13:36,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505c94a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36, skipping insertion in model container [2024-11-12 06:13:36,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:13:36,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2024-11-12 06:13:36,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:36,852 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:13:36,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2024-11-12 06:13:36,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:36,888 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:13:36,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36 WrapperNode [2024-11-12 06:13:36,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:36,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:36,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:13:36,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:13:36,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,931 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-12 06:13:36,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:36,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:13:36,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:13:36,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:13:36,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,960 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:13:36,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:13:36,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:13:36,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:13:36,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:13:36,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (1/1) ... [2024-11-12 06:13:36,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:37,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:13:37,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:13:37,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:13:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:13:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:13:37,085 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:13:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:13:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:13:37,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:13:37,160 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:13:37,166 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:13:37,453 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 06:13:37,453 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:13:37,472 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:13:37,473 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:13:37,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:37 BoogieIcfgContainer [2024-11-12 06:13:37,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:13:37,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:13:37,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:13:37,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:13:37,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:13:36" (1/3) ... [2024-11-12 06:13:37,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5880f77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:37, skipping insertion in model container [2024-11-12 06:13:37,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:36" (2/3) ... [2024-11-12 06:13:37,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5880f77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:37, skipping insertion in model container [2024-11-12 06:13:37,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:37" (3/3) ... [2024-11-12 06:13:37,487 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2024-11-12 06:13:37,507 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:13:37,507 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:13:37,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:13:37,598 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;@17334d09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:13:37,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:13:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:13:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 06:13:37,615 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:37,616 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:37,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:37,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1891837795, now seen corresponding path program 1 times [2024-11-12 06:13:37,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:37,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907991546] [2024-11-12 06:13:37,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:37,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:13:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:13:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:13:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:13:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:13:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:13:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:13:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:13:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:13:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:13:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:13:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:37,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907991546] [2024-11-12 06:13:37,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907991546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:37,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:37,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:13:37,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406442112] [2024-11-12 06:13:37,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:37,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:13:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:38,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:13:38,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:13:38,026 INFO L87 Difference]: Start difference. First operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 06:13:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:38,059 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2024-11-12 06:13:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:13:38,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2024-11-12 06:13:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:38,072 INFO L225 Difference]: With dead ends: 95 [2024-11-12 06:13:38,072 INFO L226 Difference]: Without dead ends: 47 [2024-11-12 06:13:38,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:13:38,083 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:38,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-12 06:13:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-12 06:13:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:13:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-12 06:13:38,139 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 81 [2024-11-12 06:13:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:38,141 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-12 06:13:38,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 06:13:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-12 06:13:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 06:13:38,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:38,147 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:38,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:13:38,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:38,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1491710109, now seen corresponding path program 1 times [2024-11-12 06:13:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:38,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718478792] [2024-11-12 06:13:38,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:38,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:13:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:13:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:13:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:13:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:13:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:13:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:13:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:13:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:13:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:13:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:13:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:38,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:38,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718478792] [2024-11-12 06:13:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718478792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:38,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:38,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:13:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980294766] [2024-11-12 06:13:38,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:38,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:13:38,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:38,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:13:38,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:13:38,994 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:39,241 INFO L93 Difference]: Finished difference Result 112 states and 154 transitions. [2024-11-12 06:13:39,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:13:39,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-11-12 06:13:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:39,247 INFO L225 Difference]: With dead ends: 112 [2024-11-12 06:13:39,248 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 06:13:39,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:13:39,252 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 22 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:39,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 144 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:13:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 06:13:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2024-11-12 06:13:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:13:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2024-11-12 06:13:39,267 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 81 [2024-11-12 06:13:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:39,269 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2024-11-12 06:13:39,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2024-11-12 06:13:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 06:13:39,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:39,272 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:39,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:13:39,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:39,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:39,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1098683099, now seen corresponding path program 1 times [2024-11-12 06:13:39,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:39,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915110772] [2024-11-12 06:13:39,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:39,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:13:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:13:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:13:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:13:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:13:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:13:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:13:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:13:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:13:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:13:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:13:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:39,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:39,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915110772] [2024-11-12 06:13:39,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915110772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:39,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:39,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:13:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394093982] [2024-11-12 06:13:39,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:39,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:13:39,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:39,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:13:39,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:13:39,474 INFO L87 Difference]: Start difference. First operand 55 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:39,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:39,536 INFO L93 Difference]: Finished difference Result 151 states and 211 transitions. [2024-11-12 06:13:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:13:39,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-11-12 06:13:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:39,539 INFO L225 Difference]: With dead ends: 151 [2024-11-12 06:13:39,539 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 06:13:39,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:13:39,541 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 35 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:39,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 128 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 06:13:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-12 06:13:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 70 states have internal predecessors, (85), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 06:13:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2024-11-12 06:13:39,574 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 81 [2024-11-12 06:13:39,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:39,575 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2024-11-12 06:13:39,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2024-11-12 06:13:39,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 06:13:39,578 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:39,579 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:39,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:13:39,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:39,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:39,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2105512264, now seen corresponding path program 1 times [2024-11-12 06:13:39,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:39,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63632454] [2024-11-12 06:13:39,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:39,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:13:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:13:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:13:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:13:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:13:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:13:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:13:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:13:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:13:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:13:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:13:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:39,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:39,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63632454] [2024-11-12 06:13:39,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63632454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:39,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:39,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:13:39,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414516974] [2024-11-12 06:13:39,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:39,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:13:39,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:39,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:13:39,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:13:39,904 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:39,998 INFO L93 Difference]: Finished difference Result 167 states and 223 transitions. [2024-11-12 06:13:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:13:39,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-12 06:13:39,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:40,000 INFO L225 Difference]: With dead ends: 167 [2024-11-12 06:13:40,000 INFO L226 Difference]: Without dead ends: 165 [2024-11-12 06:13:40,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 06:13:40,002 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 40 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:40,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 400 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-12 06:13:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2024-11-12 06:13:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 118 states have internal predecessors, (137), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 06:13:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 217 transitions. [2024-11-12 06:13:40,034 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 217 transitions. Word has length 83 [2024-11-12 06:13:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:40,035 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 217 transitions. [2024-11-12 06:13:40,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 217 transitions. [2024-11-12 06:13:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 06:13:40,042 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:40,042 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:40,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:13:40,043 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:40,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:40,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1425453894, now seen corresponding path program 1 times [2024-11-12 06:13:40,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:40,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441593842] [2024-11-12 06:13:40,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:40,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:13:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:13:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:13:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:13:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:13:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:13:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:13:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:13:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:13:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:13:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:13:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:41,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:41,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441593842] [2024-11-12 06:13:41,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441593842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:41,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:41,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 06:13:41,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651635174] [2024-11-12 06:13:41,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:41,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 06:13:41,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:41,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 06:13:41,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-12 06:13:41,089 INFO L87 Difference]: Start difference. First operand 161 states and 217 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:41,954 INFO L93 Difference]: Finished difference Result 246 states and 324 transitions. [2024-11-12 06:13:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 06:13:41,955 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-12 06:13:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:41,960 INFO L225 Difference]: With dead ends: 246 [2024-11-12 06:13:41,960 INFO L226 Difference]: Without dead ends: 244 [2024-11-12 06:13:41,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-12 06:13:41,964 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 89 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:41,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 562 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 06:13:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-12 06:13:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 215. [2024-11-12 06:13:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 156 states have (on average 1.1794871794871795) internal successors, (184), 160 states have internal predecessors, (184), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 06:13:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 288 transitions. [2024-11-12 06:13:42,027 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 288 transitions. Word has length 83 [2024-11-12 06:13:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:42,027 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 288 transitions. [2024-11-12 06:13:42,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:42,028 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 288 transitions. [2024-11-12 06:13:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 06:13:42,029 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:42,029 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:42,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 06:13:42,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:42,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:42,030 INFO L85 PathProgramCache]: Analyzing trace with hash 245561584, now seen corresponding path program 1 times [2024-11-12 06:13:42,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:42,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587743163] [2024-11-12 06:13:42,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:42,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:13:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:13:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:13:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:13:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:13:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:13:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:13:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:13:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:13:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:13:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:13:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:42,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:42,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587743163] [2024-11-12 06:13:42,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587743163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:42,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:42,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:13:42,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864375561] [2024-11-12 06:13:42,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:42,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:13:42,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:42,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:13:42,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:13:42,134 INFO L87 Difference]: Start difference. First operand 215 states and 288 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:42,211 INFO L93 Difference]: Finished difference Result 461 states and 621 transitions. [2024-11-12 06:13:42,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:13:42,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-11-12 06:13:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:42,215 INFO L225 Difference]: With dead ends: 461 [2024-11-12 06:13:42,215 INFO L226 Difference]: Without dead ends: 322 [2024-11-12 06:13:42,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:13:42,217 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 47 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:42,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 154 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-12 06:13:42,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2024-11-12 06:13:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 225 states have (on average 1.1511111111111112) internal successors, (259), 232 states have internal predecessors, (259), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-12 06:13:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 427 transitions. [2024-11-12 06:13:42,302 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 427 transitions. Word has length 84 [2024-11-12 06:13:42,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:42,303 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 427 transitions. [2024-11-12 06:13:42,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 427 transitions. [2024-11-12 06:13:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 06:13:42,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:42,305 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:42,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 06:13:42,306 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:42,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1798596289, now seen corresponding path program 1 times [2024-11-12 06:13:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:42,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592316042] [2024-11-12 06:13:42,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:42,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:13:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:13:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:13:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:13:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:13:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:13:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:13:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:13:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:13:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:13:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:13:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:42,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:42,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592316042] [2024-11-12 06:13:42,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592316042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:42,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:42,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:13:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188511555] [2024-11-12 06:13:42,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:42,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:13:42,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:42,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:13:42,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:13:42,388 INFO L87 Difference]: Start difference. First operand 320 states and 427 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:42,447 INFO L93 Difference]: Finished difference Result 562 states and 750 transitions. [2024-11-12 06:13:42,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:13:42,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-11-12 06:13:42,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:42,451 INFO L225 Difference]: With dead ends: 562 [2024-11-12 06:13:42,451 INFO L226 Difference]: Without dead ends: 318 [2024-11-12 06:13:42,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:13:42,453 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 56 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:42,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 115 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:42,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-12 06:13:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2024-11-12 06:13:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 221 states have (on average 1.1266968325791855) internal successors, (249), 228 states have internal predecessors, (249), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-12 06:13:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 417 transitions. [2024-11-12 06:13:42,511 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 417 transitions. Word has length 84 [2024-11-12 06:13:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:42,512 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 417 transitions. [2024-11-12 06:13:42,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 417 transitions. [2024-11-12 06:13:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 06:13:42,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:42,515 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:42,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 06:13:42,515 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:42,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1735942787, now seen corresponding path program 1 times [2024-11-12 06:13:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:42,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393980239] [2024-11-12 06:13:42,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:13:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:13:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:13:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:13:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:13:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:13:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:13:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:13:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:13:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:13:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:13:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:42,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:42,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393980239] [2024-11-12 06:13:42,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393980239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:42,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:42,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:13:42,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121727904] [2024-11-12 06:13:42,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:42,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:13:42,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:42,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:13:42,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:13:42,678 INFO L87 Difference]: Start difference. First operand 316 states and 417 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:42,756 INFO L93 Difference]: Finished difference Result 622 states and 820 transitions. [2024-11-12 06:13:42,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:13:42,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-11-12 06:13:42,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:42,761 INFO L225 Difference]: With dead ends: 622 [2024-11-12 06:13:42,761 INFO L226 Difference]: Without dead ends: 309 [2024-11-12 06:13:42,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:13:42,763 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 21 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:42,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 216 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-12 06:13:42,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-12 06:13:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 212 states have (on average 1.0896226415094339) internal successors, (231), 219 states have internal predecessors, (231), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-12 06:13:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 399 transitions. [2024-11-12 06:13:42,831 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 399 transitions. Word has length 84 [2024-11-12 06:13:42,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:42,832 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 399 transitions. [2024-11-12 06:13:42,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 399 transitions. [2024-11-12 06:13:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 06:13:42,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:42,834 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:42,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 06:13:42,834 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:42,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:42,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1406869449, now seen corresponding path program 1 times [2024-11-12 06:13:42,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:42,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626554540] [2024-11-12 06:13:42,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:42,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:13:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:13:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:13:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:13:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:13:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:13:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:13:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:13:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:13:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:13:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:13:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:43,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626554540] [2024-11-12 06:13:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626554540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:43,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:43,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 06:13:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241982906] [2024-11-12 06:13:43,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:43,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 06:13:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:43,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 06:13:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-12 06:13:43,650 INFO L87 Difference]: Start difference. First operand 307 states and 399 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:44,319 INFO L93 Difference]: Finished difference Result 606 states and 788 transitions. [2024-11-12 06:13:44,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 06:13:44,320 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-11-12 06:13:44,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:44,323 INFO L225 Difference]: With dead ends: 606 [2024-11-12 06:13:44,323 INFO L226 Difference]: Without dead ends: 372 [2024-11-12 06:13:44,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-12 06:13:44,325 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:44,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 579 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 06:13:44,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-12 06:13:44,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 316. [2024-11-12 06:13:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 221 states have (on average 1.090497737556561) internal successors, (241), 228 states have internal predecessors, (241), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-12 06:13:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 409 transitions. [2024-11-12 06:13:44,407 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 409 transitions. Word has length 85 [2024-11-12 06:13:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:44,407 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 409 transitions. [2024-11-12 06:13:44,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 409 transitions. [2024-11-12 06:13:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-12 06:13:44,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:44,411 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:44,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 06:13:44,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:44,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1527740812, now seen corresponding path program 1 times [2024-11-12 06:13:44,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:44,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200030061] [2024-11-12 06:13:44,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:44,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:13:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:13:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:13:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:13:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:13:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:13:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:13:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:13:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:13:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:13:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:13:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:44,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:44,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200030061] [2024-11-12 06:13:44,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200030061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:44,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:44,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:13:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789968536] [2024-11-12 06:13:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:44,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:13:44,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:44,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:13:44,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:13:44,468 INFO L87 Difference]: Start difference. First operand 316 states and 409 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:44,559 INFO L93 Difference]: Finished difference Result 663 states and 862 transitions. [2024-11-12 06:13:44,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:13:44,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-11-12 06:13:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:44,566 INFO L225 Difference]: With dead ends: 663 [2024-11-12 06:13:44,566 INFO L226 Difference]: Without dead ends: 420 [2024-11-12 06:13:44,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:13:44,568 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:44,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-12 06:13:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 348. [2024-11-12 06:13:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 239 states have (on average 1.0794979079497908) internal successors, (258), 248 states have internal predecessors, (258), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 87 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-12 06:13:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 450 transitions. [2024-11-12 06:13:44,646 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 450 transitions. Word has length 87 [2024-11-12 06:13:44,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:44,649 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 450 transitions. [2024-11-12 06:13:44,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 450 transitions. [2024-11-12 06:13:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 06:13:44,651 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:44,651 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:44,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 06:13:44,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:44,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:44,652 INFO L85 PathProgramCache]: Analyzing trace with hash -74252023, now seen corresponding path program 1 times [2024-11-12 06:13:44,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:44,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475594273] [2024-11-12 06:13:44,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:44,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:13:44,689 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:13:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:13:44,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:13:44,744 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:13:44,745 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:13:44,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 06:13:44,750 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:44,817 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:13:44,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:13:44 BoogieIcfgContainer [2024-11-12 06:13:44,820 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:13:44,821 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:13:44,821 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:13:44,822 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:13:44,822 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:37" (3/4) ... [2024-11-12 06:13:44,825 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:13:44,826 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:13:44,827 INFO L158 Benchmark]: Toolchain (without parser) took 8261.42ms. Allocated memory was 174.1MB in the beginning and 276.8MB in the end (delta: 102.8MB). Free memory was 106.0MB in the beginning and 127.5MB in the end (delta: -21.5MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2024-11-12 06:13:44,827 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:44,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.82ms. Allocated memory is still 174.1MB. Free memory was 105.9MB in the beginning and 143.7MB in the end (delta: -37.8MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-12 06:13:44,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.35ms. Allocated memory is still 174.1MB. Free memory was 143.7MB in the beginning and 141.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:13:44,828 INFO L158 Benchmark]: Boogie Preprocessor took 52.92ms. Allocated memory is still 174.1MB. Free memory was 141.5MB in the beginning and 139.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:13:44,829 INFO L158 Benchmark]: RCFGBuilder took 488.44ms. Allocated memory is still 174.1MB. Free memory was 139.4MB in the beginning and 124.7MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:13:44,829 INFO L158 Benchmark]: TraceAbstraction took 7343.98ms. Allocated memory was 174.1MB in the beginning and 276.8MB in the end (delta: 102.8MB). Free memory was 124.0MB in the beginning and 127.5MB in the end (delta: -3.5MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2024-11-12 06:13:44,829 INFO L158 Benchmark]: Witness Printer took 5.31ms. Allocated memory is still 276.8MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:44,830 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.20ms. Allocated memory is still 113.2MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.82ms. Allocated memory is still 174.1MB. Free memory was 105.9MB in the beginning and 143.7MB in the end (delta: -37.8MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.35ms. Allocated memory is still 174.1MB. Free memory was 143.7MB in the beginning and 141.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.92ms. Allocated memory is still 174.1MB. Free memory was 141.5MB in the beginning and 139.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 488.44ms. Allocated memory is still 174.1MB. Free memory was 139.4MB in the beginning and 124.7MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7343.98ms. Allocated memory was 174.1MB in the beginning and 276.8MB in the end (delta: 102.8MB). Free memory was 124.0MB in the beginning and 127.5MB in the end (delta: -3.5MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. * Witness Printer took 5.31ms. Allocated memory is still 276.8MB. Free memory is still 127.5MB. 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 bitwiseOr at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 0; [L26] signed char var_1_5 = 4; [L27] signed char var_1_6 = -5; [L28] signed char var_1_7 = 2; [L29] signed char var_1_8 = -32; VAL [isInitial=0, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L68] isInitial = 1 [L69] FCALL initially() [L70] COND TRUE 1 [L71] FCALL updateLastVariables() [L72] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_uchar() [L43] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L43] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L45] var_1_3 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L51] var_1_5 = __VERIFIER_nondet_char() [L52] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=-5, var_1_7=2, var_1_8=-32] [L52] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=-5, var_1_7=2, var_1_8=-32] [L54] var_1_6 = __VERIFIER_nondet_char() [L55] CALL assume_abort_if_not(var_1_6 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=2, var_1_8=-32] [L55] RET assume_abort_if_not(var_1_6 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=2, var_1_8=-32] [L56] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=2, var_1_8=-32] [L56] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=2, var_1_8=-32] [L57] var_1_7 = __VERIFIER_nondet_char() [L58] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L58] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L59] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L59] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L72] RET updateVariables() [L73] CALL step() [L33] COND TRUE (var_1_2 || var_1_3) && var_1_4 [L34] var_1_1 = (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L36] signed char stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=-24, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L37] EXPR (-100 + var_1_1) ^ var_1_1 VAL [isInitial=1, stepLocal_0=-24, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L37] COND FALSE !(stepLocal_0 > ((-100 + var_1_1) ^ var_1_1)) [L73] RET step() [L74] CALL, EXPR property() [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [isInitial=1, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L64] EXPR (-100 + var_1_1) ^ var_1_1 VAL [isInitial=1, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [isInitial=1, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L64-L65] return (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) ; [L74] RET, EXPR property() [L74] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L19] reach_error() VAL [isInitial=1, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 473 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 467 mSDsluCounter, 2471 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1679 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 928 IncrementalHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 792 mSDtfsCounter, 928 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=10, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 182 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 922 NumberOfCodeBlocks, 922 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 823 ConstructedInterpolants, 0 QuantifiedInterpolants, 2328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 2640/2640 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-11-12 06:13:44,868 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.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 e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:13:47,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:13:47,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:13:47,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:13:47,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:13:47,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:13:47,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:13:47,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:13:47,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:13:47,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:13:47,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:13:47,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:13:47,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:13:47,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:13:47,442 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:13:47,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:13:47,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:13:47,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:13:47,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:13:47,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:13:47,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:13:47,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:13:47,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:13:47,445 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:13:47,449 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:13:47,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:13:47,450 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:13:47,450 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:13:47,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:13:47,450 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:13:47,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:13:47,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:13:47,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:13:47,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:13:47,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:47,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:13:47,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:13:47,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:13:47,468 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:13:47,468 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:13:47,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:13:47,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:13:47,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:13:47,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:13:47,470 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 -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2024-11-12 06:13:47,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:13:47,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:13:47,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:13:47,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:13:47,866 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:13:47,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-11-12 06:13:49,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:13:49,802 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:13:49,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-11-12 06:13:49,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c2666bb/0b2b8547b49846f992444e3397123cc7/FLAGbdf86be71 [2024-11-12 06:13:49,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c2666bb/0b2b8547b49846f992444e3397123cc7 [2024-11-12 06:13:49,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:13:49,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:13:49,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:49,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:13:49,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:13:49,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:49" (1/1) ... [2024-11-12 06:13:49,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae5101e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:49, skipping insertion in model container [2024-11-12 06:13:49,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:49" (1/1) ... [2024-11-12 06:13:49,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:13:50,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2024-11-12 06:13:50,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:50,154 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:13:50,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2024-11-12 06:13:50,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:50,213 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:13:50,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50 WrapperNode [2024-11-12 06:13:50,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:50,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:50,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:13:50,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:13:50,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (1/1) ... [2024-11-12 06:13:50,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (1/1) ... [2024-11-12 06:13:50,260 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2024-11-12 06:13:50,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:50,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:13:50,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:13:50,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:13:50,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (1/1) ... [2024-11-12 06:13:50,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (1/1) ... [2024-11-12 06:13:50,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (1/1) ... [2024-11-12 06:13:50,312 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:13:50,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (1/1) ... [2024-11-12 06:13:50,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (1/1) ... [2024-11-12 06:13:50,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (1/1) ... [2024-11-12 06:13:50,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (1/1) ... [2024-11-12 06:13:50,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (1/1) ... [2024-11-12 06:13:50,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (1/1) ... [2024-11-12 06:13:50,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:13:50,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:13:50,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:13:50,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:13:50,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (1/1) ... [2024-11-12 06:13:50,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:50,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:13:50,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:13:50,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:13:50,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:13:50,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:13:50,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:13:50,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:13:50,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:13:50,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:13:50,539 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:13:50,542 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:13:50,735 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:13:50,735 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:13:50,754 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:13:50,755 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:13:50,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:50 BoogieIcfgContainer [2024-11-12 06:13:50,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:13:50,759 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:13:50,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:13:50,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:13:50,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:13:49" (1/3) ... [2024-11-12 06:13:50,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6de684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:50, skipping insertion in model container [2024-11-12 06:13:50,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:50" (2/3) ... [2024-11-12 06:13:50,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6de684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:50, skipping insertion in model container [2024-11-12 06:13:50,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:50" (3/3) ... [2024-11-12 06:13:50,769 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2024-11-12 06:13:50,790 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:13:50,790 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:13:50,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:13:50,888 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;@2317dd9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:13:50,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:13:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:13:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 06:13:50,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:50,908 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:50,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:50,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:50,918 INFO L85 PathProgramCache]: Analyzing trace with hash 971633535, now seen corresponding path program 1 times [2024-11-12 06:13:50,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:13:50,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717468431] [2024-11-12 06:13:50,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:50,937 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-11-12 06:13:50,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:13:50,943 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-11-12 06:13:50,946 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-11-12 06:13:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:51,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:13:51,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:13:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-12 06:13:51,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:13:51,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:13:51,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717468431] [2024-11-12 06:13:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717468431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:51,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:13:51,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660188364] [2024-11-12 06:13:51,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:51,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:13:51,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:13:51,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:13:51,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:13:51,189 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 06:13:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:51,217 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2024-11-12 06:13:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:13:51,221 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-11-12 06:13:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:51,228 INFO L225 Difference]: With dead ends: 73 [2024-11-12 06:13:51,229 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 06:13:51,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:13:51,241 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:51,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 06:13:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 06:13:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:13:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-12 06:13:51,288 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 78 [2024-11-12 06:13:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:51,289 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-12 06:13:51,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 06:13:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-12 06:13:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 06:13:51,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:51,292 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:51,297 INFO L552 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)] Ended with exit code 0 [2024-11-12 06:13:51,493 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-11-12 06:13:51,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:51,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:51,494 INFO L85 PathProgramCache]: Analyzing trace with hash -483648641, now seen corresponding path program 1 times [2024-11-12 06:13:51,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:13:51,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142801383] [2024-11-12 06:13:51,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:51,496 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-11-12 06:13:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:13:51,499 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-11-12 06:13:51,501 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-11-12 06:13:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:51,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 06:13:51,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:13:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:54,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:13:54,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:13:54,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142801383] [2024-11-12 06:13:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142801383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:54,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:54,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:13:54,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195579575] [2024-11-12 06:13:54,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:54,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:13:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:13:54,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:13:54,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:13:54,856 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:55,115 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2024-11-12 06:13:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:13:55,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2024-11-12 06:13:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:55,119 INFO L225 Difference]: With dead ends: 80 [2024-11-12 06:13:55,119 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 06:13:55,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:13:55,121 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:55,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 262 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:13:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 06:13:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2024-11-12 06:13:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:13:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2024-11-12 06:13:55,149 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 78 [2024-11-12 06:13:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:55,149 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2024-11-12 06:13:55,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-11-12 06:13:55,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 06:13:55,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:55,154 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:13:55,160 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 (3)] Forceful destruction successful, exit code 0 [2024-11-12 06:13:55,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-11-12 06:13:55,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:55,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:55,360 INFO L85 PathProgramCache]: Analyzing trace with hash -481801599, now seen corresponding path program 1 times [2024-11-12 06:13:55,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:13:55,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561471462] [2024-11-12 06:13:55,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:55,361 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-11-12 06:13:55,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:13:55,365 INFO L229 MonitoredProcess]: Starting monitored process 4 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-11-12 06:13:55,367 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 (4)] Waiting until timeout for monitored process [2024-11-12 06:13:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:55,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 06:13:55,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:13:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 150 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-12 06:13:58,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:13:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:59,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:13:59,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561471462] [2024-11-12 06:13:59,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561471462] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 06:13:59,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 06:13:59,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2024-11-12 06:13:59,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116930712] [2024-11-12 06:13:59,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:59,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:13:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:13:59,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:13:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-12 06:13:59,814 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:14:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:00,828 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2024-11-12 06:14:00,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 06:14:00,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2024-11-12 06:14:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:00,833 INFO L225 Difference]: With dead ends: 92 [2024-11-12 06:14:00,833 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 06:14:00,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-11-12 06:14:00,835 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 50 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:00,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 267 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 06:14:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 06:14:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2024-11-12 06:14:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:14:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2024-11-12 06:14:00,856 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 78 [2024-11-12 06:14:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:00,856 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2024-11-12 06:14:00,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:14:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2024-11-12 06:14:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 06:14:00,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:00,858 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:14:00,863 INFO L552 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 (4)] Ended with exit code 0 [2024-11-12 06:14:01,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-11-12 06:14:01,060 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:01,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1291358721, now seen corresponding path program 1 times [2024-11-12 06:14:01,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:01,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488009947] [2024-11-12 06:14:01,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:01,062 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-11-12 06:14:01,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:01,065 INFO L229 MonitoredProcess]: Starting monitored process 5 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-11-12 06:14:01,068 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 (5)] Waiting until timeout for monitored process [2024-11-12 06:14:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:01,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 06:14:01,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:14:02,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:14:02,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:02,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488009947] [2024-11-12 06:14:02,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488009947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:02,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:02,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:14:02,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030558867] [2024-11-12 06:14:02,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:02,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:14:02,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:14:02,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:14:02,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:14:02,143 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:14:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:02,240 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-11-12 06:14:02,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:14:02,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2024-11-12 06:14:02,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:02,243 INFO L225 Difference]: With dead ends: 66 [2024-11-12 06:14:02,243 INFO L226 Difference]: Without dead ends: 64 [2024-11-12 06:14:02,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:14:02,245 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 19 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:02,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 200 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:14:02,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-12 06:14:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-11-12 06:14:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:14:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2024-11-12 06:14:02,265 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 78 [2024-11-12 06:14:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:02,265 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2024-11-12 06:14:02,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:14:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2024-11-12 06:14:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 06:14:02,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:02,270 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:14:02,275 INFO L552 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 (5)] Ended with exit code 0 [2024-11-12 06:14:02,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-11-12 06:14:02,471 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:02,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:02,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1293205763, now seen corresponding path program 1 times [2024-11-12 06:14:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:02,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370876437] [2024-11-12 06:14:02,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:02,472 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-11-12 06:14:02,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:02,476 INFO L229 MonitoredProcess]: Starting monitored process 6 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-11-12 06:14:02,477 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 (6)] Waiting until timeout for monitored process [2024-11-12 06:14:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 06:14:02,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-12 06:14:02,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:14:02,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:02,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370876437] [2024-11-12 06:14:02,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370876437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:14:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [915594125] [2024-11-12 06:14:02,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:02,871 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 06:14:02,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 06:14:02,873 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 06:14:02,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-12 06:14:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 06:14:02,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-12 06:14:03,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:14:03,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [915594125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:14:03,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 06:14:03,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-12 06:14:03,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467302136] [2024-11-12 06:14:03,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 06:14:03,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:14:03,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:14:03,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:14:03,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-12 06:14:03,214 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 06:14:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:03,421 INFO L93 Difference]: Finished difference Result 168 states and 223 transitions. [2024-11-12 06:14:03,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 06:14:03,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-11-12 06:14:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:03,426 INFO L225 Difference]: With dead ends: 168 [2024-11-12 06:14:03,426 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 06:14:03,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-12 06:14:03,430 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 24 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:03,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 124 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:14:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 06:14:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2024-11-12 06:14:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 68 states have internal predecessors, (71), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:14:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 143 transitions. [2024-11-12 06:14:03,462 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 143 transitions. Word has length 78 [2024-11-12 06:14:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:03,462 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 143 transitions. [2024-11-12 06:14:03,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 06:14:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 143 transitions. [2024-11-12 06:14:03,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 06:14:03,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:03,468 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:14:03,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-12 06:14:03,673 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 (6)] Forceful destruction successful, exit code 0 [2024-11-12 06:14:03,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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-11-12 06:14:03,870 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:03,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash 287456292, now seen corresponding path program 1 times [2024-11-12 06:14:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:03,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613901001] [2024-11-12 06:14:03,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:03,871 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-11-12 06:14:03,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:03,872 INFO L229 MonitoredProcess]: Starting monitored process 8 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-11-12 06:14:03,873 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 (8)] Waiting until timeout for monitored process [2024-11-12 06:14:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 06:14:03,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 729 proven. 196 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-11-12 06:14:06,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:14:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2024-11-12 06:14:09,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613901001] [2024-11-12 06:14:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613901001] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 06:14:09,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 06:14:09,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2024-11-12 06:14:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855160631] [2024-11-12 06:14:09,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:09,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:14:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:14:09,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:14:09,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-12 06:14:09,921 INFO L87 Difference]: Start difference. First operand 108 states and 143 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:14:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:12,168 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2024-11-12 06:14:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 06:14:12,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 153 [2024-11-12 06:14:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:12,171 INFO L225 Difference]: With dead ends: 111 [2024-11-12 06:14:12,171 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 06:14:12,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2024-11-12 06:14:12,175 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 14 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:12,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 236 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 06:14:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 06:14:12,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 06:14:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 06:14:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 06:14:12,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2024-11-12 06:14:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:12,177 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 06:14:12,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:14:12,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 06:14:12,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 06:14:12,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:14:12,192 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 (8)] Forceful destruction successful, exit code 0 [2024-11-12 06:14:12,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-11-12 06:14:12,385 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 06:14:12,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 06:14:14,156 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:14:14,164 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-12 06:14:14,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-12 06:14:14,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:14:14 BoogieIcfgContainer [2024-11-12 06:14:14,179 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:14:14,180 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:14:14,180 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:14:14,180 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:14:14,181 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:50" (3/4) ... [2024-11-12 06:14:14,183 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 06:14:14,187 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 06:14:14,191 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-12 06:14:14,191 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 06:14:14,192 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 06:14:14,192 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 06:14:14,287 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 06:14:14,288 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 06:14:14,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:14:14,288 INFO L158 Benchmark]: Toolchain (without parser) took 24450.52ms. Allocated memory was 62.9MB in the beginning and 394.3MB in the end (delta: 331.4MB). Free memory was 42.1MB in the beginning and 332.1MB in the end (delta: -290.0MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2024-11-12 06:14:14,289 INFO L158 Benchmark]: CDTParser took 1.47ms. Allocated memory is still 62.9MB. Free memory was 37.7MB in the beginning and 37.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:14:14,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.93ms. Allocated memory is still 62.9MB. Free memory was 41.9MB in the beginning and 28.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:14:14,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.14ms. Allocated memory is still 62.9MB. Free memory was 28.0MB in the beginning and 26.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:14:14,289 INFO L158 Benchmark]: Boogie Preprocessor took 80.17ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 26.2MB in the beginning and 62.9MB in the end (delta: -36.7MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-11-12 06:14:14,289 INFO L158 Benchmark]: RCFGBuilder took 409.74ms. Allocated memory is still 83.9MB. Free memory was 62.9MB in the beginning and 49.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:14:14,290 INFO L158 Benchmark]: TraceAbstraction took 23420.04ms. Allocated memory was 83.9MB in the beginning and 394.3MB in the end (delta: 310.4MB). Free memory was 49.2MB in the beginning and 337.4MB in the end (delta: -288.2MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. [2024-11-12 06:14:14,290 INFO L158 Benchmark]: Witness Printer took 107.95ms. Allocated memory is still 394.3MB. Free memory was 337.4MB in the beginning and 332.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 06:14:14,293 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.47ms. Allocated memory is still 62.9MB. Free memory was 37.7MB in the beginning and 37.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.93ms. Allocated memory is still 62.9MB. Free memory was 41.9MB in the beginning and 28.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.14ms. Allocated memory is still 62.9MB. Free memory was 28.0MB in the beginning and 26.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.17ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 26.2MB in the beginning and 62.9MB in the end (delta: -36.7MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * RCFGBuilder took 409.74ms. Allocated memory is still 83.9MB. Free memory was 62.9MB in the beginning and 49.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23420.04ms. Allocated memory was 83.9MB in the beginning and 394.3MB in the end (delta: 310.4MB). Free memory was 49.2MB in the beginning and 337.4MB in the end (delta: -288.2MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. * Witness Printer took 107.95ms. Allocated memory is still 394.3MB. Free memory was 337.4MB in the beginning and 332.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 1138 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 815 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 393 IncrementalHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 323 mSDtfsCounter, 393 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 929 GetRequests, 861 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=5, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 621 NumberOfCodeBlocks, 621 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 843 ConstructedInterpolants, 82 QuantifiedInterpolants, 5470 SizeOfPredicates, 49 NumberOfNonLiveVariables, 988 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 3858/4108 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((var_1_1 != 1) || (0 != cond)) && (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8)))) RESULT: Ultimate proved your program to be correct! [2024-11-12 06:14:14,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE