./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.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 9f263d2bb0fd887b3497edbb0b9adbf8ce75a026e9853764f1c2fe7520ee07e1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:20:54,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:20:54,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:20:54,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:20:54,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:20:54,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:20:54,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:20:54,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:20:54,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:20:54,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:20:54,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:20:54,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:20:54,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:20:54,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:20:54,241 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:20:54,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:20:54,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:20:54,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:20:54,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:20:54,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:20:54,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:20:54,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:20:54,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:20:54,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:20:54,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:20:54,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:20:54,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:20:54,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:20:54,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:20:54,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:20:54,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:20:54,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:20:54,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:20:54,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:20:54,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:20:54,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:20:54,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:20:54,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:20:54,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:20:54,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:20:54,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:20:54,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:20:54,253 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 -> 9f263d2bb0fd887b3497edbb0b9adbf8ce75a026e9853764f1c2fe7520ee07e1 [2024-11-09 01:20:54,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:20:54,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:20:54,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:20:54,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:20:54,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:20:54,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.i [2024-11-09 01:20:56,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:20:56,200 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:20:56,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.i [2024-11-09 01:20:56,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/950094eb9/39497f035f514d498f50ef5b6ca7a52e/FLAG567235b86 [2024-11-09 01:20:56,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/950094eb9/39497f035f514d498f50ef5b6ca7a52e [2024-11-09 01:20:56,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:20:56,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:20:56,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:20:56,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:20:56,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:20:56,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:56,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534ab605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56, skipping insertion in model container [2024-11-09 01:20:56,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:56,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:20:56,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.i[913,926] [2024-11-09 01:20:56,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:20:56,812 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:20:56,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.i[913,926] [2024-11-09 01:20:56,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:20:56,869 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:20:56,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56 WrapperNode [2024-11-09 01:20:56,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:20:56,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:20:56,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:20:56,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:20:56,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:56,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:56,958 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-11-09 01:20:56,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:20:56,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:20:56,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:20:56,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:20:56,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:56,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:56,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:56,992 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 01:20:56,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:56,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:56,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:57,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:57,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:57,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:57,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:20:57,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:20:57,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:20:57,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:20:57,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (1/1) ... [2024-11-09 01:20:57,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:20:57,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:20:57,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:20:57,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:20:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:20:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:20:57,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:20:57,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:20:57,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:20:57,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:20:57,176 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:20:57,179 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:20:57,452 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 01:20:57,452 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:20:57,468 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:20:57,468 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:20:57,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:20:57 BoogieIcfgContainer [2024-11-09 01:20:57,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:20:57,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:20:57,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:20:57,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:20:57,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:20:56" (1/3) ... [2024-11-09 01:20:57,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c94c5ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:20:57, skipping insertion in model container [2024-11-09 01:20:57,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:20:56" (2/3) ... [2024-11-09 01:20:57,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c94c5ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:20:57, skipping insertion in model container [2024-11-09 01:20:57,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:20:57" (3/3) ... [2024-11-09 01:20:57,478 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-47.i [2024-11-09 01:20:57,494 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:20:57,494 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:20:57,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:20:57,568 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;@6c53d492, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:20:57,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:20:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 01:20:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 01:20:57,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:57,581 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:57,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:20:57,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash 807039418, now seen corresponding path program 1 times [2024-11-09 01:20:57,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:20:57,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162939501] [2024-11-09 01:20:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:57,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:20:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:57,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:20:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:57,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:20:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:57,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:20:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:57,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 01:20:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:57,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:20:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:57,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:20:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:57,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:20:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:57,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:20:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:57,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:20:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:20:57,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:20:57,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162939501] [2024-11-09 01:20:57,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162939501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:20:57,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:20:57,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:20:57,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584610409] [2024-11-09 01:20:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:20:57,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:20:57,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:20:57,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:20:57,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:20:57,938 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:20:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:57,965 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2024-11-09 01:20:57,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:20:57,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2024-11-09 01:20:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:57,977 INFO L225 Difference]: With dead ends: 77 [2024-11-09 01:20:57,977 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 01:20:57,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:20:57,986 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:57,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:20:58,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 01:20:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 01:20:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 01:20:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-09 01:20:58,030 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 65 [2024-11-09 01:20:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:58,030 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-09 01:20:58,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:20:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-09 01:20:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 01:20:58,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:58,034 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:58,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:20:58,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:20:58,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:58,035 INFO L85 PathProgramCache]: Analyzing trace with hash -81580040, now seen corresponding path program 1 times [2024-11-09 01:20:58,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:20:58,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101232913] [2024-11-09 01:20:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:20:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:20:58,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:20:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:20:58,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:20:58,268 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:20:58,269 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:20:58,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:20:58,275 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 01:20:58,350 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:20:58,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:20:58 BoogieIcfgContainer [2024-11-09 01:20:58,355 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:20:58,356 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:20:58,356 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:20:58,357 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:20:58,357 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:20:57" (3/4) ... [2024-11-09 01:20:58,360 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:20:58,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:20:58,362 INFO L158 Benchmark]: Toolchain (without parser) took 1774.65ms. Allocated memory is still 197.1MB. Free memory was 126.9MB in the beginning and 104.3MB in the end (delta: 22.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-09 01:20:58,363 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 197.1MB. Free memory is still 157.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:20:58,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.07ms. Allocated memory is still 197.1MB. Free memory was 126.7MB in the beginning and 112.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 01:20:58,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.48ms. Allocated memory is still 197.1MB. Free memory was 112.9MB in the beginning and 167.2MB in the end (delta: -54.3MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-11-09 01:20:58,365 INFO L158 Benchmark]: Boogie Preprocessor took 45.69ms. Allocated memory is still 197.1MB. Free memory was 167.2MB in the beginning and 165.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:20:58,366 INFO L158 Benchmark]: RCFGBuilder took 463.55ms. Allocated memory is still 197.1MB. Free memory was 165.1MB in the beginning and 150.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:20:58,366 INFO L158 Benchmark]: TraceAbstraction took 884.07ms. Allocated memory is still 197.1MB. Free memory was 149.4MB in the beginning and 105.3MB in the end (delta: 44.2MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-09 01:20:58,367 INFO L158 Benchmark]: Witness Printer took 5.84ms. Allocated memory is still 197.1MB. Free memory was 105.3MB in the beginning and 104.3MB in the end (delta: 989.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:20:58,372 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.19ms. Allocated memory is still 197.1MB. Free memory is still 157.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.07ms. Allocated memory is still 197.1MB. Free memory was 126.7MB in the beginning and 112.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.48ms. Allocated memory is still 197.1MB. Free memory was 112.9MB in the beginning and 167.2MB in the end (delta: -54.3MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.69ms. Allocated memory is still 197.1MB. Free memory was 167.2MB in the beginning and 165.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 463.55ms. Allocated memory is still 197.1MB. Free memory was 165.1MB in the beginning and 150.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 884.07ms. Allocated memory is still 197.1MB. Free memory was 149.4MB in the beginning and 105.3MB in the end (delta: 44.2MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 5.84ms. Allocated memory is still 197.1MB. Free memory was 105.3MB in the beginning and 104.3MB in the end (delta: 989.1kB). Peak memory consumption was 2.1MB. 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 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L23] double var_1_8 = 3.5; [L24] signed char var_1_9 = 16; [L25] signed char var_1_10 = 16; [L26] signed char var_1_11 = 4; [L27] signed long int var_1_12 = 8; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 1; [L30] double var_1_15 = 3.8; [L31] signed long int last_1_var_1_12 = 8; VAL [isInitial=0, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_8=7/2, var_1_9=16] [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L78] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_8=7/2, var_1_9=16] [L88] RET updateLastVariables() [L89] CALL updateVariables() [L62] var_1_8 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L63] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L64] var_1_10 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L65] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L66] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L66] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L67] var_1_11 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L68] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L69] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L69] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L70] var_1_13 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L71] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L72] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L72] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L73] var_1_14 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L74] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L75] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L75] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L89] RET updateVariables() [L90] CALL step() [L35] COND FALSE !(-4 > last_1_var_1_12) [L40] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=7] [L42] unsigned char stepLocal_0 = ! var_1_13; VAL [isInitial=1, last_1_var_1_12=8, stepLocal_0=0, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=7] [L43] COND FALSE !(stepLocal_0 || var_1_14) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=7] [L50] var_1_15 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=983/40, var_1_8=53, var_1_9=7] [L51] COND FALSE !(var_1_15 <= var_1_15) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=983/40, var_1_8=53, var_1_9=7] [L56] COND TRUE var_1_12 > var_1_9 [L57] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=53, var_1_8=53, var_1_9=7] [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return ((((var_1_15 <= var_1_15) ? (((var_1_12 + var_1_12) >= (var_1_12 + var_1_9)) ? (var_1_1 == ((double) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1) : ((var_1_12 > var_1_9) ? (var_1_1 == ((double) var_1_8)) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? (var_1_9 == ((signed char) ((((var_1_10 + var_1_11) < 0 ) ? -(var_1_10 + var_1_11) : (var_1_10 + var_1_11))))) : 1) : (var_1_9 == ((signed char) var_1_10)))) && (((! var_1_13) || var_1_14) ? ((! var_1_14) ? (var_1_12 == ((signed long int) (((((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))) < 0 ) ? -((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))) : ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))))) : (var_1_12 == ((signed long int) var_1_9))) : 1)) && (var_1_15 == ((double) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=53, var_1_8=53, var_1_9=7] [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=53, var_1_8=53, var_1_9=7] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=53, var_1_8=53, var_1_9=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 9, 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, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 29 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, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 144/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:20:58,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.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 9f263d2bb0fd887b3497edbb0b9adbf8ce75a026e9853764f1c2fe7520ee07e1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:21:00,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:21:00,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:21:00,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:21:00,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:21:00,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:21:00,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:21:00,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:21:00,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:21:00,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:21:00,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:21:00,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:21:00,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:21:00,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:21:00,747 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:21:00,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:21:00,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:21:00,748 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:21:00,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:21:00,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:21:00,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:21:00,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:21:00,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:21:00,750 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:21:00,750 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:21:00,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:21:00,751 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:21:00,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:21:00,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:21:00,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:21:00,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:21:00,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:21:00,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:21:00,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:21:00,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:21:00,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:21:00,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:21:00,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:21:00,754 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:21:00,755 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:21:00,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:21:00,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:21:00,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:21:00,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:21:00,756 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 -> 9f263d2bb0fd887b3497edbb0b9adbf8ce75a026e9853764f1c2fe7520ee07e1 [2024-11-09 01:21:01,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:21:01,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:21:01,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:21:01,120 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:21:01,120 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:21:01,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.i [2024-11-09 01:21:02,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:21:02,923 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:21:02,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.i [2024-11-09 01:21:02,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/005873e88/3e87abbc54b04c0baf2b9101af50acbd/FLAG0fe6aa0d5 [2024-11-09 01:21:03,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/005873e88/3e87abbc54b04c0baf2b9101af50acbd [2024-11-09 01:21:03,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:21:03,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:21:03,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:21:03,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:21:03,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:21:03,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377cd4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03, skipping insertion in model container [2024-11-09 01:21:03,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:21:03,524 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.i[913,926] [2024-11-09 01:21:03,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:21:03,593 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:21:03,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.i[913,926] [2024-11-09 01:21:03,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:21:03,655 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:21:03,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03 WrapperNode [2024-11-09 01:21:03,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:21:03,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:21:03,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:21:03,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:21:03,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,710 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-09 01:21:03,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:21:03,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:21:03,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:21:03,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:21:03,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,746 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 01:21:03,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,758 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:21:03,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:21:03,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:21:03,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:21:03,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (1/1) ... [2024-11-09 01:21:03,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:21:03,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:21:03,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:21:03,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:21:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:21:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:21:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:21:03,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:21:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:21:03,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:21:03,947 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:21:03,951 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:21:04,182 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 01:21:04,183 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:21:04,196 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:21:04,197 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:21:04,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:21:04 BoogieIcfgContainer [2024-11-09 01:21:04,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:21:04,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:21:04,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:21:04,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:21:04,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:21:03" (1/3) ... [2024-11-09 01:21:04,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ce4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:21:04, skipping insertion in model container [2024-11-09 01:21:04,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:03" (2/3) ... [2024-11-09 01:21:04,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ce4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:21:04, skipping insertion in model container [2024-11-09 01:21:04,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:21:04" (3/3) ... [2024-11-09 01:21:04,208 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-47.i [2024-11-09 01:21:04,224 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:21:04,225 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:21:04,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:21:04,285 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;@16ca7c38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:21:04,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:21:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 01:21:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 01:21:04,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:04,297 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:04,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:21:04,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:04,302 INFO L85 PathProgramCache]: Analyzing trace with hash 807039418, now seen corresponding path program 1 times [2024-11-09 01:21:04,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:21:04,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22166673] [2024-11-09 01:21:04,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:04,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:21:04,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:21:04,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:21:04,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:21:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:04,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:21:04,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:21:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 01:21:04,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:21:04,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:21:04,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22166673] [2024-11-09 01:21:04,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22166673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:21:04,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:21:04,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:21:04,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934871] [2024-11-09 01:21:04,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:21:04,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:21:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:21:04,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:21:04,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:21:04,562 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:21:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:04,580 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2024-11-09 01:21:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:21:04,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2024-11-09 01:21:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:04,588 INFO L225 Difference]: With dead ends: 77 [2024-11-09 01:21:04,589 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 01:21:04,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:21:04,595 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:04,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:21:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 01:21:04,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 01:21:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 01:21:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-09 01:21:04,627 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 65 [2024-11-09 01:21:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:04,627 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-09 01:21:04,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:21:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-09 01:21:04,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 01:21:04,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:04,631 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:04,638 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-09 01:21:04,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:21:04,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:21:04,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash -81580040, now seen corresponding path program 1 times [2024-11-09 01:21:04,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:21:04,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606183317] [2024-11-09 01:21:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:04,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:21:04,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:21:04,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:21:04,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:21:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:04,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:21:04,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:21:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 01:21:06,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:21:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 01:21:06,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:21:06,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606183317] [2024-11-09 01:21:06,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606183317] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:21:06,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:21:06,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-09 01:21:06,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354338535] [2024-11-09 01:21:06,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:21:06,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:21:06,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:21:06,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:21:06,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:21:06,471 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-09 01:21:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:07,110 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2024-11-09 01:21:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:21:07,113 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 65 [2024-11-09 01:21:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:07,115 INFO L225 Difference]: With dead ends: 78 [2024-11-09 01:21:07,115 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 01:21:07,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:21:07,119 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 74 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:07,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 92 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:21:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 01:21:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-09 01:21:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 01:21:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2024-11-09 01:21:07,133 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 65 [2024-11-09 01:21:07,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:07,134 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-11-09 01:21:07,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-09 01:21:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2024-11-09 01:21:07,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 01:21:07,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:07,137 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:07,144 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-09 01:21:07,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:21:07,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:21:07,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash -316154374, now seen corresponding path program 1 times [2024-11-09 01:21:07,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:21:07,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019682006] [2024-11-09 01:21:07,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:07,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:21:07,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:21:07,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:21:07,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:21:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:07,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:21:07,433 INFO L278 TraceCheckSpWp]: Computing forward predicates...