./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.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 cd3d3b06025bd7756a6426892295962965c3454eb8c1b0e9922b36e8366261d1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:37:31,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:37:31,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:37:31,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:37:31,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:37:31,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:37:31,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:37:31,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:37:31,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:37:31,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:37:31,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:37:31,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:37:31,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:37:31,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:37:31,196 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:37:31,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:37:31,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:37:31,197 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:37:31,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:37:31,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:37:31,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:37:31,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:37:31,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:37:31,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:37:31,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:37:31,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:37:31,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:37:31,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:37:31,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:37:31,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:37:31,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:37:31,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:37:31,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:37:31,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:37:31,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:37:31,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:37:31,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:37:31,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:37:31,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:37:31,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:37:31,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:37:31,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:37:31,215 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 -> cd3d3b06025bd7756a6426892295962965c3454eb8c1b0e9922b36e8366261d1 [2024-10-11 12:37:31,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:37:31,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:37:31,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:37:31,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:37:31,490 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:37:31,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i [2024-10-11 12:37:32,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:37:33,191 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:37:33,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i [2024-10-11 12:37:33,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8095b88b5/7b56e4e0e44e4f5997878910efd03005/FLAG56f62acce [2024-10-11 12:37:33,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8095b88b5/7b56e4e0e44e4f5997878910efd03005 [2024-10-11 12:37:33,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:37:33,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:37:33,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:37:33,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:37:33,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:37:33,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:33,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172ab8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33, skipping insertion in model container [2024-10-11 12:37:33,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:33,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:37:33,786 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i[915,928] [2024-10-11 12:37:33,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:37:33,845 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:37:33,858 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i[915,928] [2024-10-11 12:37:33,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:37:33,901 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:37:33,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33 WrapperNode [2024-10-11 12:37:33,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:37:33,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:37:33,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:37:33,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:37:33,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:33,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:33,955 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-10-11 12:37:33,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:37:33,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:37:33,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:37:33,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:37:33,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:33,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:33,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:33,991 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:37:33,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:33,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:34,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:34,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:34,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:34,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:34,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:37:34,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:37:34,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:37:34,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:37:34,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (1/1) ... [2024-10-11 12:37:34,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:37:34,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:37:34,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:37:34,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:37:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:37:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:37:34,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:37:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:37:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:37:34,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:37:34,197 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:37:34,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:37:34,492 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 12:37:34,492 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:37:34,531 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:37:34,535 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:37:34,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:37:34 BoogieIcfgContainer [2024-10-11 12:37:34,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:37:34,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:37:34,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:37:34,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:37:34,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:37:33" (1/3) ... [2024-10-11 12:37:34,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b695df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:37:34, skipping insertion in model container [2024-10-11 12:37:34,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:33" (2/3) ... [2024-10-11 12:37:34,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b695df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:37:34, skipping insertion in model container [2024-10-11 12:37:34,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:37:34" (3/3) ... [2024-10-11 12:37:34,547 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-61.i [2024-10-11 12:37:34,565 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:37:34,565 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:37:34,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:37:34,631 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;@247fc8fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:37:34,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:37:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 12:37:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 12:37:34,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:37:34,645 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:37:34,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:37:34,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:37:34,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1472934784, now seen corresponding path program 1 times [2024-10-11 12:37:34,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:37:34,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137612959] [2024-10-11 12:37:34,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:34,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:37:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:37:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:37:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:37:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:37:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:37:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:37:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 12:37:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:37:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 12:37:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:37:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:37:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:37:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 12:37:34,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:37:34,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137612959] [2024-10-11 12:37:34,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137612959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:37:34,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:37:34,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:37:34,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127095869] [2024-10-11 12:37:34,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:37:34,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:37:34,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:37:35,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:37:35,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:37:35,037 INFO L87 Difference]: Start difference. First operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 12:37:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:37:35,081 INFO L93 Difference]: Finished difference Result 93 states and 154 transitions. [2024-10-11 12:37:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:37:35,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-10-11 12:37:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:37:35,091 INFO L225 Difference]: With dead ends: 93 [2024-10-11 12:37:35,091 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 12:37:35,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:37:35,097 INFO L432 NwaCegarLoop]: 64 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, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:37:35,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:37:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 12:37:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 12:37:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 12:37:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2024-10-11 12:37:35,135 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 79 [2024-10-11 12:37:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:37:35,136 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2024-10-11 12:37:35,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 12:37:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2024-10-11 12:37:35,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 12:37:35,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:37:35,140 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:37:35,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:37:35,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:37:35,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:37:35,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472572, now seen corresponding path program 1 times [2024-10-11 12:37:35,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:37:35,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265404934] [2024-10-11 12:37:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:37:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:37:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:37:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:37:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:37:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:37:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:37:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 12:37:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:37:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 12:37:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:37:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:37:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:37:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 12:37:35,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:37:35,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265404934] [2024-10-11 12:37:35,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265404934] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:37:35,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679538233] [2024-10-11 12:37:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:35,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:37:35,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:37:35,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:37:35,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:37:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:35,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 12:37:35,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:37:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 12:37:35,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:37:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 12:37:36,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679538233] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:37:36,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:37:36,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 12:37:36,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210126638] [2024-10-11 12:37:36,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:37:36,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:37:36,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:37:36,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:37:36,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:37:36,088 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 12:37:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:37:36,322 INFO L93 Difference]: Finished difference Result 110 states and 157 transitions. [2024-10-11 12:37:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 12:37:36,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 79 [2024-10-11 12:37:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:37:36,326 INFO L225 Difference]: With dead ends: 110 [2024-10-11 12:37:36,327 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 12:37:36,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:37:36,331 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 74 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:37:36,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 132 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:37:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 12:37:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2024-10-11 12:37:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 12:37:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2024-10-11 12:37:36,355 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 79 [2024-10-11 12:37:36,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:37:36,358 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2024-10-11 12:37:36,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 12:37:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2024-10-11 12:37:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 12:37:36,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:37:36,361 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:37:36,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 12:37:36,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:37:36,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:37:36,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:37:36,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1131868638, now seen corresponding path program 1 times [2024-10-11 12:37:36,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:37:36,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362083845] [2024-10-11 12:37:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:36,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:37:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:37:36,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:37:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:37:36,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:37:36,724 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:37:36,725 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:37:36,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:37:36,731 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 12:37:36,800 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:37:36,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:37:36 BoogieIcfgContainer [2024-10-11 12:37:36,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:37:36,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:37:36,804 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:37:36,804 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:37:36,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:37:34" (3/4) ... [2024-10-11 12:37:36,807 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:37:36,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:37:36,812 INFO L158 Benchmark]: Toolchain (without parser) took 3228.97ms. Allocated memory was 169.9MB in the beginning and 253.8MB in the end (delta: 83.9MB). Free memory was 113.2MB in the beginning and 194.4MB in the end (delta: -81.2MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-10-11 12:37:36,816 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:37:36,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.81ms. Allocated memory is still 169.9MB. Free memory was 112.8MB in the beginning and 99.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:37:36,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.15ms. Allocated memory is still 169.9MB. Free memory was 99.4MB in the beginning and 96.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:37:36,817 INFO L158 Benchmark]: Boogie Preprocessor took 68.76ms. Allocated memory is still 169.9MB. Free memory was 96.0MB in the beginning and 92.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:37:36,817 INFO L158 Benchmark]: RCFGBuilder took 508.99ms. Allocated memory is still 169.9MB. Free memory was 92.2MB in the beginning and 72.6MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 12:37:36,817 INFO L158 Benchmark]: TraceAbstraction took 2265.76ms. Allocated memory was 169.9MB in the beginning and 253.8MB in the end (delta: 83.9MB). Free memory was 72.2MB in the beginning and 194.4MB in the end (delta: -122.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:37:36,817 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 253.8MB. Free memory is still 194.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:37:36,820 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.81ms. Allocated memory is still 169.9MB. Free memory was 112.8MB in the beginning and 99.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.15ms. Allocated memory is still 169.9MB. Free memory was 99.4MB in the beginning and 96.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.76ms. Allocated memory is still 169.9MB. Free memory was 96.0MB in the beginning and 92.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 508.99ms. Allocated memory is still 169.9MB. Free memory was 92.2MB in the beginning and 72.6MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2265.76ms. Allocated memory was 169.9MB in the beginning and 253.8MB in the end (delta: 83.9MB). Free memory was 72.2MB in the beginning and 194.4MB in the end (delta: -122.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 253.8MB. Free memory is still 194.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 128.6; [L24] float var_1_3 = 49.4; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 8; [L29] unsigned char var_1_8 = 128; [L30] unsigned char var_1_9 = 64; [L31] signed short int var_1_10 = 5; [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] FCALL updateLastVariables() [L92] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_float() [L62] 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_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L62] 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_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L63] var_1_3 = __VERIFIER_nondet_float() [L64] 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_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L64] 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_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L65] var_1_4 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L66] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L67] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L67] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L68] var_1_5 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L69] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L70] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L70] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L71] var_1_6 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L72] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L73] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L73] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L75] RET assume_abort_if_not(var_1_8 >= 127) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L76] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L76] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2] [L79] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L79] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L92] RET updateVariables() [L93] CALL step() [L35] COND TRUE var_1_2 < var_1_3 [L36] var_1_1 = (var_1_4 || var_1_5) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L44] COND TRUE \read(var_1_6) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L45] COND TRUE var_1_3 != 15.8f [L46] var_1_7 = (var_1_8 - var_1_9) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L53] EXPR (var_1_9 / 32) << var_1_8 VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L53] signed long int stepLocal_0 = (var_1_9 / 32) << var_1_8; [L54] COND FALSE !(! (var_1_3 < var_1_2)) VAL [isInitial=1, stepLocal_0=0, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR (((var_1_2 < var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : ((var_1_3 >= var_1_2) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_6)))) && (var_1_6 ? ((var_1_3 != 15.8f) ? (var_1_7 == ((unsigned char) (var_1_8 - var_1_9))) : (var_1_7 == ((unsigned char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9)))))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((! (var_1_3 < var_1_2)) ? ((((var_1_9 / 32) << var_1_8) == var_1_7) ? (var_1_10 == ((signed short int) (var_1_7 - var_1_8))) : 1) : 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L84-L85] return (((var_1_2 < var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : ((var_1_3 >= var_1_2) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_6)))) && (var_1_6 ? ((var_1_3 != 15.8f) ? (var_1_7 == ((unsigned char) (var_1_8 - var_1_9))) : (var_1_7 == ((unsigned char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9)))))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((! (var_1_3 < var_1_2)) ? ((((var_1_9 / 32) << var_1_8) == var_1_7) ? (var_1_10 == ((signed short int) (var_1_7 - var_1_8))) : 1) : 1) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 113 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 123 mSDtfsCounter, 113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 215 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 764 SizeOfPredicates, 2 NumberOfNonLiveVariables, 181 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1011/1056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:37:36,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.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 cd3d3b06025bd7756a6426892295962965c3454eb8c1b0e9922b36e8366261d1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:37:39,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:37:39,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:37:39,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:37:39,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:37:39,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:37:39,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:37:39,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:37:39,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:37:39,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:37:39,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:37:39,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:37:39,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:37:39,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:37:39,140 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:37:39,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:37:39,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:37:39,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:37:39,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:37:39,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:37:39,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:37:39,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:37:39,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:37:39,143 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:37:39,144 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:37:39,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:37:39,144 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:37:39,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:37:39,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:37:39,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:37:39,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:37:39,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:37:39,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:37:39,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:37:39,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:37:39,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:37:39,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:37:39,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:37:39,149 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:37:39,149 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:37:39,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:37:39,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:37:39,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:37:39,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:37:39,151 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:37:39,151 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 -> cd3d3b06025bd7756a6426892295962965c3454eb8c1b0e9922b36e8366261d1 [2024-10-11 12:37:39,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:37:39,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:37:39,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:37:39,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:37:39,487 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:37:39,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i [2024-10-11 12:37:40,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:37:41,189 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:37:41,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i [2024-10-11 12:37:41,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/12d29f1aa/a394d1d45f6c49ea967dae0e2c45b08b/FLAG9f81b0fa1 [2024-10-11 12:37:41,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/12d29f1aa/a394d1d45f6c49ea967dae0e2c45b08b [2024-10-11 12:37:41,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:37:41,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:37:41,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:37:41,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:37:41,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:37:41,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f765412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41, skipping insertion in model container [2024-10-11 12:37:41,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:37:41,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_amount25_file-61.i[915,928] [2024-10-11 12:37:41,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:37:41,507 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:37:41,520 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-61.i[915,928] [2024-10-11 12:37:41,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:37:41,567 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:37:41,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41 WrapperNode [2024-10-11 12:37:41,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:37:41,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:37:41,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:37:41,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:37:41,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,617 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-11 12:37:41,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:37:41,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:37:41,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:37:41,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:37:41,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,645 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:37:41,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:37:41,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:37:41,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:37:41,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:37:41,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (1/1) ... [2024-10-11 12:37:41,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:37:41,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:37:41,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:37:41,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:37:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:37:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:37:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:37:41,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:37:41,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:37:41,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:37:41,829 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:37:41,831 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:37:42,118 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 12:37:42,118 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:37:42,177 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:37:42,178 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:37:42,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:37:42 BoogieIcfgContainer [2024-10-11 12:37:42,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:37:42,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:37:42,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:37:42,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:37:42,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:37:41" (1/3) ... [2024-10-11 12:37:42,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262482c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:37:42, skipping insertion in model container [2024-10-11 12:37:42,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:37:41" (2/3) ... [2024-10-11 12:37:42,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262482c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:37:42, skipping insertion in model container [2024-10-11 12:37:42,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:37:42" (3/3) ... [2024-10-11 12:37:42,188 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-61.i [2024-10-11 12:37:42,208 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:37:42,209 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:37:42,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:37:42,291 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;@587ac31c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:37:42,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:37:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 12:37:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 12:37:42,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:37:42,307 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:37:42,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:37:42,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:37:42,315 INFO L85 PathProgramCache]: Analyzing trace with hash 186350007, now seen corresponding path program 1 times [2024-10-11 12:37:42,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:37:42,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881824184] [2024-10-11 12:37:42,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:42,331 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:37:42,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:37:42,335 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:37:42,336 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:37:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:42,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:37:42,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:37:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-11 12:37:42,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:37:42,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:37:42,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881824184] [2024-10-11 12:37:42,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881824184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:37:42,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:37:42,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:37:42,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069677065] [2024-10-11 12:37:42,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:37:42,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:37:42,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:37:42,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:37:42,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:37:42,646 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 12:37:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:37:42,692 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2024-10-11 12:37:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:37:42,696 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 76 [2024-10-11 12:37:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:37:42,704 INFO L225 Difference]: With dead ends: 75 [2024-10-11 12:37:42,704 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 12:37:42,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:37:42,714 INFO L432 NwaCegarLoop]: 51 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, 51 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:37:42,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:37:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 12:37:42,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 12:37:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 12:37:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2024-10-11 12:37:42,768 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 76 [2024-10-11 12:37:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:37:42,769 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2024-10-11 12:37:42,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 12:37:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2024-10-11 12:37:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 12:37:42,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:37:42,773 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:37:42,787 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:37:42,978 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:37:42,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:37:42,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:37:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash -224680717, now seen corresponding path program 1 times [2024-10-11 12:37:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:37:42,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841764466] [2024-10-11 12:37:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:42,982 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:37:42,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:37:42,987 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:37:42,988 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:37:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:43,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 12:37:43,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:37:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 12:37:43,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:37:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 12:37:43,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:37:43,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841764466] [2024-10-11 12:37:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841764466] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:37:43,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:37:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 12:37:43,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074338302] [2024-10-11 12:37:43,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:37:43,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:37:43,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:37:43,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:37:43,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:37:43,525 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 12:37:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:37:43,793 INFO L93 Difference]: Finished difference Result 92 states and 131 transitions. [2024-10-11 12:37:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 12:37:43,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 76 [2024-10-11 12:37:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:37:43,798 INFO L225 Difference]: With dead ends: 92 [2024-10-11 12:37:43,799 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 12:37:43,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:37:43,800 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:37:43,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 96 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:37:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 12:37:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-10-11 12:37:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 12:37:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2024-10-11 12:37:43,815 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 76 [2024-10-11 12:37:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:37:43,816 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2024-10-11 12:37:43,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 12:37:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-10-11 12:37:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 12:37:43,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:37:43,823 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:37:43,831 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:37:44,023 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:37:44,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:37:44,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:37:44,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1392529085, now seen corresponding path program 1 times [2024-10-11 12:37:44,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:37:44,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262152779] [2024-10-11 12:37:44,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:37:44,031 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:37:44,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:37:44,045 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:37:44,048 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:37:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:37:44,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 12:37:44,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:37:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 12:37:44,781 INFO L311 TraceCheckSpWp]: Computing backward predicates...