./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d6f9f8754fd5e74a79795681184ddd0bb5014968bab7230012cd8a3c9285d31 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:42:50,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:42:50,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:42:50,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:42:50,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:42:51,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:42:51,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:42:51,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:42:51,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:42:51,012 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:42:51,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:42:51,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:42:51,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:42:51,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:42:51,014 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:42:51,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:42:51,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:42:51,015 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:42:51,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:42:51,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:42:51,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:42:51,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:42:51,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:42:51,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:42:51,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:42:51,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:42:51,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:42:51,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:42:51,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:42:51,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:42:51,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:42:51,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:42:51,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:42:51,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:42:51,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:42:51,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:42:51,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:42:51,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:42:51,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:42:51,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:42:51,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:42:51,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:42:51,028 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d6f9f8754fd5e74a79795681184ddd0bb5014968bab7230012cd8a3c9285d31 [2024-11-08 23:42:51,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:42:51,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:42:51,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:42:51,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:42:51,321 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:42:51,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-11-08 23:42:52,833 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:42:53,035 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:42:53,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-11-08 23:42:53,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6267dade/66fe5174221f4b5e89c6464431334c8e/FLAG0de8c0751 [2024-11-08 23:42:53,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6267dade/66fe5174221f4b5e89c6464431334c8e [2024-11-08 23:42:53,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:42:53,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:42:53,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:42:53,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:42:53,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:42:53,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@219596f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53, skipping insertion in model container [2024-11-08 23:42:53,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:42:53,307 WARN L250 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-1loop_file-55.i[915,928] [2024-11-08 23:42:53,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:42:53,362 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:42:53,371 WARN L250 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-1loop_file-55.i[915,928] [2024-11-08 23:42:53,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:42:53,406 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:42:53,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53 WrapperNode [2024-11-08 23:42:53,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:42:53,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:42:53,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:42:53,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:42:53,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,447 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-08 23:42:53,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:42:53,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:42:53,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:42:53,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:42:53,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,474 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-11-08 23:42:53,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:42:53,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:42:53,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:42:53,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:42:53,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (1/1) ... [2024-11-08 23:42:53,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:42:53,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:42:53,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:42:53,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:42:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:42:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:42:53,587 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:42:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:42:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:42:53,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:42:53,672 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:42:53,676 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:42:53,983 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 23:42:53,983 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:42:53,996 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:42:53,997 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:42:53,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:42:53 BoogieIcfgContainer [2024-11-08 23:42:53,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:42:54,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:42:54,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:42:54,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:42:54,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:42:53" (1/3) ... [2024-11-08 23:42:54,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5042d4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:42:54, skipping insertion in model container [2024-11-08 23:42:54,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:53" (2/3) ... [2024-11-08 23:42:54,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5042d4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:42:54, skipping insertion in model container [2024-11-08 23:42:54,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:42:53" (3/3) ... [2024-11-08 23:42:54,011 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-11-08 23:42:54,025 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:42:54,025 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:42:54,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:42:54,096 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;@23133922, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:42:54,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:42:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 23:42:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 23:42:54,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:42:54,113 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:42:54,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:42:54,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:42:54,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1889692668, now seen corresponding path program 1 times [2024-11-08 23:42:54,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:42:54,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406777372] [2024-11-08 23:42:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:42:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:42:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:42:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:42:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:42:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:42:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:42:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:42:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:42:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:42:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:42:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:42:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:42:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 23:42:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:42:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 23:42:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:42:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:42:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:42:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:42:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:42:54,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:42:54,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406777372] [2024-11-08 23:42:54,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406777372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:42:54,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:42:54,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:42:54,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668647751] [2024-11-08 23:42:54,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:42:54,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:42:54,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:42:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:42:54,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:42:54,532 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 23:42:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:42:54,561 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2024-11-08 23:42:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:42:54,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2024-11-08 23:42:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:42:54,573 INFO L225 Difference]: With dead ends: 101 [2024-11-08 23:42:54,573 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 23:42:54,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-11-08 23:42:54,581 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:42:54,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:42:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 23:42:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 23:42:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 23:42:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-08 23:42:54,626 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 106 [2024-11-08 23:42:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:42:54,627 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-08 23:42:54,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 23:42:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-08 23:42:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 23:42:54,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:42:54,632 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:42:54,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:42:54,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:42:54,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:42:54,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1503733250, now seen corresponding path program 1 times [2024-11-08 23:42:54,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:42:54,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610749911] [2024-11-08 23:42:54,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:42:54,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:42:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:42:54,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846358369] [2024-11-08 23:42:54,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:42:54,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:42:54,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:42:54,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:42:54,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:42:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:42:54,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:42:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:42:55,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:42:55,083 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:42:55,085 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:42:55,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:42:55,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:42:55,292 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 23:42:55,371 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:42:55,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:42:55 BoogieIcfgContainer [2024-11-08 23:42:55,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:42:55,376 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:42:55,376 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:42:55,376 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:42:55,377 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:42:53" (3/4) ... [2024-11-08 23:42:55,379 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:42:55,381 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:42:55,383 INFO L158 Benchmark]: Toolchain (without parser) took 2317.30ms. Allocated memory was 169.9MB in the beginning and 209.7MB in the end (delta: 39.8MB). Free memory was 102.0MB in the beginning and 149.9MB in the end (delta: -47.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:42:55,384 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 50.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:42:55,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.40ms. Allocated memory is still 169.9MB. Free memory was 102.0MB in the beginning and 133.4MB in the end (delta: -31.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:42:55,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.82ms. Allocated memory is still 169.9MB. Free memory was 133.4MB in the beginning and 131.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:42:55,387 INFO L158 Benchmark]: Boogie Preprocessor took 49.20ms. Allocated memory is still 169.9MB. Free memory was 131.3MB in the beginning and 128.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:42:55,388 INFO L158 Benchmark]: RCFGBuilder took 498.90ms. Allocated memory is still 169.9MB. Free memory was 128.5MB in the beginning and 113.0MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:42:55,388 INFO L158 Benchmark]: TraceAbstraction took 1373.23ms. Allocated memory was 169.9MB in the beginning and 209.7MB in the end (delta: 39.8MB). Free memory was 111.7MB in the beginning and 150.9MB in the end (delta: -39.2MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-11-08 23:42:55,389 INFO L158 Benchmark]: Witness Printer took 4.85ms. Allocated memory is still 209.7MB. Free memory was 150.9MB in the beginning and 149.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:42:55,391 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 50.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.40ms. Allocated memory is still 169.9MB. Free memory was 102.0MB in the beginning and 133.4MB in the end (delta: -31.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.82ms. Allocated memory is still 169.9MB. Free memory was 133.4MB in the beginning and 131.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.20ms. Allocated memory is still 169.9MB. Free memory was 131.3MB in the beginning and 128.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 498.90ms. Allocated memory is still 169.9MB. Free memory was 128.5MB in the beginning and 113.0MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1373.23ms. Allocated memory was 169.9MB in the beginning and 209.7MB in the end (delta: 39.8MB). Free memory was 111.7MB in the beginning and 150.9MB in the end (delta: -39.2MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Witness Printer took 4.85ms. Allocated memory is still 209.7MB. Free memory was 150.9MB in the beginning and 149.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryArithmeticFLOAToperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 16; [L26] signed char var_1_7 = 25; [L27] unsigned short int var_1_8 = 5; [L28] unsigned short int var_1_9 = 1; [L29] signed char var_1_12 = 1; [L30] float var_1_13 = 127.75; [L31] float var_1_14 = 0.0; [L32] float var_1_15 = 255.7; [L33] float var_1_16 = 7.6; [L34] unsigned long int var_1_17 = 64; [L35] signed long int var_1_18 = 0; VAL [isInitial=0, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L102] isInitial = 1 [L103] FCALL initially() [L104] int k_loop; [L105] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L105] COND TRUE k_loop < 1 [L106] FCALL updateLastVariables() [L107] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L71] var_1_5 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L73] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L74] var_1_6 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=25, var_1_8=5, var_1_9=1] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=25, var_1_8=5, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=5, var_1_9=1] [L76] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=5, var_1_9=1] [L77] var_1_8 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_9=1] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_8 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_9=1] [L79] RET assume_abort_if_not(var_1_8 <= 65535) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=1] [L80] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=1] [L81] var_1_9 = __VERIFIER_nondet_ushort() [L82] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1] [L82] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1] [L83] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1] [L83] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1] [L84] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L84] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L85] var_1_12 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L86] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L87] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L87] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L88] var_1_14 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L89] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L90] var_1_15 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L91] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L92] var_1_16 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L93] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L107] RET updateVariables() [L108] CALL step() [L39] var_1_13 = ((var_1_14 - var_1_15) - var_1_16) [L40] var_1_17 = var_1_6 [L41] var_1_18 = var_1_9 [L42] unsigned short int stepLocal_3 = var_1_9; [L43] unsigned long int stepLocal_2 = var_1_17; VAL [isInitial=1, stepLocal_2=1, stepLocal_3=3, var_1_12=-127, var_1_17=1, var_1_18=3, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=3] [L44] COND FALSE !(stepLocal_2 <= ((var_1_17 / var_1_8) / var_1_9)) [L51] var_1_7 = var_1_12 VAL [isInitial=1, stepLocal_3=3, var_1_12=-127, var_1_17=1, var_1_18=3, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=-127, var_1_8=1, var_1_9=3] [L53] signed char stepLocal_1 = var_1_7; [L54] unsigned char stepLocal_0 = var_1_7 >= var_1_7; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-127, stepLocal_3=3, var_1_12=-127, var_1_17=1, var_1_18=3, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=-127, var_1_8=1, var_1_9=3] [L55] COND FALSE !(\read(var_1_2)) [L64] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-127, stepLocal_3=3, var_1_12=-127, var_1_17=1, var_1_18=3, var_1_1=1, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=-127, var_1_8=1, var_1_9=3] [L108] RET step() [L109] CALL, EXPR property() [L98-L99] return ((((var_1_2 ? (((var_1_7 >= var_1_7) && var_1_5) ? ((var_1_7 >= var_1_7) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) var_1_6))) : 1) : (var_1_1 == ((unsigned short int) var_1_6))) && ((var_1_17 <= ((var_1_17 / var_1_8) / var_1_9)) ? ((var_1_9 == (var_1_18 * (~ var_1_18))) ? (var_1_7 == ((signed char) var_1_12)) : (var_1_7 == ((signed char) var_1_12))) : (var_1_7 == ((signed char) var_1_12)))) && (var_1_13 == ((float) ((var_1_14 - var_1_15) - var_1_16)))) && (var_1_17 == ((unsigned long int) var_1_6))) && (var_1_18 == ((signed long int) var_1_9)) ; VAL [\result=0, isInitial=1, var_1_12=-127, var_1_17=1, var_1_18=3, var_1_1=1, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=-127, var_1_8=1, var_1_9=3] [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=-127, var_1_17=1, var_1_18=3, var_1_1=1, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=-127, var_1_8=1, var_1_9=3] [L19] reach_error() VAL [isInitial=1, var_1_12=-127, var_1_17=1, var_1_18=3, var_1_1=1, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=-127, var_1_8=1, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 17, 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, 73 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 73 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 544/544 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-11-08 23:42:55,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d6f9f8754fd5e74a79795681184ddd0bb5014968bab7230012cd8a3c9285d31 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:42:57,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:42:57,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:42:57,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:42:57,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:42:57,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:42:57,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:42:57,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:42:57,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:42:57,673 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:42:57,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:42:57,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:42:57,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:42:57,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:42:57,677 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:42:57,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:42:57,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:42:57,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:42:57,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:42:57,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:42:57,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:42:57,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:42:57,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:42:57,683 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:42:57,683 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:42:57,684 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:42:57,684 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:42:57,684 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:42:57,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:42:57,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:42:57,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:42:57,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:42:57,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:42:57,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:42:57,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:42:57,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:42:57,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:42:57,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:42:57,689 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:42:57,689 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:42:57,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:42:57,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:42:57,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:42:57,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:42:57,690 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d6f9f8754fd5e74a79795681184ddd0bb5014968bab7230012cd8a3c9285d31 [2024-11-08 23:42:58,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:42:58,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:42:58,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:42:58,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:42:58,029 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:42:58,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-11-08 23:42:59,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:42:59,731 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:42:59,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-11-08 23:42:59,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4991a4422/5e0eaa5622934958989fa75930263b3b/FLAG341a21f99 [2024-11-08 23:42:59,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4991a4422/5e0eaa5622934958989fa75930263b3b [2024-11-08 23:42:59,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:42:59,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:42:59,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:42:59,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:42:59,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:42:59,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:42:59" (1/1) ... [2024-11-08 23:42:59,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e75793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:42:59, skipping insertion in model container [2024-11-08 23:42:59,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:42:59" (1/1) ... [2024-11-08 23:42:59,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:42:59,988 WARN L250 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-1loop_file-55.i[915,928] [2024-11-08 23:43:00,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:43:00,057 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:43:00,070 WARN L250 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-1loop_file-55.i[915,928] [2024-11-08 23:43:00,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:43:00,121 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:43:00,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00 WrapperNode [2024-11-08 23:43:00,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:43:00,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:43:00,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:43:00,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:43:00,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (1/1) ... [2024-11-08 23:43:00,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (1/1) ... [2024-11-08 23:43:00,171 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-11-08 23:43:00,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:43:00,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:43:00,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:43:00,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:43:00,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (1/1) ... [2024-11-08 23:43:00,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (1/1) ... [2024-11-08 23:43:00,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (1/1) ... [2024-11-08 23:43:00,205 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-11-08 23:43:00,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (1/1) ... [2024-11-08 23:43:00,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (1/1) ... [2024-11-08 23:43:00,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (1/1) ... [2024-11-08 23:43:00,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (1/1) ... [2024-11-08 23:43:00,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (1/1) ... [2024-11-08 23:43:00,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (1/1) ... [2024-11-08 23:43:00,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:43:00,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:43:00,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:43:00,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:43:00,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (1/1) ... [2024-11-08 23:43:00,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:43:00,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:43:00,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:43:00,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:43:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:43:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:43:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:43:00,311 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:43:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:43:00,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:43:00,395 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:43:00,397 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:43:00,750 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 23:43:00,750 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:43:00,763 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:43:00,763 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:43:00,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:43:00 BoogieIcfgContainer [2024-11-08 23:43:00,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:43:00,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:43:00,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:43:00,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:43:00,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:42:59" (1/3) ... [2024-11-08 23:43:00,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3a1186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:43:00, skipping insertion in model container [2024-11-08 23:43:00,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:00" (2/3) ... [2024-11-08 23:43:00,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3a1186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:43:00, skipping insertion in model container [2024-11-08 23:43:00,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:43:00" (3/3) ... [2024-11-08 23:43:00,770 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-11-08 23:43:00,782 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:43:00,782 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:43:00,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:43:00,838 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;@7abff689, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:43:00,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:43:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 23:43:00,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 23:43:00,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:00,852 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:43:00,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:00,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:00,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1889692668, now seen corresponding path program 1 times [2024-11-08 23:43:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:43:00,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506169874] [2024-11-08 23:43:00,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:00,869 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-11-08 23:43:00,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:43:00,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-11-08 23:43:00,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 23:43:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:01,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:43:01,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:43:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 23:43:01,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:43:01,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:43:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506169874] [2024-11-08 23:43:01,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506169874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:43:01,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:43:01,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:43:01,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791277648] [2024-11-08 23:43:01,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:43:01,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:43:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:43:01,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:43:01,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:43:01,211 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 23:43:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:43:01,252 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2024-11-08 23:43:01,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:43:01,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2024-11-08 23:43:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:43:01,263 INFO L225 Difference]: With dead ends: 101 [2024-11-08 23:43:01,263 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 23:43:01,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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-11-08 23:43:01,271 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:43:01,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:43:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 23:43:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 23:43:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 23:43:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-08 23:43:01,319 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 106 [2024-11-08 23:43:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:43:01,319 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-08 23:43:01,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 23:43:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-08 23:43:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 23:43:01,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:01,325 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:43:01,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:43:01,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-11-08 23:43:01,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:01,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:01,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1503733250, now seen corresponding path program 1 times [2024-11-08 23:43:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:43:01,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276089732] [2024-11-08 23:43:01,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:01,528 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-11-08 23:43:01,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:43:01,530 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-11-08 23:43:01,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 23:43:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:01,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 23:43:01,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:43:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-08 23:43:35,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:43:35,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:43:35,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276089732] [2024-11-08 23:43:35,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276089732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:43:35,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:43:35,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 23:43:35,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474654463] [2024-11-08 23:43:35,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:43:35,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 23:43:35,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:43:35,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 23:43:35,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-08 23:43:35,598 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-08 23:44:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:44:06,372 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2024-11-08 23:44:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 23:44:06,373 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 106 [2024-11-08 23:44:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:44:06,376 INFO L225 Difference]: With dead ends: 101 [2024-11-08 23:44:06,376 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 23:44:06,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2024-11-08 23:44:06,378 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 119 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:44:06,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 285 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-11-08 23:44:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 23:44:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2024-11-08 23:44:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 23:44:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2024-11-08 23:44:06,399 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 119 transitions. Word has length 106 [2024-11-08 23:44:06,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:44:06,400 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 119 transitions. [2024-11-08 23:44:06,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-08 23:44:06,401 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 119 transitions. [2024-11-08 23:44:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 23:44:06,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:44:06,404 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:44:06,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 23:44:06,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-11-08 23:44:06,605 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:44:06,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:44:06,606 INFO L85 PathProgramCache]: Analyzing trace with hash 223421340, now seen corresponding path program 1 times [2024-11-08 23:44:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:44:06,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837546853] [2024-11-08 23:44:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:44:06,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:44:06,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:44:06,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-11-08 23:44:06,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 23:44:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:06,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 23:44:06,858 INFO L278 TraceCheckSpWp]: Computing forward predicates...