./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-78.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 9eace40a5bfc748d79d918840a33885e3923058b3c61ac895b0c4200f609a10f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:28:43,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:28:43,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:28:43,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:28:43,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:28:43,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:28:43,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:28:43,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:28:43,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:28:43,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:28:43,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:28:43,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:28:43,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:28:43,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:28:43,592 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:28:43,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:28:43,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:28:43,596 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:28:43,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:28:43,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:28:43,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:28:43,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:28:43,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:28:43,601 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:28:43,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:28:43,605 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:28:43,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:28:43,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:28:43,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:28:43,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:28:43,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:28:43,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:28:43,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:28:43,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:28:43,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:28:43,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:28:43,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:28:43,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:28:43,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:28:43,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:28:43,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:28:43,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:28:43,612 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 -> 9eace40a5bfc748d79d918840a33885e3923058b3c61ac895b0c4200f609a10f [2024-10-14 12:28:43,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:28:43,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:28:43,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:28:43,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:28:43,899 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:28:43,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-78.i [2024-10-14 12:28:45,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:28:45,599 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:28:45,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-78.i [2024-10-14 12:28:45,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a95aa5960/4282eba18abb487bb111d28f40974c31/FLAG7f166ee90 [2024-10-14 12:28:45,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a95aa5960/4282eba18abb487bb111d28f40974c31 [2024-10-14 12:28:45,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:28:45,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:28:45,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:28:45,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:28:45,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:28:45,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:45,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e953f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45, skipping insertion in model container [2024-10-14 12:28:45,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:45,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:28:45,823 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-78.i[915,928] [2024-10-14 12:28:45,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:28:45,873 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:28:45,888 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-78.i[915,928] [2024-10-14 12:28:45,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:28:45,930 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:28:45,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45 WrapperNode [2024-10-14 12:28:45,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:28:45,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:28:45,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:28:45,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:28:45,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:45,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:45,981 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2024-10-14 12:28:45,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:28:45,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:28:45,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:28:45,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:28:45,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:45,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:45,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:46,027 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 12:28:46,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:46,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:46,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:46,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:46,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:46,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:46,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:28:46,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:28:46,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:28:46,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:28:46,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (1/1) ... [2024-10-14 12:28:46,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:28:46,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:28:46,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:28:46,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:28:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:28:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:28:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:28:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:28:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:28:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:28:46,220 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:28:46,222 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:28:46,480 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 12:28:46,483 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:28:46,525 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:28:46,527 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:28:46,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:46 BoogieIcfgContainer [2024-10-14 12:28:46,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:28:46,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:28:46,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:28:46,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:28:46,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:28:45" (1/3) ... [2024-10-14 12:28:46,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28805be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:28:46, skipping insertion in model container [2024-10-14 12:28:46,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:45" (2/3) ... [2024-10-14 12:28:46,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28805be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:28:46, skipping insertion in model container [2024-10-14 12:28:46,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:46" (3/3) ... [2024-10-14 12:28:46,539 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-78.i [2024-10-14 12:28:46,557 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:28:46,558 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:28:46,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:28:46,624 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;@cb5c350, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:28:46,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:28:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 12:28:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 12:28:46,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:46,637 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:46,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:46,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:46,645 INFO L85 PathProgramCache]: Analyzing trace with hash 362922480, now seen corresponding path program 1 times [2024-10-14 12:28:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:46,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345626257] [2024-10-14 12:28:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:46,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:46,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:46,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:46,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:46,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:46,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:46,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 12:28:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345626257] [2024-10-14 12:28:46,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345626257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:46,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:46,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:28:46,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089400927] [2024-10-14 12:28:46,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:46,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:28:46,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:46,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:28:46,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:28:46,986 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 12:28:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:47,024 INFO L93 Difference]: Finished difference Result 59 states and 100 transitions. [2024-10-14 12:28:47,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:28:47,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 61 [2024-10-14 12:28:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:47,036 INFO L225 Difference]: With dead ends: 59 [2024-10-14 12:28:47,036 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 12:28:47,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:28:47,043 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:47,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:28:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 12:28:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 12:28:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 12:28:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2024-10-14 12:28:47,091 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 61 [2024-10-14 12:28:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:47,093 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2024-10-14 12:28:47,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 12:28:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2024-10-14 12:28:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 12:28:47,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:47,097 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:47,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:28:47,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:47,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1473616048, now seen corresponding path program 1 times [2024-10-14 12:28:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:47,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606837006] [2024-10-14 12:28:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:47,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:47,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:47,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:47,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:47,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:47,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:47,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:47,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 12:28:47,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:47,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606837006] [2024-10-14 12:28:47,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606837006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:47,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:47,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:28:47,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105900942] [2024-10-14 12:28:47,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:47,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:28:47,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:47,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:28:47,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:28:47,931 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:28:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:48,018 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2024-10-14 12:28:48,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:28:48,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 61 [2024-10-14 12:28:48,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:48,020 INFO L225 Difference]: With dead ends: 35 [2024-10-14 12:28:48,020 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 12:28:48,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-10-14 12:28:48,021 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:48,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 99 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:28:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 12:28:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-14 12:28:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 12:28:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2024-10-14 12:28:48,039 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 61 [2024-10-14 12:28:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:48,042 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2024-10-14 12:28:48,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:28:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2024-10-14 12:28:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 12:28:48,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:48,045 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:48,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:28:48,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:48,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:48,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1576467664, now seen corresponding path program 1 times [2024-10-14 12:28:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:48,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634619233] [2024-10-14 12:28:48,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:48,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:48,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:48,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:48,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:48,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:48,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:48,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:48,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:48,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 12:28:48,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:48,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634619233] [2024-10-14 12:28:48,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634619233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:48,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:48,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:28:48,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053972792] [2024-10-14 12:28:48,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:48,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:28:48,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:48,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:28:48,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:28:48,649 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:28:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:48,781 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-10-14 12:28:48,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:28:48,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 62 [2024-10-14 12:28:48,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:48,783 INFO L225 Difference]: With dead ends: 37 [2024-10-14 12:28:48,784 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 12:28:48,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 12:28:48,785 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:48,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 127 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:28:48,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 12:28:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-10-14 12:28:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 12:28:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2024-10-14 12:28:48,799 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 62 [2024-10-14 12:28:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:48,800 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2024-10-14 12:28:48,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:28:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2024-10-14 12:28:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 12:28:48,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:48,803 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:48,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:28:48,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:48,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1625780454, now seen corresponding path program 1 times [2024-10-14 12:28:48,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:48,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285764196] [2024-10-14 12:28:48,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 12:28:49,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:49,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285764196] [2024-10-14 12:28:49,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285764196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:49,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:49,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:28:49,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464654722] [2024-10-14 12:28:49,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:49,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:28:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:28:49,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:28:49,102 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:28:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:49,209 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2024-10-14 12:28:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:28:49,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 63 [2024-10-14 12:28:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:49,211 INFO L225 Difference]: With dead ends: 41 [2024-10-14 12:28:49,212 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 12:28:49,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:28:49,213 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:49,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 127 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:28:49,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 12:28:49,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2024-10-14 12:28:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 12:28:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2024-10-14 12:28:49,223 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 63 [2024-10-14 12:28:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:49,223 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2024-10-14 12:28:49,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:28:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2024-10-14 12:28:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 12:28:49,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:49,225 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:49,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 12:28:49,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:49,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:49,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1625720872, now seen corresponding path program 1 times [2024-10-14 12:28:49,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:49,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469547041] [2024-10-14 12:28:49,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:49,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 12:28:49,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:49,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469547041] [2024-10-14 12:28:49,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469547041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:49,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:49,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:28:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588759702] [2024-10-14 12:28:49,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:49,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:28:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:49,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:28:49,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:28:49,518 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:28:49,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:49,598 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-10-14 12:28:49,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:28:49,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 63 [2024-10-14 12:28:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:49,600 INFO L225 Difference]: With dead ends: 38 [2024-10-14 12:28:49,600 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 12:28:49,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:28:49,602 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:49,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 126 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:28:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 12:28:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 12:28:49,605 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-10-14 12:28:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 12:28:49,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2024-10-14 12:28:49,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:49,606 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 12:28:49,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:28:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 12:28:49,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 12:28:49,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 12:28:49,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 12:28:49,613 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 12:28:49,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 12:28:49,634 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 12:28:49,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:28:49 BoogieIcfgContainer [2024-10-14 12:28:49,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 12:28:49,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 12:28:49,651 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 12:28:49,651 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 12:28:49,652 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:46" (3/4) ... [2024-10-14 12:28:49,654 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 12:28:49,657 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 12:28:49,663 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-14 12:28:49,663 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 12:28:49,663 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 12:28:49,664 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 12:28:49,755 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 12:28:49,755 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 12:28:49,755 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 12:28:49,756 INFO L158 Benchmark]: Toolchain (without parser) took 4128.02ms. Allocated memory was 125.8MB in the beginning and 203.4MB in the end (delta: 77.6MB). Free memory was 55.6MB in the beginning and 171.7MB in the end (delta: -116.1MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2024-10-14 12:28:49,756 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 86.5MB in the beginning and 86.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:28:49,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.02ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 55.2MB in the beginning and 131.8MB in the end (delta: -76.6MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-10-14 12:28:49,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.58ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 129.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:28:49,757 INFO L158 Benchmark]: Boogie Preprocessor took 67.35ms. Allocated memory is still 163.6MB. Free memory was 129.8MB in the beginning and 127.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:28:49,757 INFO L158 Benchmark]: RCFGBuilder took 477.44ms. Allocated memory is still 163.6MB. Free memory was 127.7MB in the beginning and 113.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 12:28:49,758 INFO L158 Benchmark]: TraceAbstraction took 3120.41ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 111.6MB in the beginning and 57.1MB in the end (delta: 54.6MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2024-10-14 12:28:49,758 INFO L158 Benchmark]: Witness Printer took 104.56ms. Allocated memory is still 203.4MB. Free memory was 56.1MB in the beginning and 171.7MB in the end (delta: -115.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 12:28:49,760 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.17ms. Allocated memory is still 125.8MB. Free memory was 86.5MB in the beginning and 86.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.02ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 55.2MB in the beginning and 131.8MB in the end (delta: -76.6MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.58ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 129.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.35ms. Allocated memory is still 163.6MB. Free memory was 129.8MB in the beginning and 127.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 477.44ms. Allocated memory is still 163.6MB. Free memory was 127.7MB in the beginning and 113.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3120.41ms. Allocated memory was 163.6MB in the beginning and 203.4MB in the end (delta: 39.8MB). Free memory was 111.6MB in the beginning and 57.1MB in the end (delta: 54.6MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. * Witness Printer took 104.56ms. Allocated memory is still 203.4MB. Free memory was 56.1MB in the beginning and 171.7MB in the end (delta: -115.6MB). Peak memory consumption was 4.2MB. 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 - 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 517 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 333 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 184 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 621 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 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: 1 RESULT: Ultimate proved your program to be correct! [2024-10-14 12:28:49,793 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