./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-86.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_amount10_file-86.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 248e9a660b5341ec0894e1aed13dbcc752507598fe574e15afae8cc67f5cac10 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:21:33,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:21:33,734 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:21:33,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:21:33,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:21:33,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:21:33,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:21:33,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:21:33,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:21:33,769 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:21:33,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:21:33,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:21:33,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:21:33,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:21:33,773 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:21:33,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:21:33,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:21:33,776 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:21:33,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:21:33,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:21:33,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:21:33,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:21:33,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:21:33,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:21:33,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:21:33,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:21:33,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:21:33,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:21:33,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:21:33,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:21:33,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:21:33,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:21:33,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:21:33,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:21:33,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:21:33,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:21:33,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:21:33,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:21:33,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:21:33,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:21:33,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:21:33,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:21:33,787 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 -> 248e9a660b5341ec0894e1aed13dbcc752507598fe574e15afae8cc67f5cac10 [2024-10-11 12:21:34,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:21:34,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:21:34,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:21:34,088 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:21:34,089 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:21:34,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-86.i [2024-10-11 12:21:35,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:21:35,792 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:21:35,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-86.i [2024-10-11 12:21:35,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/188892f6b/b5ff41f8ea334e9fa5ee0239141b5ab3/FLAG792b00a3d [2024-10-11 12:21:36,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/188892f6b/b5ff41f8ea334e9fa5ee0239141b5ab3 [2024-10-11 12:21:36,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:21:36,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:21:36,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:21:36,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:21:36,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:21:36,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65db3b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36, skipping insertion in model container [2024-10-11 12:21:36,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:21:36,386 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-86.i[915,928] [2024-10-11 12:21:36,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:21:36,423 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:21:36,436 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-86.i[915,928] [2024-10-11 12:21:36,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:21:36,476 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:21:36,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36 WrapperNode [2024-10-11 12:21:36,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:21:36,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:21:36,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:21:36,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:21:36,485 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:21:36" (1/1) ... [2024-10-11 12:21:36,493 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:21:36" (1/1) ... [2024-10-11 12:21:36,512 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 64 [2024-10-11 12:21:36,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:21:36,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:21:36,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:21:36,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:21:36,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,560 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:21:36,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:21:36,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:21:36,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:21:36,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:21:36,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:21:36,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:21:36,626 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:21:36,629 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:21:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:21:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:21:36,678 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:21:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:21:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:21:36,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:21:36,739 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:21:36,741 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:21:36,875 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:21:36,876 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:21:36,941 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:21:36,942 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:21:36,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:36 BoogieIcfgContainer [2024-10-11 12:21:36,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:21:36,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:21:36,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:21:36,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:21:36,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:21:36" (1/3) ... [2024-10-11 12:21:36,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd745a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:36, skipping insertion in model container [2024-10-11 12:21:36,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (2/3) ... [2024-10-11 12:21:36,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd745a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:36, skipping insertion in model container [2024-10-11 12:21:36,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:36" (3/3) ... [2024-10-11 12:21:36,954 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-86.i [2024-10-11 12:21:36,970 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:21:36,971 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:21:37,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:21:37,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;@a715487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:21:37,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:21:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:21:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 12:21:37,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:21:37,042 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:21:37,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:21:37,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:21:37,047 INFO L85 PathProgramCache]: Analyzing trace with hash 436445925, now seen corresponding path program 1 times [2024-10-11 12:21:37,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:21:37,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800612744] [2024-10-11 12:21:37,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:21:37,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:21:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:21:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:21:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:21:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:21:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:21:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:21:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:21:37,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:21:37,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800612744] [2024-10-11 12:21:37,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800612744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:21:37,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:21:37,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:21:37,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151207017] [2024-10-11 12:21:37,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:21:37,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:21:37,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:21:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:21:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:21:37,336 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 12:21:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:21:37,384 INFO L93 Difference]: Finished difference Result 49 states and 78 transitions. [2024-10-11 12:21:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:21:37,387 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2024-10-11 12:21:37,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:21:37,399 INFO L225 Difference]: With dead ends: 49 [2024-10-11 12:21:37,399 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 12:21:37,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:21:37,409 INFO L432 NwaCegarLoop]: 29 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, 29 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:21:37,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:21:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 12:21:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-11 12:21:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:21:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-10-11 12:21:37,451 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 41 [2024-10-11 12:21:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:21:37,452 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-10-11 12:21:37,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 12:21:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-10-11 12:21:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 12:21:37,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:21:37,454 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:21:37,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:21:37,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:21:37,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:21:37,456 INFO L85 PathProgramCache]: Analyzing trace with hash 789418601, now seen corresponding path program 1 times [2024-10-11 12:21:37,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:21:37,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768622230] [2024-10-11 12:21:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:21:37,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:21:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:21:37,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:21:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:21:37,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:21:37,640 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:21:37,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:21:37,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:21:37,646 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 12:21:37,674 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:21:37,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:21:37 BoogieIcfgContainer [2024-10-11 12:21:37,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:21:37,678 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:21:37,678 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:21:37,678 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:21:37,679 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:36" (3/4) ... [2024-10-11 12:21:37,681 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:21:37,683 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:21:37,684 INFO L158 Benchmark]: Toolchain (without parser) took 1511.23ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 90.4MB in the beginning and 162.3MB in the end (delta: -71.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:21:37,684 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:21:37,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.82ms. Allocated memory is still 161.5MB. Free memory was 90.1MB in the beginning and 77.1MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:21:37,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.31ms. Allocated memory is still 161.5MB. Free memory was 77.0MB in the beginning and 75.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:21:37,687 INFO L158 Benchmark]: Boogie Preprocessor took 53.90ms. Allocated memory is still 161.5MB. Free memory was 132.0MB in the beginning and 132.8MB in the end (delta: -780.0kB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2024-10-11 12:21:37,688 INFO L158 Benchmark]: RCFGBuilder took 355.73ms. Allocated memory is still 161.5MB. Free memory was 132.8MB in the beginning and 119.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:21:37,688 INFO L158 Benchmark]: TraceAbstraction took 732.33ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 119.3MB in the beginning and 163.3MB in the end (delta: -44.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:21:37,691 INFO L158 Benchmark]: Witness Printer took 4.71ms. Allocated memory is still 199.2MB. Free memory was 163.3MB in the beginning and 162.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:21:37,693 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.19ms. Allocated memory is still 161.5MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.82ms. Allocated memory is still 161.5MB. Free memory was 90.1MB in the beginning and 77.1MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.31ms. Allocated memory is still 161.5MB. Free memory was 77.0MB in the beginning and 75.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.90ms. Allocated memory is still 161.5MB. Free memory was 132.0MB in the beginning and 132.8MB in the end (delta: -780.0kB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * RCFGBuilder took 355.73ms. Allocated memory is still 161.5MB. Free memory was 132.8MB in the beginning and 119.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 732.33ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 119.3MB in the beginning and 163.3MB in the end (delta: -44.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.71ms. Allocated memory is still 199.2MB. Free memory was 163.3MB in the beginning and 162.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 57, overapproximation of someBinaryFLOATComparisonOperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.5; [L23] double var_1_2 = 63.805; [L24] double var_1_3 = 64.125; [L25] unsigned short int var_1_4 = 16; [L26] float var_1_5 = 10.5; [L27] unsigned short int var_1_6 = 10; [L61] isInitial = 1 [L62] FCALL initially() [L63] COND TRUE 1 [L64] FCALL updateLastVariables() [L65] CALL updateVariables() [L43] var_1_2 = __VERIFIER_nondet_double() [L44] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_3=513/8, var_1_4=16, var_1_5=21/2, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_3=513/8, var_1_4=16, var_1_5=21/2, var_1_6=10] [L44] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=511/2, var_1_3=513/8, var_1_4=16, var_1_5=21/2, var_1_6=10] [L45] var_1_3 = __VERIFIER_nondet_double() [L46] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_5=21/2, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_5=21/2, var_1_6=10] [L46] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=511/2, var_1_4=16, var_1_5=21/2, var_1_6=10] [L47] var_1_5 = __VERIFIER_nondet_float() [L48] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=10] [L48] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=10] [L49] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=10] [L49] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=10] [L50] var_1_6 = __VERIFIER_nondet_ushort() [L51] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16] [L51] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=511/2, var_1_4=16] [L52] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=65534] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=65534] [L52] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=65534] [L65] RET updateVariables() [L66] CALL step() [L31] COND TRUE ! (var_1_2 < var_1_3) [L32] var_1_1 = 1.4f VAL [isInitial=1, var_1_1=7/5, var_1_4=16, var_1_6=65534] [L34] COND FALSE !(var_1_1 != (var_1_1 / var_1_5)) VAL [isInitial=1, var_1_1=7/5, var_1_4=16, var_1_6=65534] [L66] RET step() [L67] CALL, EXPR property() [L57-L58] return ((! (var_1_2 < var_1_3)) ? (var_1_1 == ((float) 1.4f)) : 1) && ((var_1_1 != (var_1_1 / var_1_5)) ? ((var_1_1 < (var_1_5 * var_1_1)) ? (var_1_4 == ((unsigned short int) var_1_6)) : (var_1_4 == ((unsigned short int) var_1_6))) : 1) ; [L67] RET, EXPR property() [L67] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=7/5, var_1_4=16, var_1_6=65534] [L19] reach_error() VAL [isInitial=1, var_1_1=7/5, var_1_4=16, var_1_6=65534] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 29 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 60/60 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:21:37,739 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_amount10_file-86.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 248e9a660b5341ec0894e1aed13dbcc752507598fe574e15afae8cc67f5cac10 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:21:39,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:21:40,063 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:21:40,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:21:40,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:21:40,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:21:40,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:21:40,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:21:40,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:21:40,104 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:21:40,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:21:40,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:21:40,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:21:40,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:21:40,110 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:21:40,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:21:40,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:21:40,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:21:40,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:21:40,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:21:40,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:21:40,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:21:40,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:21:40,114 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:21:40,114 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:21:40,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:21:40,115 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:21:40,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:21:40,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:21:40,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:21:40,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:21:40,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:21:40,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:21:40,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:21:40,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:21:40,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:21:40,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:21:40,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:21:40,118 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:21:40,119 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:21:40,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:21:40,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:21:40,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:21:40,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:21:40,120 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:21:40,120 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 -> 248e9a660b5341ec0894e1aed13dbcc752507598fe574e15afae8cc67f5cac10 [2024-10-11 12:21:40,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:21:40,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:21:40,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:21:40,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:21:40,496 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:21:40,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-86.i [2024-10-11 12:21:42,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:21:42,381 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:21:42,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-86.i [2024-10-11 12:21:42,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/52525f2e2/d86e0ebca3854d43ac8a9b8bfed7a36c/FLAG0f595a2ee [2024-10-11 12:21:42,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/52525f2e2/d86e0ebca3854d43ac8a9b8bfed7a36c [2024-10-11 12:21:42,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:21:42,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:21:42,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:21:42,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:21:42,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:21:42,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:42" (1/1) ... [2024-10-11 12:21:42,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d4d039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:42, skipping insertion in model container [2024-10-11 12:21:42,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:42" (1/1) ... [2024-10-11 12:21:42,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:21:42,968 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-86.i[915,928] [2024-10-11 12:21:43,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:21:43,031 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:21:43,045 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-86.i[915,928] [2024-10-11 12:21:43,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:21:43,086 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:21:43,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43 WrapperNode [2024-10-11 12:21:43,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:21:43,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:21:43,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:21:43,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:21:43,096 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:21:43" (1/1) ... [2024-10-11 12:21:43,112 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:21:43" (1/1) ... [2024-10-11 12:21:43,138 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 64 [2024-10-11 12:21:43,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:21:43,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:21:43,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:21:43,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:21:43,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,174 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:21:43,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:21:43,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:21:43,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:21:43,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:21:43,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:21:43,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:21:43,248 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:21:43,255 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:21:43,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:21:43,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:21:43,298 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:21:43,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:21:43,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:21:43,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:21:43,384 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:21:43,387 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:21:44,956 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:21:44,957 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:21:45,020 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:21:45,021 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:21:45,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:45 BoogieIcfgContainer [2024-10-11 12:21:45,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:21:45,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:21:45,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:21:45,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:21:45,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:21:42" (1/3) ... [2024-10-11 12:21:45,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724ee880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:45, skipping insertion in model container [2024-10-11 12:21:45,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (2/3) ... [2024-10-11 12:21:45,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724ee880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:45, skipping insertion in model container [2024-10-11 12:21:45,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:45" (3/3) ... [2024-10-11 12:21:45,035 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-86.i [2024-10-11 12:21:45,055 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:21:45,056 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:21:45,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:21:45,132 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;@609374a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:21:45,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:21:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:21:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 12:21:45,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:21:45,145 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:21:45,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:21:45,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:21:45,150 INFO L85 PathProgramCache]: Analyzing trace with hash 436445925, now seen corresponding path program 1 times [2024-10-11 12:21:45,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:21:45,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111256538] [2024-10-11 12:21:45,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:21:45,178 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:21:45,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:21:45,181 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:21:45,183 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:21:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:45,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:21:45,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:21:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 12:21:45,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:21:45,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:21:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111256538] [2024-10-11 12:21:45,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111256538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:21:45,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:21:45,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:21:45,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738610954] [2024-10-11 12:21:45,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:21:45,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:21:45,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:21:45,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:21:45,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:21:45,514 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:21:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:21:46,097 INFO L93 Difference]: Finished difference Result 49 states and 78 transitions. [2024-10-11 12:21:46,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:21:46,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2024-10-11 12:21:46,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:21:46,123 INFO L225 Difference]: With dead ends: 49 [2024-10-11 12:21:46,123 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 12:21:46,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 40 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:21:46,129 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 12:21:46,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 12:21:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 12:21:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-11 12:21:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:21:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-10-11 12:21:46,172 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 41 [2024-10-11 12:21:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:21:46,173 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-10-11 12:21:46,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:21:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-10-11 12:21:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 12:21:46,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:21:46,175 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:21:46,184 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:21:46,376 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:21:46,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:21:46,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:21:46,378 INFO L85 PathProgramCache]: Analyzing trace with hash 789418601, now seen corresponding path program 1 times [2024-10-11 12:21:46,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:21:46,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495213209] [2024-10-11 12:21:46,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:21:46,379 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:21:46,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:21:46,381 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:21:46,382 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:21:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:46,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:21:46,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:21:58,620 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 12:22:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:22:01,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:22:01,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:22:01,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495213209] [2024-10-11 12:22:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495213209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:22:01,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:22:01,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:22:01,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131426898] [2024-10-11 12:22:01,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:22:01,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:22:01,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:22:01,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:22:01,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:22:01,883 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:22:04,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:22:06,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:22:08,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:22:16,555 WARN L286 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 12:22:24,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:22:26,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:22:28,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:22:31,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:22:35,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:22:40,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:22:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:22:40,376 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2024-10-11 12:22:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:22:40,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2024-10-11 12:22:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:22:40,379 INFO L225 Difference]: With dead ends: 61 [2024-10-11 12:22:40,379 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 12:22:40,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:22:40,381 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 60 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2024-10-11 12:22:40,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 92 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 31.9s Time] [2024-10-11 12:22:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 12:22:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2024-10-11 12:22:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 12:22:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2024-10-11 12:22:40,399 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 41 [2024-10-11 12:22:40,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:22:40,400 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2024-10-11 12:22:40,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:22:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2024-10-11 12:22:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 12:22:40,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:22:40,403 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:22:40,415 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:22:40,604 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 [2024-10-11 12:22:40,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:22:40,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:22:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash 791265643, now seen corresponding path program 1 times [2024-10-11 12:22:40,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:22:40,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773496186] [2024-10-11 12:22:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:22:40,607 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:22:40,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:22:40,608 INFO L229 MonitoredProcess]: Starting monitored process 4 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:22:40,610 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 (4)] Waiting until timeout for monitored process [2024-10-11 12:22:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:40,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 12:22:40,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:22:47,070 WARN L851 $PredicateComparison]: unable to prove that (and (fp.lt c_~var_1_2~0 c_~var_1_3~0) (fp.eq c_~var_1_1~0 (fp.div c_currentRoundingMode c_~var_1_1~0 c_~var_1_5~0))) is different from false [2024-10-11 12:22:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:22:59,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:22:59,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:22:59,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773496186] [2024-10-11 12:22:59,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773496186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:22:59,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:22:59,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:22:59,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361987778] [2024-10-11 12:22:59,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:22:59,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:22:59,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:22:59,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:22:59,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-11 12:22:59,568 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:23:00,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:23:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:23:01,817 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2024-10-11 12:23:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:23:01,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2024-10-11 12:23:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:23:01,821 INFO L225 Difference]: With dead ends: 72 [2024-10-11 12:23:01,822 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 12:23:01,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-11 12:23:01,827 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:23:01,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 109 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 28 Unchecked, 2.2s Time] [2024-10-11 12:23:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 12:23:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2024-10-11 12:23:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.2) internal successors, (48), 41 states have internal predecessors, (48), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 12:23:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-10-11 12:23:01,846 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 41 [2024-10-11 12:23:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:23:01,847 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-10-11 12:23:01,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:23:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-10-11 12:23:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 12:23:01,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:23:01,849 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:23:01,858 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 (4)] Ended with exit code 0 [2024-10-11 12:23:02,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:23:02,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:23:02,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:23:02,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1306726015, now seen corresponding path program 1 times [2024-10-11 12:23:02,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:23:02,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827335468] [2024-10-11 12:23:02,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:23:02,051 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:23:02,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:23:02,055 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:23:02,056 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:23:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:23:02,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:23:02,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:23:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:23:04,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:23:04,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:23:04,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827335468] [2024-10-11 12:23:04,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827335468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:23:04,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:23:04,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:23:04,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011098268] [2024-10-11 12:23:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:23:04,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:23:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:23:04,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:23:04,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:23:04,710 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:23:07,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:23:09,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:23:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:23:12,877 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-10-11 12:23:12,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:23:12,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-10-11 12:23:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:23:12,881 INFO L225 Difference]: With dead ends: 68 [2024-10-11 12:23:12,882 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 12:23:12,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:23:12,884 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 58 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:23:12,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 108 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-10-11 12:23:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 12:23:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 12:23:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 12:23:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-11 12:23:12,895 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 42 [2024-10-11 12:23:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:23:12,895 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-11 12:23:12,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 12:23:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-11 12:23:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 12:23:12,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:23:12,896 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:23:12,913 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:23:13,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:23:13,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:23:13,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:23:13,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1249467713, now seen corresponding path program 1 times [2024-10-11 12:23:13,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:23:13,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055951683] [2024-10-11 12:23:13,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:23:13,102 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:23:13,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:23:13,104 INFO L229 MonitoredProcess]: Starting monitored process 6 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:23:13,109 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 (6)] Waiting until timeout for monitored process [2024-10-11 12:23:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:23:13,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 12:23:13,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:23:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 12:23:16,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:23:16,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:23:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055951683] [2024-10-11 12:23:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055951683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:23:16,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:23:16,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:23:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355375895] [2024-10-11 12:23:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:23:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:23:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:23:16,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:23:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:23:16,439 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6)