./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-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64487a3fc6d0bb9c63963975f2a88f7204d26acaec706a494cf6a9d1aeef08e8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:46:43,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:46:43,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:46:43,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:46:43,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:46:43,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:46:43,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:46:43,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:46:43,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:46:43,603 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:46:43,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:46:43,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:46:43,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:46:43,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:46:43,605 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:46:43,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:46:43,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:46:43,607 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:46:43,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:46:43,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:46:43,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:46:43,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:46:43,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:46:43,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:46:43,609 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:46:43,609 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:46:43,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:46:43,610 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:46:43,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:46:43,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:46:43,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:46:43,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:46:43,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:46:43,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:46:43,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:46:43,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:46:43,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:46:43,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:46:43,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:46:43,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:46:43,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:46:43,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:46:43,614 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64487a3fc6d0bb9c63963975f2a88f7204d26acaec706a494cf6a9d1aeef08e8 [2024-10-13 05:46:43,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:46:43,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:46:43,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:46:43,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:46:43,945 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:46:43,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i [2024-10-13 05:46:45,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:46:45,528 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:46:45,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i [2024-10-13 05:46:45,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c701ab506/f6e5262d754d448e85a313b939184640/FLAGb65a8bbe1 [2024-10-13 05:46:45,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c701ab506/f6e5262d754d448e85a313b939184640 [2024-10-13 05:46:45,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:46:45,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:46:45,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:46:45,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:46:45,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:46:45,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2097e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45, skipping insertion in model container [2024-10-13 05:46:45,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:46:45,747 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-41.i[913,926] [2024-10-13 05:46:45,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:46:45,801 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:46:45,813 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-41.i[913,926] [2024-10-13 05:46:45,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:46:45,848 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:46:45,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45 WrapperNode [2024-10-13 05:46:45,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:46:45,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:46:45,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:46:45,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:46:45,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,897 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-10-13 05:46:45,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:46:45,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:46:45,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:46:45,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:46:45,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,936 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:46:45,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:46:45,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:46:45,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:46:45,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:46:45,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (1/1) ... [2024-10-13 05:46:45,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:46:45,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:46:46,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:46:46,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:46:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:46:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:46:46,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:46:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:46:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:46:46,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:46:46,147 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:46:46,150 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:46:46,453 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 05:46:46,454 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:46:46,527 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:46:46,528 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:46:46,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:46 BoogieIcfgContainer [2024-10-13 05:46:46,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:46:46,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:46:46,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:46:46,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:46:46,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:46:45" (1/3) ... [2024-10-13 05:46:46,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684d056b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:46:46, skipping insertion in model container [2024-10-13 05:46:46,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:45" (2/3) ... [2024-10-13 05:46:46,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684d056b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:46:46, skipping insertion in model container [2024-10-13 05:46:46,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:46" (3/3) ... [2024-10-13 05:46:46,538 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-41.i [2024-10-13 05:46:46,557 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:46:46,558 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:46:46,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:46:46,630 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;@4a18e6ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:46:46,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:46:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:46:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:46:46,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:46,647 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:46:46,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:46,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2115196599, now seen corresponding path program 1 times [2024-10-13 05:46:46,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:46,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969623234] [2024-10-13 05:46:46,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:46,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:46,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:46,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:46,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:46,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:46,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:46:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:46,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:46:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:46,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:46:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:46,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:46:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:46,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 05:46:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:46,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:46:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:46:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:46:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:46:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:46:47,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:47,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969623234] [2024-10-13 05:46:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969623234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:47,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:47,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:46:47,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614446061] [2024-10-13 05:46:47,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:47,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:46:47,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:47,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:46:47,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:46:47,055 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:46:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:47,099 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2024-10-13 05:46:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:46:47,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-13 05:46:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:47,113 INFO L225 Difference]: With dead ends: 81 [2024-10-13 05:46:47,113 INFO L226 Difference]: Without dead ends: 40 [2024-10-13 05:46:47,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:46:47,123 INFO L432 NwaCegarLoop]: 56 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, 56 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:47,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:46:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-13 05:46:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-13 05:46:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:46:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-10-13 05:46:47,174 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 88 [2024-10-13 05:46:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:47,175 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-10-13 05:46:47,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:46:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2024-10-13 05:46:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:46:47,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:47,181 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:46:47,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:46:47,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:47,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash 709494963, now seen corresponding path program 1 times [2024-10-13 05:46:47,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:47,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693785873] [2024-10-13 05:46:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:46:47,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:46:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:46:47,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:46:47,436 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:46:47,438 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:46:47,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:46:47,443 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 05:46:47,518 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:46:47,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:46:47 BoogieIcfgContainer [2024-10-13 05:46:47,521 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:46:47,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:46:47,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:46:47,523 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:46:47,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:46" (3/4) ... [2024-10-13 05:46:47,526 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:46:47,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:46:47,528 INFO L158 Benchmark]: Toolchain (without parser) took 1963.78ms. Allocated memory is still 165.7MB. Free memory was 134.4MB in the beginning and 70.4MB in the end (delta: 64.0MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2024-10-13 05:46:47,528 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 104.9MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:46:47,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.85ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 120.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 05:46:47,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.20ms. Allocated memory is still 165.7MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:46:47,530 INFO L158 Benchmark]: Boogie Preprocessor took 50.59ms. Allocated memory is still 165.7MB. Free memory was 117.9MB in the beginning and 114.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:46:47,530 INFO L158 Benchmark]: RCFGBuilder took 578.48ms. Allocated memory is still 165.7MB. Free memory was 114.8MB in the beginning and 126.0MB in the end (delta: -11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 05:46:47,531 INFO L158 Benchmark]: TraceAbstraction took 991.08ms. Allocated memory is still 165.7MB. Free memory was 124.9MB in the beginning and 71.4MB in the end (delta: 53.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-10-13 05:46:47,531 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 165.7MB. Free memory was 71.4MB in the beginning and 70.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:46:47,533 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.08ms. Allocated memory is still 104.9MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.85ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 120.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.20ms. Allocated memory is still 165.7MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.59ms. Allocated memory is still 165.7MB. Free memory was 117.9MB in the beginning and 114.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 578.48ms. Allocated memory is still 165.7MB. Free memory was 114.8MB in the beginning and 126.0MB in the end (delta: -11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 991.08ms. Allocated memory is still 165.7MB. Free memory was 124.9MB in the beginning and 71.4MB in the end (delta: 53.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 165.7MB. Free memory was 71.4MB in the beginning and 70.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryArithmeticDOUBLEoperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] unsigned char var_1_5 = 0; [L24] signed char var_1_6 = -8; [L25] signed char var_1_7 = 5; [L26] unsigned short int var_1_8 = 2; [L27] unsigned char var_1_11 = 0; [L28] double var_1_12 = 8.5; [L29] double var_1_13 = 999999999999.6; [L30] signed long int var_1_14 = 10; [L31] signed char var_1_15 = -1; [L32] unsigned char var_1_16 = 16; [L33] unsigned char var_1_17 = 64; [L34] signed char last_1_var_1_1 = -16; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] last_1_var_1_1 = var_1_1 [L102] RET updateLastVariables() [L103] CALL updateVariables() [L69] var_1_5 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L71] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L71] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L72] var_1_6 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_6 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=5, var_1_8=2] [L73] RET assume_abort_if_not(var_1_6 >= -31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=5, var_1_8=2] [L74] CALL assume_abort_if_not(var_1_6 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=5, var_1_8=2] [L74] RET assume_abort_if_not(var_1_6 <= 31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=5, var_1_8=2] [L75] var_1_7 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_7 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L76] RET assume_abort_if_not(var_1_7 >= -63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L77] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L77] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L79] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L80] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L80] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L81] var_1_13 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L82] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L83] var_1_15 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L84] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L85] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L85] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L86] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L86] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L87] var_1_17 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L88] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L89] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=2, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=2, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L89] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=2, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L103] RET updateVariables() [L104] CALL step() [L38] COND TRUE var_1_5 && (last_1_var_1_1 <= last_1_var_1_1) [L39] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=2, var_1_17=2, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L41] var_1_12 = (var_1_13 - 8.3) [L42] unsigned char stepLocal_1 = var_1_13 >= var_1_12; VAL [isInitial=1, last_1_var_1_1=-16, stepLocal_1=0, var_1_11=1, var_1_14=10, var_1_15=1, var_1_16=2, var_1_17=2, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L43] COND FALSE !(var_1_5 && stepLocal_1) [L46] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=2, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L48] COND TRUE \read(var_1_5) [L49] var_1_8 = (var_1_16 + var_1_16) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=2, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=4] [L57] unsigned long int stepLocal_0 = (var_1_8 & 0u) * var_1_16; VAL [isInitial=1, last_1_var_1_1=-16, stepLocal_0=0, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=2, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=4] [L58] COND FALSE !(stepLocal_0 > var_1_8) [L65] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=2, var_1_1=31, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=4] [L104] RET step() [L105] CALL, EXPR property() [L95-L96] return (((((((var_1_8 & 0u) * var_1_16) > var_1_8) ? (var_1_5 ? (var_1_1 == ((signed char) ((16 + var_1_6) + var_1_7))) : (var_1_1 == ((signed char) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))) : (var_1_1 == ((signed char) var_1_6))) && (var_1_5 ? (var_1_8 == ((unsigned short int) (var_1_16 + var_1_16))) : (((var_1_16 > var_1_14) || var_1_11) ? (var_1_8 == ((unsigned short int) var_1_16)) : (var_1_8 == ((unsigned short int) var_1_16))))) && (var_1_12 == ((double) (var_1_13 - 8.3)))) && ((var_1_5 && (var_1_13 >= var_1_12)) ? (var_1_14 == ((signed long int) var_1_16)) : (var_1_14 == ((signed long int) var_1_15)))) && ((var_1_5 && (last_1_var_1_1 <= last_1_var_1_1)) ? (var_1_16 == ((unsigned char) var_1_17)) : 1) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=2, var_1_1=31, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=2, var_1_1=31, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 56 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 05:46:47,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64487a3fc6d0bb9c63963975f2a88f7204d26acaec706a494cf6a9d1aeef08e8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:46:49,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:46:49,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:46:49,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:46:49,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:46:49,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:46:49,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:46:49,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:46:49,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:46:49,858 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:46:49,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:46:49,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:46:49,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:46:49,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:46:49,861 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:46:49,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:46:49,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:46:49,863 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:46:49,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:46:49,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:46:49,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:46:49,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:46:49,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:46:49,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:46:49,868 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:46:49,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:46:49,869 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:46:49,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:46:49,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:46:49,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:46:49,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:46:49,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:46:49,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:46:49,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:46:49,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:46:49,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:46:49,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:46:49,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:46:49,872 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:46:49,873 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:46:49,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:46:49,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:46:49,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:46:49,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:46:49,874 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:46:49,874 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64487a3fc6d0bb9c63963975f2a88f7204d26acaec706a494cf6a9d1aeef08e8 [2024-10-13 05:46:50,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:46:50,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:46:50,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:46:50,235 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:46:50,235 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:46:50,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i [2024-10-13 05:46:51,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:46:51,866 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:46:51,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i [2024-10-13 05:46:51,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f48f911/cd2c01b8d3224d79ae4d9cdceec73aff/FLAG4ae84969e [2024-10-13 05:46:52,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f48f911/cd2c01b8d3224d79ae4d9cdceec73aff [2024-10-13 05:46:52,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:46:52,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:46:52,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:46:52,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:46:52,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:46:52,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40038342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52, skipping insertion in model container [2024-10-13 05:46:52,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:46:52,457 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-41.i[913,926] [2024-10-13 05:46:52,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:46:52,533 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:46:52,547 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-41.i[913,926] [2024-10-13 05:46:52,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:46:52,596 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:46:52,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52 WrapperNode [2024-10-13 05:46:52,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:46:52,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:46:52,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:46:52,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:46:52,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,652 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-10-13 05:46:52,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:46:52,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:46:52,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:46:52,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:46:52,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,692 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:46:52,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:46:52,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:46:52,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:46:52,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:46:52,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (1/1) ... [2024-10-13 05:46:52,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:46:52,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:46:52,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:46:52,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:46:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:46:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:46:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:46:52,805 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:46:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:46:52,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:46:52,875 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:46:52,878 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:46:53,505 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 05:46:53,506 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:46:53,552 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:46:53,553 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:46:53,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:53 BoogieIcfgContainer [2024-10-13 05:46:53,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:46:53,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:46:53,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:46:53,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:46:53,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:46:52" (1/3) ... [2024-10-13 05:46:53,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d67261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:46:53, skipping insertion in model container [2024-10-13 05:46:53,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:52" (2/3) ... [2024-10-13 05:46:53,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d67261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:46:53, skipping insertion in model container [2024-10-13 05:46:53,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:53" (3/3) ... [2024-10-13 05:46:53,569 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-41.i [2024-10-13 05:46:53,587 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:46:53,587 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:46:53,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:46:53,676 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;@5c5820a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:46:53,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:46:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:46:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:46:53,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:53,694 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:46:53,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:53,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2115196599, now seen corresponding path program 1 times [2024-10-13 05:46:53,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:46:53,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532505725] [2024-10-13 05:46:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:53,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:46:53,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:46:53,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:46:53,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 05:46:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:53,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:46:53,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:46:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-13 05:46:54,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:46:54,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:46:54,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532505725] [2024-10-13 05:46:54,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532505725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:54,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:54,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:46:54,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718648400] [2024-10-13 05:46:54,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:54,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:46:54,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:46:54,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:46:54,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:46:54,049 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:46:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:54,161 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2024-10-13 05:46:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:46:54,170 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-13 05:46:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:54,178 INFO L225 Difference]: With dead ends: 81 [2024-10-13 05:46:54,178 INFO L226 Difference]: Without dead ends: 40 [2024-10-13 05:46:54,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:46:54,184 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:54,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:46:54,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-13 05:46:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-13 05:46:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:46:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-10-13 05:46:54,231 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 88 [2024-10-13 05:46:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:54,232 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-10-13 05:46:54,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:46:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2024-10-13 05:46:54,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:46:54,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:54,235 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:46:54,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 05:46:54,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:46:54,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:54,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:54,438 INFO L85 PathProgramCache]: Analyzing trace with hash 709494963, now seen corresponding path program 1 times [2024-10-13 05:46:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:46:54,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633233345] [2024-10-13 05:46:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:54,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:46:54,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:46:54,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:46:54,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 05:46:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:54,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 05:46:54,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:47:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 189 proven. 15 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-10-13 05:47:00,235 INFO L311 TraceCheckSpWp]: Computing backward predicates...