./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-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b52051d145fb2b47c7d32126bb345ca7aff8e39890cc67cf57ddb4a3e09751a2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:07:59,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:07:59,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:07:59,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:07:59,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:07:59,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:07:59,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:07:59,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:07:59,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:07:59,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:07:59,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:07:59,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:07:59,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:07:59,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:07:59,524 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:07:59,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:07:59,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:07:59,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:07:59,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:07:59,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:07:59,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:07:59,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:07:59,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:07:59,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:07:59,530 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:07:59,530 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:07:59,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:07:59,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:07:59,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:07:59,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:07:59,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:07:59,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:07:59,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:07:59,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:07:59,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:07:59,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:07:59,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:07:59,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:07:59,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:07:59,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:07:59,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:07:59,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:07:59,537 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b52051d145fb2b47c7d32126bb345ca7aff8e39890cc67cf57ddb4a3e09751a2 [2024-10-11 13:07:59,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:07:59,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:07:59,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:07:59,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:07:59,782 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:07:59,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i [2024-10-11 13:08:01,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:08:01,345 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:08:01,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i [2024-10-11 13:08:01,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4d2244de1/aa3049782b754a7c96fb9d40f3d66b80/FLAG32a90383a [2024-10-11 13:08:01,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4d2244de1/aa3049782b754a7c96fb9d40f3d66b80 [2024-10-11 13:08:01,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:08:01,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:08:01,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:08:01,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:08:01,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:08:01,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:08:01" (1/1) ... [2024-10-11 13:08:01,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a59441a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:01, skipping insertion in model container [2024-10-11 13:08:01,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:08:01" (1/1) ... [2024-10-11 13:08:01,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:08:01,911 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-57.i[913,926] [2024-10-11 13:08:01,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:08:01,971 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:08:01,984 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-57.i[913,926] [2024-10-11 13:08:02,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:08:02,027 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:08:02,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02 WrapperNode [2024-10-11 13:08:02,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:08:02,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:08:02,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:08:02,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:08:02,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (1/1) ... [2024-10-11 13:08:02,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (1/1) ... [2024-10-11 13:08:02,063 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-11 13:08:02,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:08:02,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:08:02,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:08:02,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:08:02,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (1/1) ... [2024-10-11 13:08:02,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (1/1) ... [2024-10-11 13:08:02,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (1/1) ... [2024-10-11 13:08:02,090 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 13:08:02,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (1/1) ... [2024-10-11 13:08:02,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (1/1) ... [2024-10-11 13:08:02,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (1/1) ... [2024-10-11 13:08:02,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (1/1) ... [2024-10-11 13:08:02,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (1/1) ... [2024-10-11 13:08:02,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (1/1) ... [2024-10-11 13:08:02,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:08:02,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:08:02,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:08:02,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:08:02,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (1/1) ... [2024-10-11 13:08:02,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:08:02,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:08:02,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:08:02,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:08:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:08:02,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:08:02,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:08:02,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:08:02,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:08:02,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:08:02,230 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:08:02,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:08:02,483 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 13:08:02,483 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:08:02,518 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:08:02,518 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:08:02,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:02 BoogieIcfgContainer [2024-10-11 13:08:02,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:08:02,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:08:02,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:08:02,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:08:02,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:08:01" (1/3) ... [2024-10-11 13:08:02,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21caabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:08:02, skipping insertion in model container [2024-10-11 13:08:02,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:02" (2/3) ... [2024-10-11 13:08:02,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21caabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:08:02, skipping insertion in model container [2024-10-11 13:08:02,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:02" (3/3) ... [2024-10-11 13:08:02,527 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-57.i [2024-10-11 13:08:02,541 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:08:02,541 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:08:02,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:08:02,597 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;@665f8998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:08:02,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:08:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 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-11 13:08:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 13:08:02,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:02,612 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] [2024-10-11 13:08:02,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:02,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash -669129977, now seen corresponding path program 1 times [2024-10-11 13:08:02,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:08:02,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567458673] [2024-10-11 13:08:02,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:08:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:08:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:08:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:08:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:08:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:08:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:08:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:08:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:08:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:08:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:08:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:08:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:08:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:08:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:08:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:08:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:08:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:08:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:08:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:02,996 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-11 13:08:02,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:08:02,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567458673] [2024-10-11 13:08:02,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567458673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:08:02,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:08:02,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:08:03,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752357043] [2024-10-11 13:08:03,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:08:03,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:08:03,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:08:03,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:08:03,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:08:03,043 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-11 13:08:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:08:03,079 INFO L93 Difference]: Finished difference Result 91 states and 160 transitions. [2024-10-11 13:08:03,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:08:03,081 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (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 109 [2024-10-11 13:08:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:08:03,088 INFO L225 Difference]: With dead ends: 91 [2024-10-11 13:08:03,088 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 13:08:03,091 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-11 13:08:03,096 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:08:03,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:08:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 13:08:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 13:08:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-11 13:08:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2024-10-11 13:08:03,155 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 109 [2024-10-11 13:08:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:08:03,171 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-11 13:08:03,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (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-11 13:08:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2024-10-11 13:08:03,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 13:08:03,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:03,176 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] [2024-10-11 13:08:03,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:08:03,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:03,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1043084857, now seen corresponding path program 1 times [2024-10-11 13:08:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:08:03,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109305477] [2024-10-11 13:08:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:08:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:08:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:08:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:08:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:08:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:08:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:08:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:08:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:08:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:08:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:08:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:08:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:08:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:08:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:08:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:08:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:08:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:08:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:08:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:03,592 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-11 13:08:03,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:08:03,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109305477] [2024-10-11 13:08:03,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109305477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:08:03,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:08:03,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:08:03,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249261229] [2024-10-11 13:08:03,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:08:03,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:08:03,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:08:03,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:08:03,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:08:03,600 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-11 13:08:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:08:03,803 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2024-10-11 13:08:03,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:08:03,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 109 [2024-10-11 13:08:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:08:03,808 INFO L225 Difference]: With dead ends: 134 [2024-10-11 13:08:03,808 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 13:08:03,809 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-11 13:08:03,811 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:08:03,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 180 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:08:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 13:08:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-10-11 13:08:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 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-11 13:08:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 117 transitions. [2024-10-11 13:08:03,845 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 117 transitions. Word has length 109 [2024-10-11 13:08:03,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:08:03,846 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 117 transitions. [2024-10-11 13:08:03,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-11 13:08:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 117 transitions. [2024-10-11 13:08:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:08:03,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:03,848 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] [2024-10-11 13:08:03,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:08:03,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:03,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1494859976, now seen corresponding path program 1 times [2024-10-11 13:08:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:08:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658861275] [2024-10-11 13:08:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:08:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:08:03,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:08:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:08:04,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:08:04,067 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:08:04,069 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:08:04,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:08:04,073 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 13:08:04,137 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:08:04,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:08:04 BoogieIcfgContainer [2024-10-11 13:08:04,140 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:08:04,140 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:08:04,141 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:08:04,141 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:08:04,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:02" (3/4) ... [2024-10-11 13:08:04,143 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:08:04,144 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:08:04,144 INFO L158 Benchmark]: Toolchain (without parser) took 2391.22ms. Allocated memory was 159.4MB in the beginning and 276.8MB in the end (delta: 117.4MB). Free memory was 86.4MB in the beginning and 154.1MB in the end (delta: -67.6MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2024-10-11 13:08:04,145 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory was 110.8MB in the beginning and 110.6MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:08:04,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.08ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 72.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:08:04,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.86ms. Allocated memory is still 159.4MB. Free memory was 72.3MB in the beginning and 70.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:08:04,146 INFO L158 Benchmark]: Boogie Preprocessor took 35.91ms. Allocated memory is still 159.4MB. Free memory was 70.2MB in the beginning and 67.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:08:04,146 INFO L158 Benchmark]: RCFGBuilder took 418.96ms. Allocated memory was 159.4MB in the beginning and 276.8MB in the end (delta: 117.4MB). Free memory was 67.6MB in the beginning and 237.1MB in the end (delta: -169.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-10-11 13:08:04,146 INFO L158 Benchmark]: TraceAbstraction took 1619.02ms. Allocated memory is still 276.8MB. Free memory was 236.1MB in the beginning and 155.1MB in the end (delta: 81.0MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2024-10-11 13:08:04,147 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 276.8MB. Free memory was 155.1MB in the beginning and 154.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:08:04,148 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory was 110.8MB in the beginning and 110.6MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.08ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 72.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.86ms. Allocated memory is still 159.4MB. Free memory was 72.3MB in the beginning and 70.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.91ms. Allocated memory is still 159.4MB. Free memory was 70.2MB in the beginning and 67.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 418.96ms. Allocated memory was 159.4MB in the beginning and 276.8MB in the end (delta: 117.4MB). Free memory was 67.6MB in the beginning and 237.1MB in the end (delta: -169.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1619.02ms. Allocated memory is still 276.8MB. Free memory was 236.1MB in the beginning and 155.1MB in the end (delta: 81.0MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 276.8MB. Free memory was 155.1MB in the beginning and 154.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 1; [L26] signed char var_1_9 = 64; [L27] signed char var_1_10 = 4; [L28] signed char var_1_11 = -4; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = 32; [L31] signed char var_1_14 = -64; [L32] signed char var_1_15 = 50; [L33] signed char var_1_16 = 16; [L34] float var_1_17 = 63.5; [L35] signed char last_1_var_1_9 = 64; [L36] signed char last_1_var_1_14 = -64; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_9 = var_1_9 [L98] last_1_var_1_14 = var_1_14 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L68] var_1_4 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L69] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L70] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L70] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L71] var_1_5 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_6=1, var_1_9=64] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_6=1, var_1_9=64] [L73] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L73] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L74] var_1_6 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_9=64] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_9=64] [L76] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L76] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L77] var_1_10 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L78] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L79] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L79] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L80] var_1_11 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L81] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L82] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L82] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L84] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L85] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L85] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L87] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L89] var_1_15 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L91] CALL assume_abort_if_not(var_1_15 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L91] RET assume_abort_if_not(var_1_15 <= 64) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L92] var_1_16 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L94] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L94] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L109] RET updateVariables() [L110] CALL step() [L40] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=-255, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L41] COND TRUE ! (last_1_var_1_14 >= last_1_var_1_9) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=-255, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L42] COND TRUE (var_1_4 || var_1_5) && stepLocal_0 [L43] var_1_1 = ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L50] signed long int stepLocal_3 = (var_1_15 + var_1_16) - ((((64) > (var_1_13)) ? (64) : (var_1_13))); VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_3=0, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L51] COND TRUE var_1_12 < stepLocal_3 [L52] var_1_14 = ((64 - var_1_16) - var_1_13) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L56] var_1_17 = 128.91f [L57] unsigned char stepLocal_2 = var_1_14 == var_1_1; [L58] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_1=0, stepLocal_2=0, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=0, var_1_17=12891/100, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L59] COND FALSE !(stepLocal_1 && var_1_4) [L64] var_1_9 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_2=0, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=0, var_1_17=12891/100, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=-65] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return ((((! (last_1_var_1_14 >= last_1_var_1_9)) ? (((var_1_4 || var_1_5) && var_1_6) ? (var_1_1 == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : (var_1_1 == ((signed long int) last_1_var_1_14))) : (var_1_1 == ((signed long int) last_1_var_1_14))) && ((var_1_5 && var_1_4) ? ((var_1_6 || (var_1_14 == var_1_1)) ? (var_1_9 == ((signed char) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))))) : 1) : (var_1_9 == ((signed char) (var_1_12 - var_1_13))))) && ((var_1_12 < ((var_1_15 + var_1_16) - ((((64) > (var_1_13)) ? (64) : (var_1_13))))) ? (var_1_14 == ((signed char) ((64 - var_1_16) - var_1_13))) : (var_1_14 == ((signed char) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))))))) && (var_1_17 == ((float) 128.91f)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=0, var_1_17=12891/100, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=-65] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=0, var_1_17=12891/100, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=-65] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 125 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1224/1224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:08:04,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b52051d145fb2b47c7d32126bb345ca7aff8e39890cc67cf57ddb4a3e09751a2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:08:06,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:08:06,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:08:06,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:08:06,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:08:07,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:08:07,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:08:07,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:08:07,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:08:07,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:08:07,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:08:07,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:08:07,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:08:07,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:08:07,008 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:08:07,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:08:07,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:08:07,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:08:07,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:08:07,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:08:07,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:08:07,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:08:07,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:08:07,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:08:07,017 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:08:07,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:08:07,017 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:08:07,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:08:07,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:08:07,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:08:07,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:08:07,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:08:07,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:08:07,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:08:07,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:08:07,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:08:07,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:08:07,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:08:07,019 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:08:07,019 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:08:07,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:08:07,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:08:07,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:08:07,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:08:07,025 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:08:07,025 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b52051d145fb2b47c7d32126bb345ca7aff8e39890cc67cf57ddb4a3e09751a2 [2024-10-11 13:08:07,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:08:07,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:08:07,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:08:07,312 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:08:07,313 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:08:07,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i [2024-10-11 13:08:08,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:08:08,874 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:08:08,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i [2024-10-11 13:08:08,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b21a21b12/505136a21b8e48449d90da475929d244/FLAGfaa3d9892 [2024-10-11 13:08:08,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b21a21b12/505136a21b8e48449d90da475929d244 [2024-10-11 13:08:08,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:08:08,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:08:08,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:08:08,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:08:08,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:08:08,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:08:08" (1/1) ... [2024-10-11 13:08:08,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2228677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:08, skipping insertion in model container [2024-10-11 13:08:08,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:08:08" (1/1) ... [2024-10-11 13:08:08,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:08:09,056 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-57.i[913,926] [2024-10-11 13:08:09,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:08:09,126 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:08:09,136 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-57.i[913,926] [2024-10-11 13:08:09,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:08:09,196 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:08:09,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09 WrapperNode [2024-10-11 13:08:09,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:08:09,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:08:09,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:08:09,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:08:09,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (1/1) ... [2024-10-11 13:08:09,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (1/1) ... [2024-10-11 13:08:09,238 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-11 13:08:09,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:08:09,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:08:09,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:08:09,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:08:09,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (1/1) ... [2024-10-11 13:08:09,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (1/1) ... [2024-10-11 13:08:09,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (1/1) ... [2024-10-11 13:08:09,278 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 13:08:09,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (1/1) ... [2024-10-11 13:08:09,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (1/1) ... [2024-10-11 13:08:09,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (1/1) ... [2024-10-11 13:08:09,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (1/1) ... [2024-10-11 13:08:09,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (1/1) ... [2024-10-11 13:08:09,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (1/1) ... [2024-10-11 13:08:09,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:08:09,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:08:09,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:08:09,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:08:09,310 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (1/1) ... [2024-10-11 13:08:09,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:08:09,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:08:09,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:08:09,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:08:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:08:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:08:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:08:09,377 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:08:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:08:09,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:08:09,440 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:08:09,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:08:09,625 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 13:08:09,625 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:08:09,670 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:08:09,670 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:08:09,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:09 BoogieIcfgContainer [2024-10-11 13:08:09,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:08:09,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:08:09,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:08:09,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:08:09,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:08:08" (1/3) ... [2024-10-11 13:08:09,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2baa85c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:08:09, skipping insertion in model container [2024-10-11 13:08:09,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:09" (2/3) ... [2024-10-11 13:08:09,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2baa85c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:08:09, skipping insertion in model container [2024-10-11 13:08:09,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:09" (3/3) ... [2024-10-11 13:08:09,679 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-57.i [2024-10-11 13:08:09,708 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:08:09,708 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:08:09,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:08:09,771 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;@7eec36e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:08:09,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:08:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 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-11 13:08:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 13:08:09,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:09,792 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] [2024-10-11 13:08:09,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:09,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:09,799 INFO L85 PathProgramCache]: Analyzing trace with hash -669129977, now seen corresponding path program 1 times [2024-10-11 13:08:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:08:09,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078573640] [2024-10-11 13:08:09,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:09,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:08:09,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:08:09,820 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:08:09,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:08:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:09,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:08:09,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:08:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-10-11 13:08:09,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:08:09,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:08:09,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078573640] [2024-10-11 13:08:09,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078573640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:08:09,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:08:09,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:08:09,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349659979] [2024-10-11 13:08:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:08:09,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:08:09,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:08:10,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:08:10,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:08:10,016 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-11 13:08:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:08:10,060 INFO L93 Difference]: Finished difference Result 91 states and 160 transitions. [2024-10-11 13:08:10,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:08:10,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 109 [2024-10-11 13:08:10,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:08:10,073 INFO L225 Difference]: With dead ends: 91 [2024-10-11 13:08:10,074 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 13:08:10,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:08:10,083 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:08:10,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:08:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 13:08:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 13:08:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-11 13:08:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2024-10-11 13:08:10,130 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 109 [2024-10-11 13:08:10,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:08:10,130 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-11 13:08:10,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-11 13:08:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2024-10-11 13:08:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 13:08:10,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:10,136 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] [2024-10-11 13:08:10,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:08:10,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:08:10,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:10,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:10,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1043084857, now seen corresponding path program 1 times [2024-10-11 13:08:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:08:10,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057421060] [2024-10-11 13:08:10,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:10,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:08:10,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:08:10,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:08:10,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:08:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:10,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:08:10,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:08:11,166 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-11 13:08:11,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:08:11,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:08:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057421060] [2024-10-11 13:08:11,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057421060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:08:11,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:08:11,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:08:11,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817829713] [2024-10-11 13:08:11,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:08:11,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:08:11,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:08:11,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:08:11,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:08:11,173 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-11 13:08:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:08:11,341 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2024-10-11 13:08:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:08:11,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 109 [2024-10-11 13:08:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:08:11,344 INFO L225 Difference]: With dead ends: 134 [2024-10-11 13:08:11,344 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 13:08:11,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 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-11 13:08:11,348 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 33 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:08:11,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 180 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:08:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 13:08:11,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-10-11 13:08:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 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-11 13:08:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 117 transitions. [2024-10-11 13:08:11,378 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 117 transitions. Word has length 109 [2024-10-11 13:08:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:08:11,379 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 117 transitions. [2024-10-11 13:08:11,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-11 13:08:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 117 transitions. [2024-10-11 13:08:11,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:08:11,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:11,381 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] [2024-10-11 13:08:11,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:08:11,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:08:11,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:11,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:11,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1494859976, now seen corresponding path program 1 times [2024-10-11 13:08:11,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:08:11,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688270398] [2024-10-11 13:08:11,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:11,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:08:11,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:08:11,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:08:11,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:08:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:11,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 13:08:11,695 INFO L278 TraceCheckSpWp]: Computing forward predicates...