./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_loopvsstraightlinecode_25-while_file-84.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_loopvsstraightlinecode_25-while_file-84.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 97ab114faeeb647754215ee4eabe50225e9e4c7fb0c1ec399b2dc963df906731 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:42:48,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:42:48,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:42:48,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:42:48,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:42:48,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:42:48,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:42:48,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:42:48,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:42:48,977 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:42:48,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:42:48,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:42:48,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:42:48,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:42:48,980 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:42:48,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:42:48,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:42:48,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:42:48,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:42:48,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:42:48,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:42:48,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:42:48,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:42:48,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:42:48,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:42:48,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:42:48,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:42:48,987 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:42:48,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:42:48,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:42:48,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:42:48,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:42:48,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:42:48,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:42:48,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:42:48,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:42:48,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:42:48,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:42:48,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:42:48,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:42:48,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:42:48,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:42:48,990 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 -> 97ab114faeeb647754215ee4eabe50225e9e4c7fb0c1ec399b2dc963df906731 [2024-10-11 11:42:49,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:42:49,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:42:49,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:42:49,309 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:42:49,310 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:42:49,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i [2024-10-11 11:42:50,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:42:50,879 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:42:50,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i [2024-10-11 11:42:50,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/922e61339/a819b205141b4ec2a41220e5f13d0d15/FLAGf7a7d6b31 [2024-10-11 11:42:50,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/922e61339/a819b205141b4ec2a41220e5f13d0d15 [2024-10-11 11:42:50,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:42:50,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:42:50,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:42:50,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:42:50,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:42:50,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:42:50" (1/1) ... [2024-10-11 11:42:50,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ddc1f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:50, skipping insertion in model container [2024-10-11 11:42:50,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:42:50" (1/1) ... [2024-10-11 11:42:50,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:42:51,097 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_loopvsstraightlinecode_25-while_file-84.i[915,928] [2024-10-11 11:42:51,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:42:51,154 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:42:51,165 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_loopvsstraightlinecode_25-while_file-84.i[915,928] [2024-10-11 11:42:51,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:42:51,200 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:42:51,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51 WrapperNode [2024-10-11 11:42:51,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:42:51,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:42:51,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:42:51,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:42:51,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (1/1) ... [2024-10-11 11:42:51,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (1/1) ... [2024-10-11 11:42:51,261 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-10-11 11:42:51,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:42:51,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:42:51,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:42:51,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:42:51,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (1/1) ... [2024-10-11 11:42:51,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (1/1) ... [2024-10-11 11:42:51,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (1/1) ... [2024-10-11 11:42:51,301 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 11:42:51,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (1/1) ... [2024-10-11 11:42:51,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (1/1) ... [2024-10-11 11:42:51,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (1/1) ... [2024-10-11 11:42:51,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (1/1) ... [2024-10-11 11:42:51,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (1/1) ... [2024-10-11 11:42:51,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (1/1) ... [2024-10-11 11:42:51,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:42:51,321 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:42:51,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:42:51,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:42:51,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (1/1) ... [2024-10-11 11:42:51,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:42:51,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:42:51,364 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 11:42:51,370 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 11:42:51,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:42:51,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:42:51,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:42:51,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:42:51,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:42:51,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:42:51,506 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:42:51,508 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:42:51,750 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 11:42:51,750 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:42:51,788 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:42:51,788 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:42:51,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:42:51 BoogieIcfgContainer [2024-10-11 11:42:51,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:42:51,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:42:51,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:42:51,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:42:51,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:42:50" (1/3) ... [2024-10-11 11:42:51,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9dd44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:42:51, skipping insertion in model container [2024-10-11 11:42:51,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:51" (2/3) ... [2024-10-11 11:42:51,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9dd44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:42:51, skipping insertion in model container [2024-10-11 11:42:51,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:42:51" (3/3) ... [2024-10-11 11:42:51,798 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-84.i [2024-10-11 11:42:51,814 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:42:51,815 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:42:51,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:42:51,883 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;@18d9b770, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:42:51,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:42:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 11:42:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 11:42:51,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:42:51,904 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:42:51,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:42:51,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:42:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash 73986728, now seen corresponding path program 1 times [2024-10-11 11:42:51,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:42:51,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402810587] [2024-10-11 11:42:51,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:42:51,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:42:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:42:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:42:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:42:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:42:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:42:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:42:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:42:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:42:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:42:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:42:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:42:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 11:42:52,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:42:52,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402810587] [2024-10-11 11:42:52,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402810587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:42:52,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:42:52,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:42:52,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040473892] [2024-10-11 11:42:52,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:42:52,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:42:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:42:52,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:42:52,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:42:52,359 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 11:42:52,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:42:52,407 INFO L93 Difference]: Finished difference Result 73 states and 121 transitions. [2024-10-11 11:42:52,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:42:52,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2024-10-11 11:42:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:42:52,416 INFO L225 Difference]: With dead ends: 73 [2024-10-11 11:42:52,416 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 11:42:52,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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 11:42:52,422 INFO L432 NwaCegarLoop]: 48 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, 48 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 11:42:52,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:42:52,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 11:42:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 11:42:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 11:42:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2024-10-11 11:42:52,462 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 72 [2024-10-11 11:42:52,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:42:52,462 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-10-11 11:42:52,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 11:42:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2024-10-11 11:42:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 11:42:52,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:42:52,468 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:42:52,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:42:52,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:42:52,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:42:52,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1224626334, now seen corresponding path program 1 times [2024-10-11 11:42:52,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:42:52,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821777752] [2024-10-11 11:42:52,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:42:52,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:42:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:42:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:42:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:42:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:42:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:42:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:42:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:42:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:42:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:42:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:42:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:42:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 11:42:52,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:42:52,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821777752] [2024-10-11 11:42:52,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821777752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:42:52,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:42:52,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:42:52,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039730714] [2024-10-11 11:42:52,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:42:52,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:42:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:42:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:42:52,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:42:52,675 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 11:42:52,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:42:52,702 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2024-10-11 11:42:52,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:42:52,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 72 [2024-10-11 11:42:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:42:52,705 INFO L225 Difference]: With dead ends: 71 [2024-10-11 11:42:52,705 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 11:42:52,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:42:52,707 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:42:52,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:42:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 11:42:52,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 11:42:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 11:42:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2024-10-11 11:42:52,719 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 72 [2024-10-11 11:42:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:42:52,720 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2024-10-11 11:42:52,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 11:42:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2024-10-11 11:42:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 11:42:52,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:42:52,724 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:42:52,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:42:52,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:42:52,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:42:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1167368032, now seen corresponding path program 1 times [2024-10-11 11:42:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:42:52,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278342516] [2024-10-11 11:42:52,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:42:52,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:42:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:42:52,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:42:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:42:52,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:42:52,952 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:42:52,953 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:42:52,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:42:52,960 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 11:42:53,030 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:42:53,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:42:53 BoogieIcfgContainer [2024-10-11 11:42:53,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:42:53,035 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:42:53,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:42:53,035 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:42:53,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:42:51" (3/4) ... [2024-10-11 11:42:53,038 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:42:53,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:42:53,040 INFO L158 Benchmark]: Toolchain (without parser) took 2133.63ms. Allocated memory is still 186.6MB. Free memory was 148.7MB in the beginning and 89.1MB in the end (delta: 59.7MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2024-10-11 11:42:53,042 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:42:53,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.59ms. Allocated memory is still 186.6MB. Free memory was 148.7MB in the beginning and 134.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:42:53,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.11ms. Allocated memory is still 186.6MB. Free memory was 134.1MB in the beginning and 130.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:42:53,043 INFO L158 Benchmark]: Boogie Preprocessor took 57.67ms. Allocated memory is still 186.6MB. Free memory was 130.5MB in the beginning and 124.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:42:53,044 INFO L158 Benchmark]: RCFGBuilder took 467.99ms. Allocated memory is still 186.6MB. Free memory was 124.2MB in the beginning and 104.0MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 11:42:53,046 INFO L158 Benchmark]: TraceAbstraction took 1242.41ms. Allocated memory is still 186.6MB. Free memory was 103.3MB in the beginning and 89.1MB in the end (delta: 14.2MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-10-11 11:42:53,046 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 186.6MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:42:53,048 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.15ms. Allocated memory is still 109.1MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.59ms. Allocated memory is still 186.6MB. Free memory was 148.7MB in the beginning and 134.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.11ms. Allocated memory is still 186.6MB. Free memory was 134.1MB in the beginning and 130.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.67ms. Allocated memory is still 186.6MB. Free memory was 130.5MB in the beginning and 124.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 467.99ms. Allocated memory is still 186.6MB. Free memory was 124.2MB in the beginning and 104.0MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1242.41ms. Allocated memory is still 186.6MB. Free memory was 103.3MB in the beginning and 89.1MB in the end (delta: 14.2MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 186.6MB. Free memory is still 89.1MB. 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 = 128; [L23] unsigned char var_1_4 = 25; [L24] unsigned char var_1_5 = 64; [L25] unsigned char var_1_6 = 8; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 10; [L28] float var_1_9 = 9.6; [L29] float var_1_10 = 99.08; [L30] float var_1_11 = 63.4; [L31] float var_1_12 = 32.125; [L32] signed long int var_1_13 = -8; [L33] signed short int var_1_14 = -2; [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] FCALL updateLastVariables() [L92] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L64] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L64] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L65] var_1_5 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L66] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L67] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L67] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_7=0, var_1_8=10, var_1_9=48/5] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_7=0, var_1_8=10, var_1_9=48/5] [L70] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L70] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L71] var_1_7 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_8=10, var_1_9=48/5] [L72] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_8=10, var_1_9=48/5] [L73] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L73] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L74] var_1_10 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L75] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L76] var_1_11 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L77] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L78] var_1_12 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L79] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L92] RET updateVariables() [L93] CALL step() [L37] unsigned char stepLocal_1 = var_1_4; VAL [isInitial=1, stepLocal_1=8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L38] COND TRUE var_1_5 > stepLocal_1 [L39] var_1_8 = (128 - ((((10) > (var_1_5)) ? (10) : (var_1_5)))) VAL [isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L41] var_1_13 = var_1_7 [L42] var_1_14 = var_1_7 [L43] signed short int stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=9, var_1_13=9, var_1_14=9, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L44] COND FALSE !(var_1_14 != stepLocal_0) [L47] var_1_1 = ((((((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) < (var_1_7)) ? (((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) : (var_1_7))) VAL [isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L49] signed long int stepLocal_3 = var_1_13; [L50] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, stepLocal_2=8, stepLocal_3=9, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L51] COND FALSE !((var_1_10 * var_1_11) > 16.75f) VAL [isInitial=1, stepLocal_2=8, stepLocal_3=9, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L93] RET step() [L94] CALL, EXPR property() [L84-L85] return (((((var_1_14 != var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + ((((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7)))))) : (var_1_1 == ((unsigned char) ((((((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) < (var_1_7)) ? (((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) : (var_1_7)))))) && ((var_1_5 > var_1_4) ? (var_1_8 == ((unsigned char) (128 - ((((10) > (var_1_5)) ? (10) : (var_1_5)))))) : 1)) && (((var_1_10 * var_1_11) > 16.75f) ? ((var_1_7 <= var_1_1) ? ((-8 > var_1_13) ? (var_1_9 == ((float) var_1_12)) : 1) : (var_1_9 == ((float) var_1_12))) : 1)) && (var_1_13 == ((signed long int) var_1_7))) && (var_1_14 == ((signed short int) var_1_7)) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L19] reach_error() VAL [isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 94 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 440/440 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 11:42:53,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_loopvsstraightlinecode_25-while_file-84.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 97ab114faeeb647754215ee4eabe50225e9e4c7fb0c1ec399b2dc963df906731 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:42:55,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:42:55,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:42:55,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:42:55,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:42:55,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:42:55,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:42:55,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:42:55,394 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:42:55,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:42:55,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:42:55,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:42:55,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:42:55,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:42:55,401 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:42:55,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:42:55,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:42:55,402 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:42:55,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:42:55,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:42:55,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:42:55,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:42:55,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:42:55,404 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:42:55,404 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:42:55,405 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:42:55,405 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:42:55,405 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:42:55,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:42:55,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:42:55,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:42:55,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:42:55,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:42:55,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:42:55,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:42:55,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:42:55,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:42:55,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:42:55,409 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:42:55,409 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:42:55,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:42:55,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:42:55,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:42:55,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:42:55,410 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:42:55,411 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 -> 97ab114faeeb647754215ee4eabe50225e9e4c7fb0c1ec399b2dc963df906731 [2024-10-11 11:42:55,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:42:55,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:42:55,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:42:55,774 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:42:55,775 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:42:55,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i [2024-10-11 11:42:57,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:42:57,588 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:42:57,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-84.i [2024-10-11 11:42:57,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ce9c13593/5a858c5985fc407eb02d79812c457b99/FLAG5832375e2 [2024-10-11 11:42:57,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ce9c13593/5a858c5985fc407eb02d79812c457b99 [2024-10-11 11:42:57,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:42:57,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:42:57,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:42:57,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:42:57,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:42:57,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:42:57" (1/1) ... [2024-10-11 11:42:57,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8fe6682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:57, skipping insertion in model container [2024-10-11 11:42:57,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:42:57" (1/1) ... [2024-10-11 11:42:57,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:42:58,176 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_loopvsstraightlinecode_25-while_file-84.i[915,928] [2024-10-11 11:42:58,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:42:58,254 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:42:58,268 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_loopvsstraightlinecode_25-while_file-84.i[915,928] [2024-10-11 11:42:58,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:42:58,321 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:42:58,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58 WrapperNode [2024-10-11 11:42:58,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:42:58,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:42:58,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:42:58,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:42:58,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (1/1) ... [2024-10-11 11:42:58,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (1/1) ... [2024-10-11 11:42:58,377 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-10-11 11:42:58,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:42:58,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:42:58,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:42:58,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:42:58,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (1/1) ... [2024-10-11 11:42:58,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (1/1) ... [2024-10-11 11:42:58,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (1/1) ... [2024-10-11 11:42:58,419 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 11:42:58,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (1/1) ... [2024-10-11 11:42:58,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (1/1) ... [2024-10-11 11:42:58,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (1/1) ... [2024-10-11 11:42:58,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (1/1) ... [2024-10-11 11:42:58,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (1/1) ... [2024-10-11 11:42:58,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (1/1) ... [2024-10-11 11:42:58,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:42:58,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:42:58,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:42:58,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:42:58,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (1/1) ... [2024-10-11 11:42:58,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:42:58,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:42:58,488 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 11:42:58,491 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 11:42:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:42:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:42:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:42:58,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:42:58,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:42:58,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:42:58,644 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:42:58,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:42:59,324 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 11:42:59,325 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:42:59,396 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:42:59,396 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:42:59,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:42:59 BoogieIcfgContainer [2024-10-11 11:42:59,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:42:59,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:42:59,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:42:59,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:42:59,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:42:57" (1/3) ... [2024-10-11 11:42:59,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab2cb59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:42:59, skipping insertion in model container [2024-10-11 11:42:59,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:42:58" (2/3) ... [2024-10-11 11:42:59,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab2cb59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:42:59, skipping insertion in model container [2024-10-11 11:42:59,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:42:59" (3/3) ... [2024-10-11 11:42:59,408 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-84.i [2024-10-11 11:42:59,423 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:42:59,424 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:42:59,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:42:59,501 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;@17980c6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:42:59,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:42:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 11:42:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 11:42:59,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:42:59,526 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:42:59,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:42:59,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:42:59,533 INFO L85 PathProgramCache]: Analyzing trace with hash 73986728, now seen corresponding path program 1 times [2024-10-11 11:42:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:42:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988437942] [2024-10-11 11:42:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:42:59,548 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 11:42:59,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:42:59,550 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 11:42:59,553 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 11:42:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:42:59,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:42:59,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:42:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-11 11:42:59,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:42:59,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:42:59,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988437942] [2024-10-11 11:42:59,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988437942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:42:59,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:42:59,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:42:59,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555558534] [2024-10-11 11:42:59,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:42:59,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:42:59,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:42:59,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:42:59,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:42:59,868 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 11:43:00,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:43:00,013 INFO L93 Difference]: Finished difference Result 73 states and 121 transitions. [2024-10-11 11:43:00,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:43:00,023 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2024-10-11 11:43:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:43:00,031 INFO L225 Difference]: With dead ends: 73 [2024-10-11 11:43:00,031 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 11:43:00,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 11:43:00,040 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:43:00,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:43:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 11:43:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 11:43:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 11:43:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2024-10-11 11:43:00,077 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 72 [2024-10-11 11:43:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:43:00,078 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-10-11 11:43:00,078 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 11:43:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2024-10-11 11:43:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 11:43:00,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:43:00,083 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:00,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:43:00,283 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 11:43:00,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:43:00,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:43:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1224626334, now seen corresponding path program 1 times [2024-10-11 11:43:00,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:43:00,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733632354] [2024-10-11 11:43:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:43:00,286 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 11:43:00,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:43:00,290 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 11:43:00,291 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 11:43:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:00,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:43:00,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:43:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 11:43:00,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:43:00,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:43:00,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733632354] [2024-10-11 11:43:00,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733632354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:43:00,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:43:00,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:43:00,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966897540] [2024-10-11 11:43:00,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:43:00,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:43:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:43:00,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:43:00,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:43:00,555 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 11:43:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:43:00,715 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2024-10-11 11:43:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:43:00,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 72 [2024-10-11 11:43:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:43:00,723 INFO L225 Difference]: With dead ends: 71 [2024-10-11 11:43:00,724 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 11:43:00,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:43:00,726 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:43:00,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:43:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 11:43:00,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 11:43:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 11:43:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2024-10-11 11:43:00,734 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 72 [2024-10-11 11:43:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:43:00,736 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2024-10-11 11:43:00,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 11:43:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2024-10-11 11:43:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 11:43:00,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:43:00,738 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:00,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:43:00,938 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 11:43:00,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:43:00,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:43:00,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1167368032, now seen corresponding path program 1 times [2024-10-11 11:43:00,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:43:00,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030911467] [2024-10-11 11:43:00,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:43:00,947 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 11:43:00,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:43:00,951 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 11:43:00,952 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 11:43:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:43:01,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 11:43:01,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:44:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 11:44:18,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:44:18,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:44:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030911467] [2024-10-11 11:44:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030911467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:44:18,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:44:18,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:44:18,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589516579] [2024-10-11 11:44:18,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:44:18,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:44:18,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:44:18,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:44:18,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:44:18,876 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 11:44:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:44:22,814 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2024-10-11 11:44:22,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:44:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 72 [2024-10-11 11:44:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:44:22,816 INFO L225 Difference]: With dead ends: 61 [2024-10-11 11:44:22,816 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 11:44:22,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:44:22,818 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 30 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:44:22,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 180 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 11:44:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 11:44:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2024-10-11 11:44:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:44:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-10-11 11:44:22,828 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 72 [2024-10-11 11:44:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:44:22,829 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-10-11 11:44:22,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 11:44:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-10-11 11:44:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 11:44:22,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:44:22,830 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:44:22,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 11:44:23,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:44:23,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:44:23,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:44:23,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1976714658, now seen corresponding path program 1 times [2024-10-11 11:44:23,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:44:23,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310244100] [2024-10-11 11:44:23,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:44:23,033 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 11:44:23,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:44:23,035 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:44:23,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 11:44:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:44:23,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 11:44:23,202 INFO L278 TraceCheckSpWp]: Computing forward predicates...