./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.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 53ac7479a950235157217cca437cf6f6e0f377d0e27ff61b959bf8258dd5b0ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:22:05,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:22:05,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:22:05,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:22:05,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:22:05,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:22:05,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:22:05,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:22:05,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:22:05,598 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:22:05,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:22:05,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:22:05,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:22:05,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:22:05,601 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:22:05,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:22:05,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:22:05,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:22:05,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:22:05,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:22:05,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:22:05,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:22:05,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:22:05,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:22:05,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:22:05,608 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:22:05,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:22:05,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:22:05,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:22:05,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:22:05,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:22:05,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:22:05,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:22:05,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:22:05,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:22:05,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:22:05,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:22:05,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:22:05,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:22:05,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:22:05,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:22:05,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:22:05,613 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 -> 53ac7479a950235157217cca437cf6f6e0f377d0e27ff61b959bf8258dd5b0ad [2024-11-19 00:22:05,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:22:05,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:22:05,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:22:05,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:22:05,935 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:22:05,936 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-21.i [2024-11-19 00:22:07,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:22:07,539 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:22:07,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i [2024-11-19 00:22:07,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a8b82b8/8026f4e9a5f64b03ad895fc6e3f903c7/FLAGb3fcd48d9 [2024-11-19 00:22:07,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a8b82b8/8026f4e9a5f64b03ad895fc6e3f903c7 [2024-11-19 00:22:07,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:22:07,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:22:07,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:22:07,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:22:07,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:22:07,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:07,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f1de250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07, skipping insertion in model container [2024-11-19 00:22:07,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:07,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:22:07,782 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-21.i[913,926] [2024-11-19 00:22:07,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:22:07,838 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:22:07,873 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-21.i[913,926] [2024-11-19 00:22:07,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:22:07,936 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:22:07,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07 WrapperNode [2024-11-19 00:22:07,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:22:07,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:22:07,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:22:07,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:22:07,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:07,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:07,997 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-19 00:22:07,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:22:07,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:22:07,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:22:07,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:22:08,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:08,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:08,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:08,028 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-19 00:22:08,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:08,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:08,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:08,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:08,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:08,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:08,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:22:08,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:22:08,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:22:08,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:22:08,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (1/1) ... [2024-11-19 00:22:08,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:22:08,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:22:08,100 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-19 00:22:08,102 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-19 00:22:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:22:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:22:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:22:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:22:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:22:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:22:08,228 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:22:08,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:22:08,450 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-19 00:22:08,450 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:22:08,464 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:22:08,465 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:22:08,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:08 BoogieIcfgContainer [2024-11-19 00:22:08,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:22:08,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:22:08,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:22:08,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:22:08,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:22:07" (1/3) ... [2024-11-19 00:22:08,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6936e4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:22:08, skipping insertion in model container [2024-11-19 00:22:08,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:07" (2/3) ... [2024-11-19 00:22:08,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6936e4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:22:08, skipping insertion in model container [2024-11-19 00:22:08,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:08" (3/3) ... [2024-11-19 00:22:08,474 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-21.i [2024-11-19 00:22:08,488 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:22:08,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:22:08,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:22:08,550 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;@1845ac11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:22:08,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:22:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 00:22:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 00:22:08,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:08,562 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:22:08,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:08,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash -510096507, now seen corresponding path program 1 times [2024-11-19 00:22:08,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:22:08,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252914290] [2024-11-19 00:22:08,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:08,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:22:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 00:22:08,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:22:08,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252914290] [2024-11-19 00:22:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252914290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:22:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125882699] [2024-11-19 00:22:08,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:08,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:22:08,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:22:08,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:22:08,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:22:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:08,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:22:08,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 00:22:08,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:22:08,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125882699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:08,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:22:08,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:22:08,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533599997] [2024-11-19 00:22:08,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:08,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:22:08,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:22:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:22:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:22:08,964 INFO L87 Difference]: Start difference. First operand has 39 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 00:22:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:08,980 INFO L93 Difference]: Finished difference Result 71 states and 111 transitions. [2024-11-19 00:22:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:22:08,982 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-11-19 00:22:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:08,987 INFO L225 Difference]: With dead ends: 71 [2024-11-19 00:22:08,987 INFO L226 Difference]: Without dead ends: 35 [2024-11-19 00:22:08,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 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-19 00:22:08,992 INFO L432 NwaCegarLoop]: 48 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, 48 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-19 00:22:08,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:22:09,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-19 00:22:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-19 00:22:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 00:22:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-19 00:22:09,024 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 53 [2024-11-19 00:22:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:09,025 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-19 00:22:09,025 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 00:22:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-19 00:22:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 00:22:09,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:09,027 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:22:09,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:22:09,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:22:09,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:09,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:09,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1104841853, now seen corresponding path program 1 times [2024-11-19 00:22:09,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:22:09,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682427983] [2024-11-19 00:22:09,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:09,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:22:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-19 00:22:11,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:22:11,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682427983] [2024-11-19 00:22:11,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682427983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:11,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:22:11,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:22:11,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236300613] [2024-11-19 00:22:11,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:11,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:22:11,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:22:11,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:22:11,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:22:11,017 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-19 00:22:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:11,403 INFO L93 Difference]: Finished difference Result 122 states and 166 transitions. [2024-11-19 00:22:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:22:11,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2024-11-19 00:22:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:11,406 INFO L225 Difference]: With dead ends: 122 [2024-11-19 00:22:11,407 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 00:22:11,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:22:11,409 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 60 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:22:11,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 297 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:22:11,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 00:22:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2024-11-19 00:22:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 00:22:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2024-11-19 00:22:11,431 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 53 [2024-11-19 00:22:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:11,431 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2024-11-19 00:22:11,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-19 00:22:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2024-11-19 00:22:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 00:22:11,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:11,433 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:22:11,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:22:11,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:11,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1443072449, now seen corresponding path program 1 times [2024-11-19 00:22:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:22:11,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178434860] [2024-11-19 00:22:11,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:22:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-19 00:22:12,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:22:12,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178434860] [2024-11-19 00:22:12,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178434860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:12,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:22:12,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:22:12,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070392675] [2024-11-19 00:22:12,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:12,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:22:12,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:22:12,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:22:12,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:22:12,383 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-19 00:22:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:13,196 INFO L93 Difference]: Finished difference Result 197 states and 262 transitions. [2024-11-19 00:22:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:22:13,197 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2024-11-19 00:22:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:13,200 INFO L225 Difference]: With dead ends: 197 [2024-11-19 00:22:13,202 INFO L226 Difference]: Without dead ends: 165 [2024-11-19 00:22:13,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:22:13,203 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 195 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:22:13,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 312 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:22:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-19 00:22:13,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 135. [2024-11-19 00:22:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 97 states have (on average 1.1958762886597938) internal successors, (116), 99 states have internal predecessors, (116), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-19 00:22:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 178 transitions. [2024-11-19 00:22:13,236 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 178 transitions. Word has length 55 [2024-11-19 00:22:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:13,237 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 178 transitions. [2024-11-19 00:22:13,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-19 00:22:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 178 transitions. [2024-11-19 00:22:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 00:22:13,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:13,240 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:22:13,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:22:13,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:13,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1551859698, now seen corresponding path program 1 times [2024-11-19 00:22:13,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:22:13,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697956588] [2024-11-19 00:22:13,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:13,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:22:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:22:13,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [275122378] [2024-11-19 00:22:13,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:13,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:22:13,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:22:13,278 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:22:13,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:22:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:22:13,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:22:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:22:13,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:22:13,404 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:22:13,405 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:22:13,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:22:13,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 00:22:13,614 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 00:22:13,657 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:22:13,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:22:13 BoogieIcfgContainer [2024-11-19 00:22:13,665 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:22:13,665 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:22:13,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:22:13,666 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:22:13,666 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:08" (3/4) ... [2024-11-19 00:22:13,668 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:22:13,669 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:22:13,670 INFO L158 Benchmark]: Toolchain (without parser) took 6095.98ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 94.5MB in the beginning and 81.5MB in the end (delta: 13.0MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2024-11-19 00:22:13,671 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:22:13,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.58ms. Allocated memory is still 169.9MB. Free memory was 94.2MB in the beginning and 137.6MB in the end (delta: -43.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:22:13,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.16ms. Allocated memory is still 169.9MB. Free memory was 137.6MB in the beginning and 134.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:22:13,672 INFO L158 Benchmark]: Boogie Preprocessor took 59.66ms. Allocated memory is still 169.9MB. Free memory was 134.8MB in the beginning and 131.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:22:13,673 INFO L158 Benchmark]: RCFGBuilder took 408.20ms. Allocated memory is still 169.9MB. Free memory was 131.9MB in the beginning and 117.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:22:13,673 INFO L158 Benchmark]: TraceAbstraction took 5196.26ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 116.7MB in the beginning and 81.5MB in the end (delta: 35.2MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2024-11-19 00:22:13,673 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 205.5MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:22:13,675 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 169.9MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.58ms. Allocated memory is still 169.9MB. Free memory was 94.2MB in the beginning and 137.6MB in the end (delta: -43.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.16ms. Allocated memory is still 169.9MB. Free memory was 137.6MB in the beginning and 134.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.66ms. Allocated memory is still 169.9MB. Free memory was 134.8MB in the beginning and 131.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 408.20ms. Allocated memory is still 169.9MB. Free memory was 131.9MB in the beginning and 117.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5196.26ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 116.7MB in the beginning and 81.5MB in the end (delta: 35.2MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 205.5MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_7 = 0; [L24] double var_1_8 = 15.6; [L25] double var_1_9 = 15.4; [L26] double var_1_10 = 32.2; [L27] unsigned char var_1_12 = 1; [L28] signed short int var_1_13 = 256; [L29] float var_1_14 = 5.75; [L30] float var_1_15 = 8.6; [L31] unsigned char last_1_var_1_7 = 0; [L32] signed short int last_1_var_1_13 = 256; VAL [isInitial=0, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_8=78/5, var_1_9=77/5] [L84] isInitial = 1 [L85] FCALL initially() [L86] COND TRUE 1 [L87] CALL updateLastVariables() [L76] last_1_var_1_7 = var_1_7 [L77] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_8=78/5, var_1_9=77/5] [L87] RET updateLastVariables() [L88] CALL updateVariables() [L61] var_1_8 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L62] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L63] var_1_9 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L64] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L65] var_1_10 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L66] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L67] var_1_12 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L68] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L69] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L88] RET updateVariables() [L89] CALL step() [L36] COND TRUE (last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L37] COND FALSE !(last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L45] COND TRUE \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L46] COND TRUE (var_1_14 - var_1_15) >= ((var_1_8 + var_1_10) + var_1_9) [L47] var_1_13 = ((((var_1_1) > (var_1_1)) ? (var_1_1) : (var_1_1))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L52] COND TRUE ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) <= var_1_10 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L53] COND FALSE !(last_1_var_1_7 && (var_1_1 >= var_1_1)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L89] RET step() [L90] CALL, EXPR property() [L80-L81] return ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? (var_1_1 == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_13))) && ((((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) <= var_1_10) ? ((last_1_var_1_7 && (var_1_1 >= var_1_1)) ? (var_1_7 == ((unsigned char) 0)) : 1) : (var_1_7 == ((unsigned char) var_1_12)))) && (var_1_12 ? (((var_1_14 - var_1_15) >= ((var_1_8 + var_1_10) + var_1_9)) ? (var_1_13 == ((signed short int) ((((var_1_1) > (var_1_1)) ? (var_1_1) : (var_1_1))))) : (var_1_13 == ((signed short int) var_1_1))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L90] RET, EXPR property() [L90] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 4, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 657 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 167 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 324/336 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-19 00:22:13,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.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 53ac7479a950235157217cca437cf6f6e0f377d0e27ff61b959bf8258dd5b0ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:22:15,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:22:15,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:22:15,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:22:15,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:22:15,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:22:15,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:22:15,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:22:15,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:22:15,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:22:15,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:22:15,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:22:15,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:22:15,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:22:15,953 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:22:15,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:22:15,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:22:15,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:22:15,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:22:15,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:22:15,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:22:15,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:22:15,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:22:15,957 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:22:15,957 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:22:15,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:22:15,958 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:22:15,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:22:15,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:22:15,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:22:15,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:22:15,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:22:15,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:22:15,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:22:15,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:22:15,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:22:15,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:22:15,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:22:15,961 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:22:15,961 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:22:15,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:22:15,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:22:15,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:22:15,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:22:15,963 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 -> 53ac7479a950235157217cca437cf6f6e0f377d0e27ff61b959bf8258dd5b0ad [2024-11-19 00:22:16,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:22:16,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:22:16,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:22:16,308 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:22:16,309 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:22:16,310 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-21.i [2024-11-19 00:22:17,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:22:18,007 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:22:18,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i [2024-11-19 00:22:18,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f4608eea/51943ea922ba4021961e81f64806d45b/FLAGdac9b8660 [2024-11-19 00:22:18,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f4608eea/51943ea922ba4021961e81f64806d45b [2024-11-19 00:22:18,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:22:18,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:22:18,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:22:18,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:22:18,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:22:18,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379d9c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18, skipping insertion in model container [2024-11-19 00:22:18,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:22:18,253 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-21.i[913,926] [2024-11-19 00:22:18,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:22:18,320 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:22:18,333 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-21.i[913,926] [2024-11-19 00:22:18,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:22:18,369 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:22:18,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18 WrapperNode [2024-11-19 00:22:18,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:22:18,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:22:18,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:22:18,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:22:18,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,418 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-19 00:22:18,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:22:18,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:22:18,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:22:18,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:22:18,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,441 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-19 00:22:18,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:22:18,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:22:18,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:22:18,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:22:18,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (1/1) ... [2024-11-19 00:22:18,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:22:18,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:22:18,496 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-19 00:22:18,503 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-19 00:22:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:22:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:22:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:22:18,547 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:22:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:22:18,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:22:18,617 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:22:18,619 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:22:23,210 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-19 00:22:23,211 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:22:23,220 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:22:23,221 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:22:23,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:23 BoogieIcfgContainer [2024-11-19 00:22:23,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:22:23,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:22:23,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:22:23,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:22:23,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:22:18" (1/3) ... [2024-11-19 00:22:23,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f614de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:22:23, skipping insertion in model container [2024-11-19 00:22:23,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:18" (2/3) ... [2024-11-19 00:22:23,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f614de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:22:23, skipping insertion in model container [2024-11-19 00:22:23,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:23" (3/3) ... [2024-11-19 00:22:23,231 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-21.i [2024-11-19 00:22:23,244 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:22:23,244 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:22:23,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:22:23,308 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;@60cbcb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:22:23,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:22:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 00:22:23,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 00:22:23,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:23,321 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:22:23,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:23,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash -510096507, now seen corresponding path program 1 times [2024-11-19 00:22:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:22:23,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694315178] [2024-11-19 00:22:23,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:23,343 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-19 00:22:23,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:22:23,347 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-19 00:22:23,348 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-19 00:22:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:23,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:22:23,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:23,552 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:22:23,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:22:23,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:22:23,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694315178] [2024-11-19 00:22:23,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694315178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:23,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:22:23,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:22:23,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049658875] [2024-11-19 00:22:23,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:23,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:22:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:22:23,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:22:23,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:22:23,584 INFO L87 Difference]: Start difference. First operand has 39 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 00:22:23,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:23,606 INFO L93 Difference]: Finished difference Result 71 states and 111 transitions. [2024-11-19 00:22:23,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:22:23,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-11-19 00:22:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:23,613 INFO L225 Difference]: With dead ends: 71 [2024-11-19 00:22:23,613 INFO L226 Difference]: Without dead ends: 35 [2024-11-19 00:22:23,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 52 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-19 00:22:23,619 INFO L432 NwaCegarLoop]: 48 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, 48 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-19 00:22:23,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:22:23,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-19 00:22:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-19 00:22:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 00:22:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-19 00:22:23,654 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 53 [2024-11-19 00:22:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:23,654 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-19 00:22:23,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 00:22:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-19 00:22:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 00:22:23,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:23,657 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:22:23,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 00:22:23,857 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-19 00:22:23,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:23,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1104841853, now seen corresponding path program 1 times [2024-11-19 00:22:23,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:22:23,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593496682] [2024-11-19 00:22:23,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:23,861 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-19 00:22:23,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:22:23,862 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-19 00:22:23,863 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-19 00:22:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:24,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:22:24,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-19 00:22:24,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:22:24,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:22:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593496682] [2024-11-19 00:22:24,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593496682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:24,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:22:24,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:22:24,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269335282] [2024-11-19 00:22:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:24,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:22:24,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:22:24,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:22:24,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:22:24,370 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-19 00:22:26,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:22:29,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:22:31,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:22:33,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:22:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:33,923 INFO L93 Difference]: Finished difference Result 107 states and 147 transitions. [2024-11-19 00:22:33,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:22:33,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2024-11-19 00:22:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:33,947 INFO L225 Difference]: With dead ends: 107 [2024-11-19 00:22:33,947 INFO L226 Difference]: Without dead ends: 75 [2024-11-19 00:22:33,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:22:33,951 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 53 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:22:33,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 122 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-19 00:22:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-19 00:22:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2024-11-19 00:22:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:22:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2024-11-19 00:22:33,968 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 53 [2024-11-19 00:22:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:33,968 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2024-11-19 00:22:33,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-19 00:22:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2024-11-19 00:22:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 00:22:33,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:33,970 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:22:33,978 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-19 00:22:34,171 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-19 00:22:34,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:34,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash 706987382, now seen corresponding path program 1 times [2024-11-19 00:22:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:22:34,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891261145] [2024-11-19 00:22:34,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:34,173 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-19 00:22:34,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:22:34,175 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-19 00:22:34,176 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-19 00:22:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:34,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:22:34,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-19 00:22:34,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:22:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-19 00:22:34,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:22:34,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891261145] [2024-11-19 00:22:34,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891261145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:22:34,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:22:34,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-19 00:22:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344837216] [2024-11-19 00:22:34,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:22:34,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:22:34,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:22:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:22:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:22:34,609 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:22:37,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:22:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:37,552 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2024-11-19 00:22:37,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:22:37,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 54 [2024-11-19 00:22:37,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:37,577 INFO L225 Difference]: With dead ends: 125 [2024-11-19 00:22:37,577 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 00:22:37,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:22:37,579 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:22:37,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 93 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 00:22:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 00:22:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-11-19 00:22:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:22:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2024-11-19 00:22:37,600 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 54 [2024-11-19 00:22:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:37,603 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2024-11-19 00:22:37,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:22:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2024-11-19 00:22:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 00:22:37,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:37,604 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:22:37,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 00:22:37,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:22:37,805 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:37,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1443072449, now seen corresponding path program 1 times [2024-11-19 00:22:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:22:37,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458487529] [2024-11-19 00:22:37,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:37,807 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-19 00:22:37,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:22:37,810 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:22:37,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 00:22:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:38,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:22:38,063 INFO L278 TraceCheckSpWp]: Computing forward predicates...