./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_50-1loop_file-17.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 0b697a59b560f107cb05fa2bb95aa53bb034abdbe37ed9bbc62776ace407c75d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:02:45,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:02:45,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:02:45,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:02:45,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:02:45,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:02:45,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:02:45,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:02:45,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:02:45,357 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:02:45,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:02:45,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:02:45,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:02:45,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:02:45,359 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:02:45,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:02:45,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:02:45,360 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:02:45,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:02:45,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:02:45,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:02:45,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:02:45,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:02:45,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:02:45,363 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:02:45,363 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:02:45,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:02:45,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:02:45,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:02:45,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:02:45,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:02:45,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:02:45,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:02:45,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:02:45,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:02:45,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:02:45,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:02:45,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:02:45,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:02:45,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:02:45,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:02:45,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:02:45,369 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 -> 0b697a59b560f107cb05fa2bb95aa53bb034abdbe37ed9bbc62776ace407c75d [2024-11-18 23:02:45,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:02:45,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:02:45,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:02:45,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:02:45,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:02:45,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-17.i [2024-11-18 23:02:47,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:02:47,323 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:02:47,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-17.i [2024-11-18 23:02:47,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473e6d6c7/1ec3e03f9e824958b87dc08cc9e079fc/FLAG72d5750b9 [2024-11-18 23:02:47,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473e6d6c7/1ec3e03f9e824958b87dc08cc9e079fc [2024-11-18 23:02:47,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:02:47,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:02:47,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:02:47,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:02:47,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:02:47,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ea88a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47, skipping insertion in model container [2024-11-18 23:02:47,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:02:47,598 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_50-1loop_file-17.i[915,928] [2024-11-18 23:02:47,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:02:47,720 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:02:47,734 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_50-1loop_file-17.i[915,928] [2024-11-18 23:02:47,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:02:47,800 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:02:47,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47 WrapperNode [2024-11-18 23:02:47,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:02:47,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:02:47,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:02:47,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:02:47,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,860 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-11-18 23:02:47,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:02:47,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:02:47,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:02:47,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:02:47,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,904 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-18 23:02:47,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:02:47,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:02:47,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:02:47,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:02:47,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (1/1) ... [2024-11-18 23:02:47,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:02:47,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:02:47,972 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-18 23:02:47,982 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-18 23:02:48,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:02:48,030 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:02:48,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:02:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:02:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:02:48,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:02:48,123 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:02:48,129 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:02:48,531 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-18 23:02:48,531 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:02:48,554 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:02:48,554 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:02:48,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:02:48 BoogieIcfgContainer [2024-11-18 23:02:48,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:02:48,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:02:48,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:02:48,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:02:48,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:02:47" (1/3) ... [2024-11-18 23:02:48,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9ba8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:02:48, skipping insertion in model container [2024-11-18 23:02:48,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47" (2/3) ... [2024-11-18 23:02:48,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9ba8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:02:48, skipping insertion in model container [2024-11-18 23:02:48,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:02:48" (3/3) ... [2024-11-18 23:02:48,562 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-17.i [2024-11-18 23:02:48,578 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:02:48,578 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:02:48,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:02:48,640 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;@e0637e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:02:48,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:02:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 23:02:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-18 23:02:48,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:02:48,656 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:02:48,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:02:48,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:02:48,661 INFO L85 PathProgramCache]: Analyzing trace with hash -181942592, now seen corresponding path program 1 times [2024-11-18 23:02:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:02:48,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166594597] [2024-11-18 23:02:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:02:48,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:02:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:02:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-18 23:02:48,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:02:48,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166594597] [2024-11-18 23:02:48,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166594597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:02:48,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721706194] [2024-11-18 23:02:48,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:02:48,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:02:48,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:02:48,975 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-18 23:02:48,977 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-18 23:02:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:02:49,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:02:49,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:02:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-18 23:02:49,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:02:49,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721706194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:02:49,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:02:49,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:02:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293546719] [2024-11-18 23:02:49,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:02:49,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:02:49,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:02:49,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:02:49,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:02:49,248 INFO L87 Difference]: Start difference. First operand has 75 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 23:02:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:02:49,283 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2024-11-18 23:02:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:02:49,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 122 [2024-11-18 23:02:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:02:49,293 INFO L225 Difference]: With dead ends: 147 [2024-11-18 23:02:49,294 INFO L226 Difference]: Without dead ends: 71 [2024-11-18 23:02:49,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-18 23:02:49,306 INFO L432 NwaCegarLoop]: 109 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, 109 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-18 23:02:49,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:02:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-18 23:02:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-18 23:02:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 23:02:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2024-11-18 23:02:49,354 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 122 [2024-11-18 23:02:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:02:49,355 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2024-11-18 23:02:49,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 23:02:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2024-11-18 23:02:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-18 23:02:49,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:02:49,359 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:02:49,375 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-18 23:02:49,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 23:02:49,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:02:49,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:02:49,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2147006532, now seen corresponding path program 1 times [2024-11-18 23:02:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:02:49,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523913682] [2024-11-18 23:02:49,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:02:49,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:02:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:02:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 23:02:50,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:02:50,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523913682] [2024-11-18 23:02:50,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523913682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:02:50,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:02:50,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 23:02:50,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474356606] [2024-11-18 23:02:50,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:02:50,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 23:02:50,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:02:50,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 23:02:50,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:02:50,258 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 23:02:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:02:50,490 INFO L93 Difference]: Finished difference Result 208 states and 310 transitions. [2024-11-18 23:02:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 23:02:50,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2024-11-18 23:02:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:02:50,496 INFO L225 Difference]: With dead ends: 208 [2024-11-18 23:02:50,498 INFO L226 Difference]: Without dead ends: 140 [2024-11-18 23:02:50,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:02:50,500 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 71 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:02:50,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 347 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:02:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-18 23:02:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2024-11-18 23:02:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 23:02:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 158 transitions. [2024-11-18 23:02:50,534 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 158 transitions. Word has length 122 [2024-11-18 23:02:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:02:50,535 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 158 transitions. [2024-11-18 23:02:50,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 23:02:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 158 transitions. [2024-11-18 23:02:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-18 23:02:50,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:02:50,539 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:02:50,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:02:50,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:02:50,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:02:50,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1149819513, now seen corresponding path program 1 times [2024-11-18 23:02:50,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:02:50,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597160055] [2024-11-18 23:02:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:02:50,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:02:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:02:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 23:02:51,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:02:51,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597160055] [2024-11-18 23:02:51,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597160055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:02:51,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618202053] [2024-11-18 23:02:51,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:02:51,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:02:51,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:02:51,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:02:51,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 23:02:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:02:51,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 23:02:51,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:02:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 317 proven. 21 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-18 23:02:51,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:02:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 23:02:52,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618202053] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:02:52,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:02:52,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2024-11-18 23:02:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717033213] [2024-11-18 23:02:52,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:02:52,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-18 23:02:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:02:52,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-18 23:02:52,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-11-18 23:02:52,317 INFO L87 Difference]: Start difference. First operand 107 states and 158 transitions. Second operand has 19 states, 19 states have (on average 4.421052631578948) internal successors, (84), 19 states have internal predecessors, (84), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2024-11-18 23:02:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:02:53,318 INFO L93 Difference]: Finished difference Result 333 states and 477 transitions. [2024-11-18 23:02:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 23:02:53,319 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.421052631578948) internal successors, (84), 19 states have internal predecessors, (84), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) Word has length 123 [2024-11-18 23:02:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:02:53,323 INFO L225 Difference]: With dead ends: 333 [2024-11-18 23:02:53,326 INFO L226 Difference]: Without dead ends: 265 [2024-11-18 23:02:53,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2024-11-18 23:02:53,330 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 551 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 23:02:53,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 601 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 23:02:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-18 23:02:53,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 171. [2024-11-18 23:02:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 110 states have (on average 1.2) internal successors, (132), 111 states have internal predecessors, (132), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-18 23:02:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 240 transitions. [2024-11-18 23:02:53,372 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 240 transitions. Word has length 123 [2024-11-18 23:02:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:02:53,373 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 240 transitions. [2024-11-18 23:02:53,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.421052631578948) internal successors, (84), 19 states have internal predecessors, (84), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2024-11-18 23:02:53,373 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 240 transitions. [2024-11-18 23:02:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-18 23:02:53,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:02:53,376 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:02:53,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 23:02:53,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-18 23:02:53,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:02:53,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:02:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash 891654075, now seen corresponding path program 1 times [2024-11-18 23:02:53,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:02:53,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972863834] [2024-11-18 23:02:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:02:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:02:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 23:02:53,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1113661973] [2024-11-18 23:02:53,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:02:53,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:02:53,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:02:53,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:02:53,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 23:02:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:02:53,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 23:02:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:02:53,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 23:02:53,922 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 23:02:53,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:02:53,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 23:02:54,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:02:54,132 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-18 23:02:54,230 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:02:54,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:02:54 BoogieIcfgContainer [2024-11-18 23:02:54,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:02:54,237 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:02:54,237 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:02:54,237 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:02:54,238 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:02:48" (3/4) ... [2024-11-18 23:02:54,241 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 23:02:54,242 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:02:54,244 INFO L158 Benchmark]: Toolchain (without parser) took 6887.24ms. Allocated memory was 144.7MB in the beginning and 234.9MB in the end (delta: 90.2MB). Free memory was 75.2MB in the beginning and 96.0MB in the end (delta: -20.7MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2024-11-18 23:02:54,244 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 144.7MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:02:54,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.76ms. Allocated memory is still 144.7MB. Free memory was 75.0MB in the beginning and 112.5MB in the end (delta: -37.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-18 23:02:54,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.79ms. Allocated memory is still 144.7MB. Free memory was 112.5MB in the beginning and 109.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 23:02:54,246 INFO L158 Benchmark]: Boogie Preprocessor took 69.25ms. Allocated memory is still 144.7MB. Free memory was 109.1MB in the beginning and 103.7MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 23:02:54,246 INFO L158 Benchmark]: RCFGBuilder took 620.23ms. Allocated memory is still 144.7MB. Free memory was 103.7MB in the beginning and 79.0MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-18 23:02:54,246 INFO L158 Benchmark]: TraceAbstraction took 5679.70ms. Allocated memory was 144.7MB in the beginning and 234.9MB in the end (delta: 90.2MB). Free memory was 79.0MB in the beginning and 96.0MB in the end (delta: -17.0MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. [2024-11-18 23:02:54,248 INFO L158 Benchmark]: Witness Printer took 6.15ms. Allocated memory is still 234.9MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:02:54,249 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.23ms. Allocated memory is still 144.7MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.76ms. Allocated memory is still 144.7MB. Free memory was 75.0MB in the beginning and 112.5MB in the end (delta: -37.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.79ms. Allocated memory is still 144.7MB. Free memory was 112.5MB in the beginning and 109.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.25ms. Allocated memory is still 144.7MB. Free memory was 109.1MB in the beginning and 103.7MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 620.23ms. Allocated memory is still 144.7MB. Free memory was 103.7MB in the beginning and 79.0MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5679.70ms. Allocated memory was 144.7MB in the beginning and 234.9MB in the end (delta: 90.2MB). Free memory was 79.0MB in the beginning and 96.0MB in the end (delta: -17.0MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. * Witness Printer took 6.15ms. Allocated memory is still 234.9MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] unsigned char last_1_var_1_8 = 1; [L40] signed char last_1_var_1_14 = -1; VAL [isInitial=0, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L125] isInitial = 1 [L126] FCALL initially() [L127] int k_loop; [L128] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L128] COND TRUE k_loop < 1 [L129] CALL updateLastVariables() [L117] last_1_var_1_8 = var_1_8 [L118] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L129] RET updateLastVariables() [L130] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L89] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L90] var_1_3 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L95] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L96] var_1_7 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L99] var_1_9 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L100] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L101] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L102] var_1_10 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L103] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L104] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L105] var_1_12 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L106] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L107] var_1_13 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L108] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L109] var_1_15 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L110] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L111] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L111] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L112] var_1_19 = __VERIFIER_nondet_ulong() [L113] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L113] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L114] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L114] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L130] RET updateVariables() [L131] CALL step() [L44] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L45] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L46] COND TRUE \read(last_1_var_1_8) [L47] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L52] COND TRUE var_1_5 < var_1_3 [L53] var_1_8 = ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L57] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L58] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L63] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L64] COND TRUE stepLocal_3 || (var_1_8 && var_1_10) [L65] var_1_18 = (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L69] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L70] COND TRUE var_1_4 == stepLocal_1 [L71] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L73] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L73] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L74] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L131] RET step() [L132] CALL, EXPR property() [L121] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L121-L122] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483654, var_1_19=-2147483649, var_1_1=55, var_1_2=5, var_1_3=262, var_1_4=7, var_1_5=-4, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 632 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 622 mSDsluCounter, 1057 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 770 mSDsCounter, 240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 792 IncrementalHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 240 mSolverCounterUnsat, 287 mSDtfsCounter, 792 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 127 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 858 NumberOfCodeBlocks, 858 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 1760 SizeOfPredicates, 4 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 3575/3672 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-18 23:02:54,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_50-1loop_file-17.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 0b697a59b560f107cb05fa2bb95aa53bb034abdbe37ed9bbc62776ace407c75d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:02:56,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:02:56,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 23:02:56,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:02:56,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:02:56,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:02:56,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:02:56,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:02:56,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:02:56,768 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:02:56,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:02:56,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:02:56,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:02:56,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:02:56,770 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:02:56,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:02:56,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:02:56,771 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:02:56,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:02:56,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:02:56,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:02:56,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:02:56,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:02:56,778 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 23:02:56,778 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 23:02:56,778 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:02:56,779 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 23:02:56,779 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:02:56,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:02:56,779 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:02:56,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:02:56,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:02:56,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:02:56,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:02:56,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:02:56,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:02:56,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:02:56,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:02:56,783 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 23:02:56,783 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 23:02:56,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:02:56,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:02:56,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:02:56,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:02:56,785 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 -> 0b697a59b560f107cb05fa2bb95aa53bb034abdbe37ed9bbc62776ace407c75d [2024-11-18 23:02:57,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:02:57,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:02:57,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:02:57,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:02:57,168 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:02:57,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-17.i [2024-11-18 23:02:58,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:02:59,053 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:02:59,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-17.i [2024-11-18 23:02:59,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f21d31efe/f0ae3088b4f04ca8bd40cab198805796/FLAG48df394dc [2024-11-18 23:02:59,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f21d31efe/f0ae3088b4f04ca8bd40cab198805796 [2024-11-18 23:02:59,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:02:59,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:02:59,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:02:59,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:02:59,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:02:59,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d64e434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59, skipping insertion in model container [2024-11-18 23:02:59,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:02:59,642 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_50-1loop_file-17.i[915,928] [2024-11-18 23:02:59,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:02:59,746 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:02:59,759 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_50-1loop_file-17.i[915,928] [2024-11-18 23:02:59,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:02:59,819 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:02:59,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59 WrapperNode [2024-11-18 23:02:59,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:02:59,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:02:59,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:02:59,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:02:59,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,892 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-11-18 23:02:59,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:02:59,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:02:59,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:02:59,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:02:59,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,930 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-18 23:02:59,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:02:59,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:02:59,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:02:59,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:02:59,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (1/1) ... [2024-11-18 23:02:59,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:02:59,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:03:00,016 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-18 23:03:00,023 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-18 23:03:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:03:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 23:03:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:03:00,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:03:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:03:00,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:03:00,173 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:03:00,176 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:03:00,974 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-18 23:03:00,974 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:03:00,993 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:03:00,993 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:03:00,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:03:00 BoogieIcfgContainer [2024-11-18 23:03:00,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:03:00,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:03:00,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:03:01,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:03:01,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:02:59" (1/3) ... [2024-11-18 23:03:01,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b136b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:03:01, skipping insertion in model container [2024-11-18 23:03:01,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:59" (2/3) ... [2024-11-18 23:03:01,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b136b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:03:01, skipping insertion in model container [2024-11-18 23:03:01,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:03:00" (3/3) ... [2024-11-18 23:03:01,004 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-17.i [2024-11-18 23:03:01,024 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:03:01,024 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:03:01,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:03:01,117 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;@42f92628, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:03:01,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:03:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 23:03:01,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-18 23:03:01,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:03:01,140 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:03:01,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:03:01,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:03:01,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1360721473, now seen corresponding path program 1 times [2024-11-18 23:03:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:03:01,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235866319] [2024-11-18 23:03:01,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:03:01,168 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-18 23:03:01,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:03:01,172 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-18 23:03:01,173 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-18 23:03:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:03:01,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:03:01,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:03:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-18 23:03:01,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:03:01,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:03:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235866319] [2024-11-18 23:03:01,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235866319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:03:01,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:03:01,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 23:03:01,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527501611] [2024-11-18 23:03:01,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:03:01,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:03:01,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:03:01,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:03:01,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:03:01,527 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 23:03:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:03:01,563 INFO L93 Difference]: Finished difference Result 121 states and 199 transitions. [2024-11-18 23:03:01,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:03:01,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2024-11-18 23:03:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:03:01,571 INFO L225 Difference]: With dead ends: 121 [2024-11-18 23:03:01,571 INFO L226 Difference]: Without dead ends: 58 [2024-11-18 23:03:01,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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-18 23:03:01,578 INFO L432 NwaCegarLoop]: 89 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, 89 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-18 23:03:01,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:03:01,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-18 23:03:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-18 23:03:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 23:03:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-11-18 23:03:01,625 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 119 [2024-11-18 23:03:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:03:01,626 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-11-18 23:03:01,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 23:03:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-11-18 23:03:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-18 23:03:01,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:03:01,629 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:03:01,636 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-18 23:03:01,830 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-18 23:03:01,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:03:01,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:03:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1279187269, now seen corresponding path program 1 times [2024-11-18 23:03:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:03:01,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18832422] [2024-11-18 23:03:01,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:03:01,833 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-18 23:03:01,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:03:01,837 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-18 23:03:01,838 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-18 23:03:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:03:02,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 23:03:02,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:03:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 23:03:02,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:03:02,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:03:02,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18832422] [2024-11-18 23:03:02,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18832422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:03:02,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:03:02,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 23:03:02,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003236861] [2024-11-18 23:03:02,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:03:02,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 23:03:02,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:03:02,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 23:03:02,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:03:02,438 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 23:03:03,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:03:03,285 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2024-11-18 23:03:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 23:03:03,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-18 23:03:03,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:03:03,296 INFO L225 Difference]: With dead ends: 169 [2024-11-18 23:03:03,296 INFO L226 Difference]: Without dead ends: 114 [2024-11-18 23:03:03,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 23:03:03,298 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 48 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 23:03:03,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 268 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 23:03:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-18 23:03:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2024-11-18 23:03:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 23:03:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2024-11-18 23:03:03,326 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 119 [2024-11-18 23:03:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:03:03,327 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2024-11-18 23:03:03,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 23:03:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2024-11-18 23:03:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-18 23:03:03,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:03:03,329 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:03:03,337 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-18 23:03:03,530 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-18 23:03:03,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:03:03,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:03:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1213892242, now seen corresponding path program 1 times [2024-11-18 23:03:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:03:03,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688992218] [2024-11-18 23:03:03,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:03:03,532 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-18 23:03:03,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:03:03,535 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-18 23:03:03,537 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-18 23:03:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:03:03,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 23:03:03,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:03:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 317 proven. 21 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-18 23:03:04,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:03:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 23:03:05,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:03:05,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688992218] [2024-11-18 23:03:05,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688992218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:03:05,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 23:03:05,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-18 23:03:05,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827829216] [2024-11-18 23:03:05,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 23:03:05,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 23:03:05,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:03:05,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 23:03:05,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-18 23:03:05,026 INFO L87 Difference]: Start difference. First operand 94 states and 138 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-18 23:03:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:03:07,584 INFO L93 Difference]: Finished difference Result 279 states and 398 transitions. [2024-11-18 23:03:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 23:03:07,585 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 120 [2024-11-18 23:03:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:03:07,591 INFO L225 Difference]: With dead ends: 279 [2024-11-18 23:03:07,593 INFO L226 Difference]: Without dead ends: 224 [2024-11-18 23:03:07,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2024-11-18 23:03:07,599 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 408 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-18 23:03:07,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 367 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-18 23:03:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-18 23:03:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 163. [2024-11-18 23:03:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 103 states have (on average 1.2135922330097086) internal successors, (125), 103 states have internal predecessors, (125), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-18 23:03:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 233 transitions. [2024-11-18 23:03:07,654 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 233 transitions. Word has length 120 [2024-11-18 23:03:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:03:07,655 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 233 transitions. [2024-11-18 23:03:07,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-18 23:03:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 233 transitions. [2024-11-18 23:03:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-18 23:03:07,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:03:07,658 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:03:07,665 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 (4)] Ended with exit code 0 [2024-11-18 23:03:07,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-18 23:03:07,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:03:07,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:03:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1893950612, now seen corresponding path program 1 times [2024-11-18 23:03:07,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:03:07,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424759788] [2024-11-18 23:03:07,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:03:07,863 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-18 23:03:07,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:03:07,865 INFO L229 MonitoredProcess]: Starting monitored process 5 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-18 23:03:07,866 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 (5)] Waiting until timeout for monitored process [2024-11-18 23:03:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:03:08,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-18 23:03:08,052 INFO L278 TraceCheckSpWp]: Computing forward predicates...