./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.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 7ee9ab0ce6c16857f5101fdd21f4b28f23af496d642a804f890a8c51cd803df8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:51:29,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:51:29,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:51:29,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:51:29,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:51:29,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:51:29,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:51:29,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:51:29,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:51:29,925 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:51:29,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:51:29,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:51:29,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:51:29,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:51:29,927 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:51:29,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:51:29,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:51:29,929 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:51:29,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:51:29,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:51:29,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:51:29,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:51:29,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:51:29,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:51:29,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:51:29,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:51:29,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:51:29,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:51:29,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:51:29,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:51:29,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:51:29,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:51:29,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:51:29,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:51:29,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:51:29,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:51:29,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:51:29,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:51:29,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:51:29,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:51:29,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:51:29,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:51:29,938 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 -> 7ee9ab0ce6c16857f5101fdd21f4b28f23af496d642a804f890a8c51cd803df8 [2024-10-13 05:51:30,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:51:30,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:51:30,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:51:30,262 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:51:30,262 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:51:30,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i [2024-10-13 05:51:31,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:51:31,961 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:51:31,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i [2024-10-13 05:51:31,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dab28d7c/a85edf8a4cb44f0aa593fba74350fb43/FLAG9f7bbd5a0 [2024-10-13 05:51:31,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dab28d7c/a85edf8a4cb44f0aa593fba74350fb43 [2024-10-13 05:51:31,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:51:31,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:51:31,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:51:31,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:51:32,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:51:32,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:51:31" (1/1) ... [2024-10-13 05:51:32,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a538da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32, skipping insertion in model container [2024-10-13 05:51:32,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:51:31" (1/1) ... [2024-10-13 05:51:32,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:51:32,202 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i[913,926] [2024-10-13 05:51:32,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:51:32,284 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:51:32,297 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i[913,926] [2024-10-13 05:51:32,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:51:32,345 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:51:32,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32 WrapperNode [2024-10-13 05:51:32,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:51:32,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:51:32,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:51:32,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:51:32,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (1/1) ... [2024-10-13 05:51:32,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (1/1) ... [2024-10-13 05:51:32,411 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-10-13 05:51:32,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:51:32,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:51:32,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:51:32,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:51:32,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (1/1) ... [2024-10-13 05:51:32,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (1/1) ... [2024-10-13 05:51:32,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (1/1) ... [2024-10-13 05:51:32,450 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:51:32,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (1/1) ... [2024-10-13 05:51:32,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (1/1) ... [2024-10-13 05:51:32,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (1/1) ... [2024-10-13 05:51:32,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (1/1) ... [2024-10-13 05:51:32,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (1/1) ... [2024-10-13 05:51:32,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (1/1) ... [2024-10-13 05:51:32,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:51:32,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:51:32,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:51:32,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:51:32,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (1/1) ... [2024-10-13 05:51:32,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:51:32,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:51:32,516 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-10-13 05:51:32,519 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-10-13 05:51:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:51:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:51:32,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:51:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:51:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:51:32,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:51:32,666 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:51:32,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:51:33,044 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 05:51:33,045 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:51:33,094 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:51:33,094 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:51:33,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:33 BoogieIcfgContainer [2024-10-13 05:51:33,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:51:33,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:51:33,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:51:33,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:51:33,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:51:31" (1/3) ... [2024-10-13 05:51:33,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773fd930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:51:33, skipping insertion in model container [2024-10-13 05:51:33,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:32" (2/3) ... [2024-10-13 05:51:33,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773fd930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:51:33, skipping insertion in model container [2024-10-13 05:51:33,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:33" (3/3) ... [2024-10-13 05:51:33,107 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-81.i [2024-10-13 05:51:33,124 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:51:33,124 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:51:33,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:51:33,192 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;@3fb32378, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:51:33,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:51:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 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-10-13 05:51:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 05:51:33,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:33,214 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] [2024-10-13 05:51:33,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:33,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:33,220 INFO L85 PathProgramCache]: Analyzing trace with hash 216966799, now seen corresponding path program 1 times [2024-10-13 05:51:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:51:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101697724] [2024-10-13 05:51:33,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:33,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:51:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:51:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:51:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:51:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 05:51:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 05:51:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 05:51:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 05:51:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:51:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:51:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:51:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:51:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:51:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:51:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 05:51:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 05:51:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:51:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:51:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 05:51:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:51:33,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:51:33,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101697724] [2024-10-13 05:51:33,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101697724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:51:33,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:51:33,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:51:33,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047837642] [2024-10-13 05:51:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:51:33,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:51:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:51:33,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:51:33,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:51:33,708 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 05:51:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:51:33,754 INFO L93 Difference]: Finished difference Result 119 states and 204 transitions. [2024-10-13 05:51:33,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:51:33,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 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 115 [2024-10-13 05:51:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:51:33,768 INFO L225 Difference]: With dead ends: 119 [2024-10-13 05:51:33,768 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 05:51:33,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:51:33,777 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:51:33,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:51:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 05:51:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-13 05:51:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 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-10-13 05:51:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-10-13 05:51:33,835 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 115 [2024-10-13 05:51:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:51:33,837 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-10-13 05:51:33,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 05:51:33,837 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-10-13 05:51:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 05:51:33,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:33,843 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] [2024-10-13 05:51:33,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:51:33,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:33,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash -903798969, now seen corresponding path program 1 times [2024-10-13 05:51:33,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:51:33,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972758534] [2024-10-13 05:51:33,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:33,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:51:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:51:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:51:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:51:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 05:51:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 05:51:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 05:51:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 05:51:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:51:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:51:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:51:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:51:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:51:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:51:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 05:51:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 05:51:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:51:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:51:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 05:51:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:51:34,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:51:34,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972758534] [2024-10-13 05:51:34,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972758534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:51:34,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:51:34,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:51:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024910593] [2024-10-13 05:51:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:51:34,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:51:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:51:34,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:51:34,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:51:34,276 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-13 05:51:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:51:34,519 INFO L93 Difference]: Finished difference Result 176 states and 266 transitions. [2024-10-13 05:51:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:51:34,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 115 [2024-10-13 05:51:34,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:51:34,523 INFO L225 Difference]: With dead ends: 176 [2024-10-13 05:51:34,523 INFO L226 Difference]: Without dead ends: 118 [2024-10-13 05:51:34,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:51:34,525 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 65 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:51:34,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 226 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:51:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-13 05:51:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2024-10-13 05:51:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 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-10-13 05:51:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 166 transitions. [2024-10-13 05:51:34,555 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 166 transitions. Word has length 115 [2024-10-13 05:51:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:51:34,557 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 166 transitions. [2024-10-13 05:51:34,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-13 05:51:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 166 transitions. [2024-10-13 05:51:34,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 05:51:34,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:34,561 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] [2024-10-13 05:51:34,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:51:34,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:34,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1391051410, now seen corresponding path program 1 times [2024-10-13 05:51:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:51:34,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838042597] [2024-10-13 05:51:34,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:51:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:51:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:51:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:51:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 05:51:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 05:51:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 05:51:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 05:51:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:51:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:51:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:51:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:51:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:51:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:51:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 05:51:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 05:51:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:51:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:51:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 05:51:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:51:34,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:51:34,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838042597] [2024-10-13 05:51:34,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838042597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:51:34,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:51:34,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:51:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80396343] [2024-10-13 05:51:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:51:34,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:51:34,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:51:34,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:51:34,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:51:34,941 INFO L87 Difference]: Start difference. First operand 110 states and 166 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-10-13 05:51:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:51:35,146 INFO L93 Difference]: Finished difference Result 189 states and 283 transitions. [2024-10-13 05:51:35,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:51:35,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 116 [2024-10-13 05:51:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:51:35,149 INFO L225 Difference]: With dead ends: 189 [2024-10-13 05:51:35,151 INFO L226 Difference]: Without dead ends: 118 [2024-10-13 05:51:35,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:51:35,153 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 57 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:51:35,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 234 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:51:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-13 05:51:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2024-10-13 05:51:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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-10-13 05:51:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 164 transitions. [2024-10-13 05:51:35,179 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 164 transitions. Word has length 116 [2024-10-13 05:51:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:51:35,179 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 164 transitions. [2024-10-13 05:51:35,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-10-13 05:51:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 164 transitions. [2024-10-13 05:51:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 05:51:35,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:35,181 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] [2024-10-13 05:51:35,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:51:35,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:35,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:35,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1115607215, now seen corresponding path program 1 times [2024-10-13 05:51:35,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:51:35,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184783907] [2024-10-13 05:51:35,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:35,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:51:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:51:35,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:51:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:51:35,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:51:35,387 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:51:35,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:51:35,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:51:35,395 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 05:51:35,493 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:51:35,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:51:35 BoogieIcfgContainer [2024-10-13 05:51:35,498 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:51:35,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:51:35,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:51:35,500 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:51:35,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:33" (3/4) ... [2024-10-13 05:51:35,503 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:51:35,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:51:35,505 INFO L158 Benchmark]: Toolchain (without parser) took 3509.77ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 145.5MB in the beginning and 160.3MB in the end (delta: -14.8MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-10-13 05:51:35,506 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:51:35,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.71ms. Allocated memory is still 174.1MB. Free memory was 145.5MB in the beginning and 129.9MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 05:51:35,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.09ms. Allocated memory is still 174.1MB. Free memory was 129.9MB in the beginning and 126.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:51:35,508 INFO L158 Benchmark]: Boogie Preprocessor took 56.03ms. Allocated memory is still 174.1MB. Free memory was 126.8MB in the beginning and 123.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:51:35,508 INFO L158 Benchmark]: RCFGBuilder took 625.71ms. Allocated memory is still 174.1MB. Free memory was 123.6MB in the beginning and 131.1MB in the end (delta: -7.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 05:51:35,509 INFO L158 Benchmark]: TraceAbstraction took 2399.84ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 130.0MB in the beginning and 161.3MB in the end (delta: -31.3MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-10-13 05:51:35,510 INFO L158 Benchmark]: Witness Printer took 5.46ms. Allocated memory is still 209.7MB. Free memory was 161.3MB in the beginning and 160.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:51:35,511 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.16ms. Allocated memory is still 109.1MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.71ms. Allocated memory is still 174.1MB. Free memory was 145.5MB in the beginning and 129.9MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.09ms. Allocated memory is still 174.1MB. Free memory was 129.9MB in the beginning and 126.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.03ms. Allocated memory is still 174.1MB. Free memory was 126.8MB in the beginning and 123.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 625.71ms. Allocated memory is still 174.1MB. Free memory was 123.6MB in the beginning and 131.1MB in the end (delta: -7.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2399.84ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 130.0MB in the beginning and 161.3MB in the end (delta: -31.3MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Witness Printer took 5.46ms. Allocated memory is still 209.7MB. Free memory was 161.3MB in the beginning and 160.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of bitwiseOr at line 43, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.5; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 4.5; [L25] double var_1_4 = 2.5; [L26] double var_1_5 = 0.0; [L27] double var_1_6 = 999999999999.3; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = 16; [L30] signed char var_1_12 = 16; [L31] unsigned short int var_1_13 = 5; [L32] unsigned char var_1_14 = 1; [L33] unsigned short int var_1_15 = 16; [L34] unsigned short int var_1_16 = 32647; [L35] unsigned short int var_1_17 = 128; [L36] signed long int var_1_18 = -8; [L37] unsigned short int last_1_var_1_13 = 5; [L38] signed long int last_1_var_1_18 = -8; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] last_1_var_1_13 = var_1_13 [L103] last_1_var_1_18 = var_1_18 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] var_1_3 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L75] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L76] var_1_4 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L77] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L78] var_1_5 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_6=9999999999993/10, var_1_7=-128] [L79] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_6=9999999999993/10, var_1_7=-128] [L80] var_1_6 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L81] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L82] var_1_11 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L83] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L84] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L85] var_1_12 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L86] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L87] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L88] var_1_14 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L89] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L90] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L91] var_1_15 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L92] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L93] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L94] var_1_16 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L95] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L96] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L97] var_1_17 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L98] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L99] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L99] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L114] RET updateVariables() [L115] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18)); VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L43] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L43] COND FALSE !(stepLocal_0 != (last_1_var_1_18 ^ last_1_var_1_13)) [L48] var_1_7 = ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=4] [L50] unsigned char stepLocal_1 = var_1_11 >= var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_1=1, var_1_11=5, var_1_12=4, var_1_13=5, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=4] [L51] COND FALSE !(stepLocal_1 && var_1_14) [L54] var_1_13 = ((var_1_16 - 5) + var_1_17) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=16378, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=4] [L56] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_2=4, var_1_11=5, var_1_12=4, var_1_13=16378, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=4] [L57] COND FALSE !(stepLocal_2 > var_1_16) [L64] var_1_18 = var_1_15 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=16378, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=100, var_1_1=19999/2, var_1_2=1, var_1_7=4] [L66] COND TRUE \read(var_1_2) [L67] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=16378, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=100, var_1_1=1000000000004, var_1_2=1, var_1_3=1000000000004, var_1_7=4] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR (var_1_2 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=16378, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=100, var_1_1=1000000000004, var_1_2=1, var_1_3=1000000000004, var_1_7=4] [L106-L107] return (((var_1_2 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))))))) && (((var_1_11 >= var_1_7) && var_1_14) ? (var_1_13 == ((unsigned short int) ((((var_1_15) < (100)) ? (var_1_15) : (100))))) : (var_1_13 == ((unsigned short int) ((var_1_16 - 5) + var_1_17))))) && ((var_1_7 > var_1_16) ? ((var_1_3 < (var_1_5 - var_1_6)) ? (var_1_18 == ((signed long int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) : (var_1_18 == ((signed long int) var_1_13))) : (var_1_18 == ((signed long int) var_1_15))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=16378, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=100, var_1_1=1000000000004, var_1_2=1, var_1_3=1000000000004, var_1_7=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=5, var_1_12=4, var_1_13=16378, var_1_14=0, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=100, var_1_1=1000000000004, var_1_2=1, var_1_3=1000000000004, var_1_7=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 546 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 304 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 242 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=2, InterpolantAutomatonStates: 10, 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, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1836/1836 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 05:51:35,542 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.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 7ee9ab0ce6c16857f5101fdd21f4b28f23af496d642a804f890a8c51cd803df8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:51:37,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:51:37,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:51:37,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:51:37,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:51:37,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:51:37,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:51:37,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:51:37,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:51:37,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:51:37,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:51:37,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:51:37,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:51:37,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:51:37,908 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:51:37,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:51:37,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:51:37,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:51:37,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:51:37,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:51:37,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:51:37,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:51:37,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:51:37,914 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:51:37,914 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:51:37,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:51:37,915 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:51:37,918 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:51:37,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:51:37,918 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:51:37,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:51:37,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:51:37,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:51:37,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:51:37,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:51:37,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:51:37,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:51:37,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:51:37,927 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:51:37,928 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:51:37,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:51:37,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:51:37,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:51:37,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:51:37,931 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:51:37,931 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 -> 7ee9ab0ce6c16857f5101fdd21f4b28f23af496d642a804f890a8c51cd803df8 [2024-10-13 05:51:38,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:51:38,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:51:38,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:51:38,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:51:38,302 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:51:38,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i [2024-10-13 05:51:39,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:51:40,096 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:51:40,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i [2024-10-13 05:51:40,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e35f8a7d/380b1c1a897d47ff93b339e6fe77984b/FLAGfc28bce72 [2024-10-13 05:51:40,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e35f8a7d/380b1c1a897d47ff93b339e6fe77984b [2024-10-13 05:51:40,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:51:40,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:51:40,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:51:40,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:51:40,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:51:40,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7530bcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40, skipping insertion in model container [2024-10-13 05:51:40,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:51:40,369 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i[913,926] [2024-10-13 05:51:40,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:51:40,455 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:51:40,466 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i[913,926] [2024-10-13 05:51:40,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:51:40,520 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:51:40,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40 WrapperNode [2024-10-13 05:51:40,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:51:40,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:51:40,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:51:40,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:51:40,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,580 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-13 05:51:40,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:51:40,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:51:40,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:51:40,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:51:40,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,623 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:51:40,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:51:40,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:51:40,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:51:40,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:51:40,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (1/1) ... [2024-10-13 05:51:40,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:51:40,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:51:40,686 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-10-13 05:51:40,689 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-10-13 05:51:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:51:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:51:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:51:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:51:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:51:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:51:40,802 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:51:40,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:51:42,811 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 05:51:42,812 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:51:42,854 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:51:42,855 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:51:42,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:42 BoogieIcfgContainer [2024-10-13 05:51:42,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:51:42,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:51:42,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:51:42,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:51:42,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:51:40" (1/3) ... [2024-10-13 05:51:42,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d65475c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:51:42, skipping insertion in model container [2024-10-13 05:51:42,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:40" (2/3) ... [2024-10-13 05:51:42,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d65475c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:51:42, skipping insertion in model container [2024-10-13 05:51:42,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:42" (3/3) ... [2024-10-13 05:51:42,865 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-81.i [2024-10-13 05:51:42,879 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:51:42,879 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:51:42,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:51:42,943 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;@2a48c0cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:51:42,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:51:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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-10-13 05:51:42,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 05:51:42,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:42,956 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] [2024-10-13 05:51:42,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:42,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:42,966 INFO L85 PathProgramCache]: Analyzing trace with hash 848552912, now seen corresponding path program 1 times [2024-10-13 05:51:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:51:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725627281] [2024-10-13 05:51:42,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:42,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:51:42,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:51:42,985 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-10-13 05:51:42,986 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-10-13 05:51:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:43,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:51:43,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:51:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-10-13 05:51:43,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:51:43,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:51:43,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725627281] [2024-10-13 05:51:43,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725627281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:51:43,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:51:43,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:51:43,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070780145] [2024-10-13 05:51:43,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:51:43,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:51:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:51:43,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:51:43,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:51:43,375 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-10-13 05:51:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:51:43,772 INFO L93 Difference]: Finished difference Result 97 states and 168 transitions. [2024-10-13 05:51:43,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:51:43,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 112 [2024-10-13 05:51:43,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:51:43,792 INFO L225 Difference]: With dead ends: 97 [2024-10-13 05:51:43,792 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 05:51:43,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:51:43,798 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:51:43,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:51:43,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 05:51:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-13 05:51:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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-10-13 05:51:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-10-13 05:51:43,832 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 112 [2024-10-13 05:51:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:51:43,833 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-10-13 05:51:43,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-10-13 05:51:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-10-13 05:51:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 05:51:43,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:43,836 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] [2024-10-13 05:51:43,844 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-10-13 05:51:44,036 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-10-13 05:51:44,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:44,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:44,038 INFO L85 PathProgramCache]: Analyzing trace with hash 252372504, now seen corresponding path program 1 times [2024-10-13 05:51:44,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:51:44,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502481813] [2024-10-13 05:51:44,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:44,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:51:44,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:51:44,040 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-10-13 05:51:44,042 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-10-13 05:51:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:44,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 05:51:44,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:51:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:51:45,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:51:45,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:51:45,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502481813] [2024-10-13 05:51:45,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502481813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:51:45,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:51:45,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:51:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096036970] [2024-10-13 05:51:45,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:51:45,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:51:45,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:51:45,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:51:45,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:51:45,587 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-10-13 05:51:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:51:47,354 INFO L93 Difference]: Finished difference Result 143 states and 212 transitions. [2024-10-13 05:51:47,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:51:47,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 112 [2024-10-13 05:51:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:51:47,368 INFO L225 Difference]: With dead ends: 143 [2024-10-13 05:51:47,368 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 05:51:47,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:51:47,370 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 37 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:51:47,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 223 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 05:51:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 05:51:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2024-10-13 05:51:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 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-10-13 05:51:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2024-10-13 05:51:47,407 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 112 [2024-10-13 05:51:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:51:47,409 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 123 transitions. [2024-10-13 05:51:47,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-10-13 05:51:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 123 transitions. [2024-10-13 05:51:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 05:51:47,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:47,417 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] [2024-10-13 05:51:47,428 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-10-13 05:51:47,618 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-10-13 05:51:47,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:47,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash 63761333, now seen corresponding path program 1 times [2024-10-13 05:51:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:51:47,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562910523] [2024-10-13 05:51:47,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:47,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:51:47,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:51:47,623 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-10-13 05:51:47,624 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-10-13 05:51:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:47,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 05:51:47,879 INFO L278 TraceCheckSpWp]: Computing forward predicates...