./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_amount25_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-64.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8c033995a52b99c0430cec79c98c5775553fa5b7cf687f2e866f081cb29fa4f7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:37:48,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:37:48,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:37:48,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:37:48,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:37:48,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:37:48,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:37:48,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:37:48,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:37:48,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:37:48,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:37:48,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:37:48,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:37:48,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:37:48,265 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:37:48,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:37:48,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:37:48,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:37:48,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:37:48,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:37:48,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:37:48,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:37:48,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:37:48,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:37:48,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:37:48,273 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:37:48,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:37:48,273 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:37:48,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:37:48,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:37:48,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:37:48,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:37:48,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:37:48,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:37:48,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:37:48,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:37:48,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:37:48,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:37:48,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:37:48,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:37:48,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:37:48,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:37:48,280 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-clean/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-clean/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 -> 8c033995a52b99c0430cec79c98c5775553fa5b7cf687f2e866f081cb29fa4f7 [2024-10-11 12:37:48,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:37:48,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:37:48,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:37:48,583 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:37:48,584 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:37:48,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-64.i [2024-10-11 12:37:50,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:37:50,341 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:37:50,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-64.i [2024-10-11 12:37:50,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3442f7e00/ae687302fd064ad4a7080789c1296872/FLAG38f40cd73 [2024-10-11 12:37:50,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3442f7e00/ae687302fd064ad4a7080789c1296872 [2024-10-11 12:37:50,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:37:50,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:37:50,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:37:50,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:37:50,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:37:50,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:37:50" (1/1) ... [2024-10-11 12:37:50,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d0d84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:50, skipping insertion in model container [2024-10-11 12:37:50,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:37:50" (1/1) ... [2024-10-11 12:37:50,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:37:50,940 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_amount25_file-64.i[915,928] [2024-10-11 12:37:51,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:37:51,017 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:37:51,029 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_amount25_file-64.i[915,928] [2024-10-11 12:37:51,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:37:51,089 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:37:51,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51 WrapperNode [2024-10-11 12:37:51,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:37:51,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:37:51,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:37:51,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:37:51,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (1/1) ... [2024-10-11 12:37:51,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (1/1) ... [2024-10-11 12:37:51,150 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-11 12:37:51,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:37:51,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:37:51,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:37:51,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:37:51,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (1/1) ... [2024-10-11 12:37:51,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (1/1) ... [2024-10-11 12:37:51,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (1/1) ... [2024-10-11 12:37:51,220 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-11 12:37:51,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (1/1) ... [2024-10-11 12:37:51,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (1/1) ... [2024-10-11 12:37:51,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (1/1) ... [2024-10-11 12:37:51,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (1/1) ... [2024-10-11 12:37:51,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (1/1) ... [2024-10-11 12:37:51,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (1/1) ... [2024-10-11 12:37:51,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:37:51,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:37:51,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:37:51,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:37:51,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (1/1) ... [2024-10-11 12:37:51,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:37:51,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:37:51,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:37:51,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:37:51,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:37:51,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:37:51,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:37:51,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:37:51,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:37:51,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:37:51,458 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:37:51,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:37:51,868 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 12:37:51,869 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:37:51,910 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:37:51,910 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:37:51,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:37:51 BoogieIcfgContainer [2024-10-11 12:37:51,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:37:51,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:37:51,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:37:51,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:37:51,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:37:50" (1/3) ... [2024-10-11 12:37:51,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65523bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:37:51, skipping insertion in model container [2024-10-11 12:37:51,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:51" (2/3) ... [2024-10-11 12:37:51,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65523bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:37:51, skipping insertion in model container [2024-10-11 12:37:51,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:37:51" (3/3) ... [2024-10-11 12:37:51,928 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-64.i [2024-10-11 12:37:51,948 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:37:51,948 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:37:52,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:37:52,031 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;@3d61e700, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:37:52,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:37:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 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-10-11 12:37:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 12:37:52,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:37:52,047 INFO L215 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-10-11 12:37:52,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:37:52,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:37:52,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2133954647, now seen corresponding path program 1 times [2024-10-11 12:37:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:37:52,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143508779] [2024-10-11 12:37:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:52,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:37:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:37:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:37:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:37:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:37:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:37:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:37:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:37:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:37:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:37:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:37:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:37:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:37:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:37:52,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:37:52,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143508779] [2024-10-11 12:37:52,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143508779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:37:52,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:37:52,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:37:52,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422330057] [2024-10-11 12:37:52,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:37:52,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:37:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:37:52,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:37:52,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:37:52,403 INFO L87 Difference]: Start difference. First operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-10-11 12:37:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:37:52,436 INFO L93 Difference]: Finished difference Result 91 states and 152 transitions. [2024-10-11 12:37:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:37:52,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 78 [2024-10-11 12:37:52,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:37:52,444 INFO L225 Difference]: With dead ends: 91 [2024-10-11 12:37:52,445 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 12:37:52,448 INFO L431 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-10-11 12:37:52,451 INFO L432 NwaCegarLoop]: 60 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, 60 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-11 12:37:52,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:37:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 12:37:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 12:37:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-10-11 12:37:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-10-11 12:37:52,486 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 78 [2024-10-11 12:37:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:37:52,486 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-10-11 12:37:52,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-10-11 12:37:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-10-11 12:37:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 12:37:52,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:37:52,490 INFO L215 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-10-11 12:37:52,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:37:52,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:37:52,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:37:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash 63175209, now seen corresponding path program 1 times [2024-10-11 12:37:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:37:52,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477338574] [2024-10-11 12:37:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:52,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:37:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:37:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:37:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:37:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:37:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:37:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:37:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:37:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:37:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:37:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:37:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:37:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:37:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:37:52,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:37:52,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477338574] [2024-10-11 12:37:52,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477338574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:37:52,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:37:52,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:37:52,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659020378] [2024-10-11 12:37:52,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:37:52,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:37:52,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:37:52,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:37:52,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:37:52,940 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-10-11 12:37:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:37:53,161 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2024-10-11 12:37:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:37:53,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-10-11 12:37:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:37:53,166 INFO L225 Difference]: With dead ends: 127 [2024-10-11 12:37:53,166 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 12:37:53,167 INFO L431 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-10-11 12:37:53,168 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:37:53,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 117 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:37:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 12:37:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2024-10-11 12:37:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 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-10-11 12:37:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-10-11 12:37:53,186 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 78 [2024-10-11 12:37:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:37:53,187 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-10-11 12:37:53,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-10-11 12:37:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-10-11 12:37:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 12:37:53,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:37:53,190 INFO L215 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] [2024-10-11 12:37:53,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:37:53,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:37:53,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:37:53,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1071830407, now seen corresponding path program 1 times [2024-10-11 12:37:53,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:37:53,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998525403] [2024-10-11 12:37:53,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:53,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:37:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:37:53,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062974579] [2024-10-11 12:37:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:53,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:37:53,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:37:53,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:37:53,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:37:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:53,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 12:37:53,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:37:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 12:37:53,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:37:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:37:53,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:37:53,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998525403] [2024-10-11 12:37:53,924 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 12:37:53,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062974579] [2024-10-11 12:37:53,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062974579] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 12:37:53,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 12:37:53,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-11 12:37:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187157459] [2024-10-11 12:37:53,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:37:53,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:37:53,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:37:53,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:37:53,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:37:53,929 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10-11 12:37:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:37:54,404 INFO L93 Difference]: Finished difference Result 115 states and 163 transitions. [2024-10-11 12:37:54,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:37:54,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 79 [2024-10-11 12:37:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:37:54,408 INFO L225 Difference]: With dead ends: 115 [2024-10-11 12:37:54,408 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 12:37:54,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 12:37:54,411 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:37:54,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 134 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:37:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 12:37:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2024-10-11 12:37:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 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-10-11 12:37:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2024-10-11 12:37:54,421 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 79 [2024-10-11 12:37:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:37:54,422 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2024-10-11 12:37:54,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10-11 12:37:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2024-10-11 12:37:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 12:37:54,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:37:54,424 INFO L215 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] [2024-10-11 12:37:54,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 12:37:54,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:37:54,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:37:54,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:37:54,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1014572105, now seen corresponding path program 1 times [2024-10-11 12:37:54,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:37:54,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042842825] [2024-10-11 12:37:54,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:54,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:37:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:37:54,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1048656016] [2024-10-11 12:37:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:54,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:37:54,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:37:54,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:37:54,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 12:37:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:37:54,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:37:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:37:54,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:37:54,858 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:37:54,859 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:37:54,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 12:37:55,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:37:55,070 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 12:37:55,155 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:37:55,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:37:55 BoogieIcfgContainer [2024-10-11 12:37:55,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:37:55,160 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:37:55,161 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:37:55,161 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:37:55,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:37:51" (3/4) ... [2024-10-11 12:37:55,164 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:37:55,165 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:37:55,166 INFO L158 Benchmark]: Toolchain (without parser) took 4452.28ms. Allocated memory is still 176.2MB. Free memory was 108.1MB in the beginning and 59.0MB in the end (delta: 49.1MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-10-11 12:37:55,166 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory was 134.0MB in the beginning and 133.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:37:55,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.23ms. Allocated memory is still 176.2MB. Free memory was 107.9MB in the beginning and 94.2MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:37:55,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.29ms. Allocated memory is still 176.2MB. Free memory was 94.0MB in the beginning and 90.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:37:55,167 INFO L158 Benchmark]: Boogie Preprocessor took 106.69ms. Allocated memory is still 176.2MB. Free memory was 90.8MB in the beginning and 146.8MB in the end (delta: -56.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-11 12:37:55,167 INFO L158 Benchmark]: RCFGBuilder took 652.34ms. Allocated memory is still 176.2MB. Free memory was 146.8MB in the beginning and 125.2MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 12:37:55,168 INFO L158 Benchmark]: TraceAbstraction took 3239.40ms. Allocated memory is still 176.2MB. Free memory was 124.5MB in the beginning and 59.0MB in the end (delta: 65.4MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2024-10-11 12:37:55,168 INFO L158 Benchmark]: Witness Printer took 5.13ms. Allocated memory is still 176.2MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:37:55,169 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.18ms. Allocated memory is still 176.2MB. Free memory was 134.0MB in the beginning and 133.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.23ms. Allocated memory is still 176.2MB. Free memory was 107.9MB in the beginning and 94.2MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.29ms. Allocated memory is still 176.2MB. Free memory was 94.0MB in the beginning and 90.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.69ms. Allocated memory is still 176.2MB. Free memory was 90.8MB in the beginning and 146.8MB in the end (delta: -56.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * RCFGBuilder took 652.34ms. Allocated memory is still 176.2MB. Free memory was 146.8MB in the beginning and 125.2MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3239.40ms. Allocated memory is still 176.2MB. Free memory was 124.5MB in the beginning and 59.0MB in the end (delta: 65.4MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. * Witness Printer took 5.13ms. Allocated memory is still 176.2MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 0.9; [L23] unsigned long int var_1_3 = 2941876006; [L24] double var_1_5 = 127.422; [L25] unsigned short int var_1_6 = 10; [L26] unsigned char var_1_7 = 1; [L27] unsigned long int var_1_9 = 4; [L28] unsigned short int var_1_11 = 44699; [L29] signed short int var_1_13 = 2; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 16; [L32] float var_1_17 = 8.125; [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] FCALL updateLastVariables() [L90] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L61] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L62] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L62] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L63] var_1_5 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=1, var_1_9=4] [L64] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=1, var_1_9=4] [L65] var_1_7 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_9=4] [L66] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_9=4] [L67] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=4] [L67] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=4] [L68] var_1_9 = __VERIFIER_nondet_ulong() [L69] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L69] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L70] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L70] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L71] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L71] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L72] var_1_11 = __VERIFIER_nondet_ushort() [L73] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L73] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L74] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L75] var_1_16 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L76] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L77] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L90] RET updateVariables() [L91] CALL step() [L36] var_1_15 = var_1_16 [L37] var_1_17 = var_1_5 VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=10, var_1_7=0, var_1_9=1] [L38] EXPR var_1_15 & var_1_15 VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=10, var_1_7=0, var_1_9=1] [L38] unsigned long int stepLocal_2 = var_1_3 * (var_1_15 & var_1_15); [L39] COND FALSE !(\read(var_1_7)) [L46] var_1_6 = (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1) VAL [isInitial=1, stepLocal_2=0, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L48] var_1_13 = var_1_15 [L49] signed long int stepLocal_1 = var_1_6 * var_1_15; [L50] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L51] COND TRUE stepLocal_0 <= (var_1_3 - var_1_6) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L52] COND FALSE !(var_1_3 < stepLocal_1) [L55] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_2=0, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L91] RET step() [L92] CALL, EXPR property() [L82] EXPR ((var_1_15 <= (var_1_3 - var_1_6)) ? ((var_1_3 < (var_1_6 * var_1_15)) ? (var_1_1 == ((double) var_1_5)) : (var_1_1 == ((double) var_1_5))) : 1) && (var_1_7 ? (((var_1_3 * (var_1_15 & var_1_15)) <= (var_1_15 / var_1_9)) ? (var_1_6 == ((unsigned short int) (47342 - var_1_15))) : (var_1_6 == ((unsigned short int) (var_1_11 - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) : (var_1_6 == ((unsigned short int) (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1)))) VAL [isInitial=1, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L82-L83] return (((((var_1_15 <= (var_1_3 - var_1_6)) ? ((var_1_3 < (var_1_6 * var_1_15)) ? (var_1_1 == ((double) var_1_5)) : (var_1_1 == ((double) var_1_5))) : 1) && (var_1_7 ? (((var_1_3 * (var_1_15 & var_1_15)) <= (var_1_15 / var_1_9)) ? (var_1_6 == ((unsigned short int) (47342 - var_1_15))) : (var_1_6 == ((unsigned short int) (var_1_11 - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) : (var_1_6 == ((unsigned short int) (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1))))) && (var_1_13 == ((signed short int) var_1_15))) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((float) var_1_5)) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 311 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 160 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 310 ConstructedInterpolants, 3 QuantifiedInterpolants, 701 SizeOfPredicates, 4 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1023/1056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:37:55,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-64.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8c033995a52b99c0430cec79c98c5775553fa5b7cf687f2e866f081cb29fa4f7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:37:57,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:37:57,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:37:57,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:37:57,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:37:57,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:37:57,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:37:57,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:37:57,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:37:57,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:37:57,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:37:57,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:37:57,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:37:57,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:37:57,638 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:37:57,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:37:57,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:37:57,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:37:57,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:37:57,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:37:57,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:37:57,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:37:57,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:37:57,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:37:57,642 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:37:57,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:37:57,643 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:37:57,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:37:57,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:37:57,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:37:57,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:37:57,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:37:57,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:37:57,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:37:57,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:37:57,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:37:57,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:37:57,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:37:57,647 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:37:57,648 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:37:57,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:37:57,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:37:57,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:37:57,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:37:57,649 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:37:57,649 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-clean/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-clean/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 -> 8c033995a52b99c0430cec79c98c5775553fa5b7cf687f2e866f081cb29fa4f7 [2024-10-11 12:37:58,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:37:58,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:37:58,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:37:58,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:37:58,032 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:37:58,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-64.i [2024-10-11 12:37:59,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:37:59,812 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:37:59,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-64.i [2024-10-11 12:37:59,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/127d1d0cc/a45905dda81e4a9c8753ea14da923f5b/FLAG371f4fe80 [2024-10-11 12:37:59,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/127d1d0cc/a45905dda81e4a9c8753ea14da923f5b [2024-10-11 12:37:59,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:37:59,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:37:59,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:37:59,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:37:59,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:37:59,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:37:59" (1/1) ... [2024-10-11 12:37:59,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5476145d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:59, skipping insertion in model container [2024-10-11 12:37:59,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:37:59" (1/1) ... [2024-10-11 12:37:59,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:38:00,065 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_amount25_file-64.i[915,928] [2024-10-11 12:38:00,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:38:00,138 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:38:00,151 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_amount25_file-64.i[915,928] [2024-10-11 12:38:00,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:38:00,200 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:38:00,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00 WrapperNode [2024-10-11 12:38:00,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:38:00,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:38:00,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:38:00,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:38:00,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (1/1) ... [2024-10-11 12:38:00,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (1/1) ... [2024-10-11 12:38:00,258 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-10-11 12:38:00,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:38:00,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:38:00,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:38:00,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:38:00,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (1/1) ... [2024-10-11 12:38:00,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (1/1) ... [2024-10-11 12:38:00,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (1/1) ... [2024-10-11 12:38:00,316 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-11 12:38:00,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (1/1) ... [2024-10-11 12:38:00,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (1/1) ... [2024-10-11 12:38:00,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (1/1) ... [2024-10-11 12:38:00,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (1/1) ... [2024-10-11 12:38:00,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (1/1) ... [2024-10-11 12:38:00,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (1/1) ... [2024-10-11 12:38:00,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:38:00,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:38:00,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:38:00,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:38:00,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (1/1) ... [2024-10-11 12:38:00,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:38:00,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:38:00,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:38:00,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:38:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:38:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:38:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:38:00,442 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:38:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:38:00,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:38:00,533 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:38:00,535 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:38:01,146 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 12:38:01,146 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:38:01,213 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:38:01,215 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:38:01,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:38:01 BoogieIcfgContainer [2024-10-11 12:38:01,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:38:01,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:38:01,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:38:01,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:38:01,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:37:59" (1/3) ... [2024-10-11 12:38:01,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64622a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:38:01, skipping insertion in model container [2024-10-11 12:38:01,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:00" (2/3) ... [2024-10-11 12:38:01,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64622a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:38:01, skipping insertion in model container [2024-10-11 12:38:01,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:38:01" (3/3) ... [2024-10-11 12:38:01,228 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-64.i [2024-10-11 12:38:01,246 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:38:01,246 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:38:01,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:38:01,322 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;@52a07fa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:38:01,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:38:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 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-10-11 12:38:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 12:38:01,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:01,341 INFO L215 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] [2024-10-11 12:38:01,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:01,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:01,347 INFO L85 PathProgramCache]: Analyzing trace with hash -795653600, now seen corresponding path program 1 times [2024-10-11 12:38:01,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:38:01,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710711871] [2024-10-11 12:38:01,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:01,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:38:01,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:38:01,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:38:01,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:38:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:01,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:38:01,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:38:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-11 12:38:01,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:38:01,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:38:01,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710711871] [2024-10-11 12:38:01,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710711871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:38:01,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:38:01,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:38:01,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289144227] [2024-10-11 12:38:01,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:38:01,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:38:01,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:38:01,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:38:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:38:01,677 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:38:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:38:02,047 INFO L93 Difference]: Finished difference Result 69 states and 118 transitions. [2024-10-11 12:38:02,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:38:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-11 12:38:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:38:02,067 INFO L225 Difference]: With dead ends: 69 [2024-10-11 12:38:02,067 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 12:38:02,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 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-11 12:38:02,074 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:38:02,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:38:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 12:38:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-11 12:38:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.25) internal successors, (25), 20 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-10-11 12:38:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2024-10-11 12:38:02,125 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 74 [2024-10-11 12:38:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:38:02,125 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2024-10-11 12:38:02,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 12:38:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2024-10-11 12:38:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 12:38:02,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:02,129 INFO L215 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] [2024-10-11 12:38:02,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:38:02,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:38:02,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:02,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1930292064, now seen corresponding path program 1 times [2024-10-11 12:38:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:38:02,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460944902] [2024-10-11 12:38:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:02,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:38:02,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:38:02,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:38:02,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:38:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:02,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:38:02,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:38:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 12:38:02,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:38:03,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:38:03,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460944902] [2024-10-11 12:38:03,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460944902] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:38:03,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1065559377] [2024-10-11 12:38:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:03,037 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 12:38:03,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 12:38:03,041 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 12:38:03,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 12:38:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:03,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 12:38:03,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:38:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 12:38:03,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:38:03,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1065559377] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:38:03,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:38:03,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-11 12:38:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011408683] [2024-10-11 12:38:03,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:38:03,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:38:03,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:38:03,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:38:03,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:38:03,865 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 12:38:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:38:04,849 INFO L93 Difference]: Finished difference Result 82 states and 113 transitions. [2024-10-11 12:38:04,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 12:38:04,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2024-10-11 12:38:04,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:38:04,868 INFO L225 Difference]: With dead ends: 82 [2024-10-11 12:38:04,868 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 12:38:04,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:38:04,870 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 12:38:04,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 69 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 12:38:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 12:38:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2024-10-11 12:38:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 12:38:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-10-11 12:38:04,882 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 74 [2024-10-11 12:38:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:38:04,883 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-10-11 12:38:04,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 12:38:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-10-11 12:38:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 12:38:04,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:04,885 INFO L215 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] [2024-10-11 12:38:04,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 12:38:05,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-10-11 12:38:05,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 12:38:05,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:05,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash 281272175, now seen corresponding path program 1 times [2024-10-11 12:38:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:38:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469135722] [2024-10-11 12:38:05,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:05,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:38:05,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:38:05,292 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:38:05,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:38:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:05,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:38:05,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:38:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 12:38:05,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:38:05,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:38:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469135722] [2024-10-11 12:38:05,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469135722] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:38:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1185451483] [2024-10-11 12:38:05,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:05,963 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 12:38:05,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 12:38:05,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 12:38:05,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 12:38:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:06,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 12:38:06,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:38:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 12:38:06,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:38:06,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1185451483] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:38:06,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:38:06,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-11 12:38:06,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438632917] [2024-10-11 12:38:06,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:38:06,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:38:06,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:38:06,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:38:06,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:38:06,644 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 12:38:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:38:07,861 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2024-10-11 12:38:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 12:38:07,872 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 75 [2024-10-11 12:38:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:38:07,873 INFO L225 Difference]: With dead ends: 77 [2024-10-11 12:38:07,873 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 12:38:07,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:38:07,876 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:38:07,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 75 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 12:38:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 12:38:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-11 12:38:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 12:38:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-10-11 12:38:07,886 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 75 [2024-10-11 12:38:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:38:07,887 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-10-11 12:38:07,887 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 12:38:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-10-11 12:38:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 12:38:07,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:07,889 INFO L215 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] [2024-10-11 12:38:07,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-11 12:38:08,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 12:38:08,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:38:08,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:08,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash 281331757, now seen corresponding path program 1 times [2024-10-11 12:38:08,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:38:08,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592919148] [2024-10-11 12:38:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:08,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:38:08,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:38:08,295 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:38:08,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Waiting until timeout for monitored process [2024-10-11 12:38:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:08,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 12:38:08,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:38:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-11 12:38:29,132 INFO L311 TraceCheckSpWp]: Computing backward predicates...