./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash c2ad67805566e6dd7791a2ce255a6cca7737f047950b2772f8edc9cba4cf8df2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 23:56:24,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 23:56:25,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-11 23:56:25,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 23:56:25,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 23:56:25,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 23:56:25,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 23:56:25,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 23:56:25,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 23:56:25,042 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 23:56:25,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 23:56:25,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 23:56:25,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 23:56:25,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 23:56:25,053 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 23:56:25,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 23:56:25,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 23:56:25,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 23:56:25,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 23:56:25,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 23:56:25,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 23:56:25,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 23:56:25,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 23:56:25,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 23:56:25,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 23:56:25,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 23:56:25,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 23:56:25,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 23:56:25,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 23:56:25,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:56:25,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 23:56:25,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 23:56:25,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 23:56:25,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 23:56:25,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 23:56:25,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 23:56:25,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 23:56:25,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 23:56:25,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 23:56:25,060 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2ad67805566e6dd7791a2ce255a6cca7737f047950b2772f8edc9cba4cf8df2 [2024-11-11 23:56:25,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 23:56:25,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 23:56:25,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 23:56:25,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 23:56:25,275 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 23:56:25,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-11-11 23:56:26,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 23:56:26,627 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 23:56:26,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-11-11 23:56:26,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21fc904ea/0c30b28fd5ad4a5abc2cd2dd028f013c/FLAG6af4007e3 [2024-11-11 23:56:27,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21fc904ea/0c30b28fd5ad4a5abc2cd2dd028f013c [2024-11-11 23:56:27,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 23:56:27,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 23:56:27,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 23:56:27,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 23:56:27,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 23:56:27,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5c88da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27, skipping insertion in model container [2024-11-11 23:56:27,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 23:56:27,199 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/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c[1249,1262] [2024-11-11 23:56:27,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:56:27,286 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 23:56:27,296 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/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c[1249,1262] [2024-11-11 23:56:27,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:56:27,357 INFO L204 MainTranslator]: Completed translation [2024-11-11 23:56:27,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27 WrapperNode [2024-11-11 23:56:27,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 23:56:27,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 23:56:27,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 23:56:27,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 23:56:27,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,416 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 416 [2024-11-11 23:56:27,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 23:56:27,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 23:56:27,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 23:56:27,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 23:56:27,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,473 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-11 23:56:27,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 23:56:27,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 23:56:27,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 23:56:27,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 23:56:27,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (1/1) ... [2024-11-11 23:56:27,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:56:27,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:56:27,546 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-11 23:56:27,548 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-11 23:56:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 23:56:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 23:56:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 23:56:27,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 23:56:27,670 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 23:56:27,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 23:56:28,152 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-11 23:56:28,153 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 23:56:28,165 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 23:56:28,166 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 23:56:28,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:28 BoogieIcfgContainer [2024-11-11 23:56:28,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 23:56:28,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 23:56:28,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 23:56:28,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 23:56:28,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:56:27" (1/3) ... [2024-11-11 23:56:28,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c115864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:56:28, skipping insertion in model container [2024-11-11 23:56:28,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:27" (2/3) ... [2024-11-11 23:56:28,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c115864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:56:28, skipping insertion in model container [2024-11-11 23:56:28,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:28" (3/3) ... [2024-11-11 23:56:28,177 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v5.c [2024-11-11 23:56:28,190 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 23:56:28,190 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 23:56:28,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 23:56:28,239 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;@35c047d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 23:56:28,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 23:56:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 23:56:28,252 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:28,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:56:28,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:28,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:28,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1364539026, now seen corresponding path program 1 times [2024-11-11 23:56:28,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:56:28,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84417671] [2024-11-11 23:56:28,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:56:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:56:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:56:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:56:28,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:56:28,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84417671] [2024-11-11 23:56:28,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84417671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:56:28,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:56:28,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:56:28,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278724224] [2024-11-11 23:56:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:56:28,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:56:28,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:56:28,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:56:28,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:56:28,871 INFO L87 Difference]: Start difference. First operand has 94 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:56:28,925 INFO L93 Difference]: Finished difference Result 139 states and 204 transitions. [2024-11-11 23:56:28,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:56:28,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-11 23:56:28,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:56:28,934 INFO L225 Difference]: With dead ends: 139 [2024-11-11 23:56:28,934 INFO L226 Difference]: Without dead ends: 91 [2024-11-11 23:56:28,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11 23:56:28,941 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 105 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:56:28,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 249 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:56:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-11 23:56:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-11 23:56:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-11 23:56:28,969 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 35 [2024-11-11 23:56:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:56:28,969 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-11 23:56:28,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-11 23:56:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 23:56:28,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:28,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:56:28,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 23:56:28,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:28,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:28,971 INFO L85 PathProgramCache]: Analyzing trace with hash -689406165, now seen corresponding path program 1 times [2024-11-11 23:56:28,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:56:28,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882728292] [2024-11-11 23:56:28,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:56:28,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:56:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:56:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:56:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:56:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882728292] [2024-11-11 23:56:29,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882728292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:56:29,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:56:29,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:56:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673856981] [2024-11-11 23:56:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:56:29,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:56:29,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:56:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:56:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:56:29,133 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:56:29,158 INFO L93 Difference]: Finished difference Result 95 states and 135 transitions. [2024-11-11 23:56:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:56:29,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-11 23:56:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:56:29,160 INFO L225 Difference]: With dead ends: 95 [2024-11-11 23:56:29,160 INFO L226 Difference]: Without dead ends: 93 [2024-11-11 23:56:29,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:56:29,161 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:56:29,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:56:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-11 23:56:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-11 23:56:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-11 23:56:29,175 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 37 [2024-11-11 23:56:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:56:29,175 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-11 23:56:29,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-11 23:56:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 23:56:29,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:29,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:56:29,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 23:56:29,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:29,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash 104940713, now seen corresponding path program 1 times [2024-11-11 23:56:29,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:56:29,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117548446] [2024-11-11 23:56:29,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:56:29,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:56:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 23:56:29,217 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 23:56:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 23:56:29,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 23:56:29,265 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 23:56:29,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 23:56:29,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 23:56:29,270 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-11 23:56:29,312 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 23:56:29,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 11:56:29 BoogieIcfgContainer [2024-11-11 23:56:29,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 23:56:29,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 23:56:29,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 23:56:29,319 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 23:56:29,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:28" (3/4) ... [2024-11-11 23:56:29,323 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 23:56:29,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 23:56:29,325 INFO L158 Benchmark]: Toolchain (without parser) took 2294.85ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 86.4MB in the beginning and 133.6MB in the end (delta: -47.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 23:56:29,325 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 23:56:29,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.38ms. Allocated memory is still 153.1MB. Free memory was 86.2MB in the beginning and 120.9MB in the end (delta: -34.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-11 23:56:29,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.68ms. Allocated memory is still 153.1MB. Free memory was 120.9MB in the beginning and 111.6MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 23:56:29,328 INFO L158 Benchmark]: Boogie Preprocessor took 96.04ms. Allocated memory is still 153.1MB. Free memory was 111.6MB in the beginning and 105.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-11 23:56:29,329 INFO L158 Benchmark]: RCFGBuilder took 653.93ms. Allocated memory is still 153.1MB. Free memory was 105.3MB in the beginning and 113.7MB in the end (delta: -8.4MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2024-11-11 23:56:29,329 INFO L158 Benchmark]: TraceAbstraction took 1148.37ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 112.9MB in the beginning and 133.6MB in the end (delta: -20.7MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-11 23:56:29,329 INFO L158 Benchmark]: Witness Printer took 6.57ms. Allocated memory is still 190.8MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 23:56:29,331 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.38ms. Allocated memory is still 153.1MB. Free memory was 86.2MB in the beginning and 120.9MB in the end (delta: -34.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.68ms. Allocated memory is still 153.1MB. Free memory was 120.9MB in the beginning and 111.6MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.04ms. Allocated memory is still 153.1MB. Free memory was 111.6MB in the beginning and 105.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 653.93ms. Allocated memory is still 153.1MB. Free memory was 105.3MB in the beginning and 113.7MB in the end (delta: -8.4MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1148.37ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 112.9MB in the beginning and 133.6MB in the end (delta: -20.7MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Witness Printer took 6.57ms. Allocated memory is still 190.8MB. Free memory is still 133.6MB. 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: 21]: 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 bitwiseAnd at line 99. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_17 = 1; [L34] const SORT_5 var_29 = 0; [L35] const SORT_1 var_75 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_27; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L45] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L47] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L48] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L49] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L50] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L51] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L52] SORT_5 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L53] SORT_1 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L54] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L55] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_11_arg_1 = var_9; [L58] state_10 = init_11_arg_1 [L59] SORT_1 init_13_arg_1 = var_9; [L60] state_12 = init_13_arg_1 [L61] SORT_1 init_22_arg_1 = var_9; [L62] state_21 = init_22_arg_1 [L63] SORT_1 init_24_arg_1 = var_9; [L64] state_23 = init_24_arg_1 [L65] SORT_1 init_26_arg_1 = var_9; [L66] state_25 = init_26_arg_1 [L67] SORT_5 init_31_arg_1 = var_29; [L68] state_30 = init_31_arg_1 [L69] SORT_1 init_33_arg_1 = var_9; [L70] state_32 = init_33_arg_1 [L71] SORT_5 init_35_arg_1 = var_29; [L72] state_34 = init_35_arg_1 [L73] SORT_1 init_37_arg_1 = var_9; [L74] state_36 = init_37_arg_1 [L75] SORT_1 init_40_arg_1 = var_9; [L76] state_39 = init_40_arg_1 [L77] SORT_1 init_42_arg_1 = var_9; [L78] state_41 = init_42_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_19_arg_0=1, var_19_arg_1=-2, var_29=0, var_75=1, var_9=0] [L99] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] EXPR var_19 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 630 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 376 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 254 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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-11 23:56:29,355 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/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash c2ad67805566e6dd7791a2ce255a6cca7737f047950b2772f8edc9cba4cf8df2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 23:56:31,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 23:56:31,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-11 23:56:31,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 23:56:31,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 23:56:31,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 23:56:31,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 23:56:31,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 23:56:31,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 23:56:31,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 23:56:31,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 23:56:31,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 23:56:31,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 23:56:31,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 23:56:31,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 23:56:31,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 23:56:31,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 23:56:31,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 23:56:31,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 23:56:31,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 23:56:31,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 23:56:31,289 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 23:56:31,290 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 23:56:31,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 23:56:31,291 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 23:56:31,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 23:56:31,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 23:56:31,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 23:56:31,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 23:56:31,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 23:56:31,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 23:56:31,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:56:31,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 23:56:31,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 23:56:31,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 23:56:31,296 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 23:56:31,296 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 23:56:31,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 23:56:31,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 23:56:31,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 23:56:31,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 23:56:31,298 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2ad67805566e6dd7791a2ce255a6cca7737f047950b2772f8edc9cba4cf8df2 [2024-11-11 23:56:31,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 23:56:31,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 23:56:31,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 23:56:31,546 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 23:56:31,546 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 23:56:31,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-11-11 23:56:32,724 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 23:56:32,919 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 23:56:32,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-11-11 23:56:32,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce05f2b8d/13cbfb4313d24f328ed156c17d81edc6/FLAGacadf5a30 [2024-11-11 23:56:33,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce05f2b8d/13cbfb4313d24f328ed156c17d81edc6 [2024-11-11 23:56:33,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 23:56:33,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 23:56:33,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 23:56:33,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 23:56:33,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 23:56:33,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a43f50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33, skipping insertion in model container [2024-11-11 23:56:33,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 23:56:33,478 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/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c[1249,1262] [2024-11-11 23:56:33,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:56:33,545 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 23:56:33,555 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/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c[1249,1262] [2024-11-11 23:56:33,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:56:33,627 INFO L204 MainTranslator]: Completed translation [2024-11-11 23:56:33,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33 WrapperNode [2024-11-11 23:56:33,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 23:56:33,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 23:56:33,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 23:56:33,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 23:56:33,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,673 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 248 [2024-11-11 23:56:33,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 23:56:33,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 23:56:33,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 23:56:33,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 23:56:33,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,719 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-11 23:56:33,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,725 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 23:56:33,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 23:56:33,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 23:56:33,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 23:56:33,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (1/1) ... [2024-11-11 23:56:33,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:56:33,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:56:33,769 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-11 23:56:33,771 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-11 23:56:33,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 23:56:33,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 23:56:33,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 23:56:33,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 23:56:33,912 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 23:56:33,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 23:56:34,150 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-11 23:56:34,150 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 23:56:34,159 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 23:56:34,160 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 23:56:34,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:34 BoogieIcfgContainer [2024-11-11 23:56:34,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 23:56:34,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 23:56:34,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 23:56:34,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 23:56:34,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:56:33" (1/3) ... [2024-11-11 23:56:34,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4425a0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:56:34, skipping insertion in model container [2024-11-11 23:56:34,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:33" (2/3) ... [2024-11-11 23:56:34,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4425a0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:56:34, skipping insertion in model container [2024-11-11 23:56:34,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:34" (3/3) ... [2024-11-11 23:56:34,168 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v5.c [2024-11-11 23:56:34,182 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 23:56:34,182 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 23:56:34,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 23:56:34,235 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;@46b6f6af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 23:56:34,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 23:56:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-11 23:56:34,243 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:34,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-11 23:56:34,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:34,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:34,249 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-11 23:56:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 23:56:34,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566274710] [2024-11-11 23:56:34,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:56:34,260 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-11 23:56:34,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 23:56:34,263 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-11 23:56:34,264 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-11 23:56:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:56:34,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 23:56:34,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 23:56:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:56:34,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 23:56:34,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 23:56:34,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566274710] [2024-11-11 23:56:34,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566274710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:56:34,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:56:34,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:56:34,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865963350] [2024-11-11 23:56:34,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:56:34,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:56:34,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 23:56:34,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:56:34,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:56:34,523 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:34,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:56:34,553 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-11 23:56:34,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:56:34,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-11 23:56:34,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:56:34,560 INFO L225 Difference]: With dead ends: 17 [2024-11-11 23:56:34,560 INFO L226 Difference]: Without dead ends: 9 [2024-11-11 23:56:34,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:56:34,565 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:56:34,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:56:34,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-11 23:56:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-11 23:56:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-11 23:56:34,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-11 23:56:34,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:56:34,588 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-11 23:56:34,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-11 23:56:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 23:56:34,589 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:34,589 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-11 23:56:34,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-11 23:56:34,791 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-11 23:56:34,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:34,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:34,793 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-11 23:56:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 23:56:34,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284396183] [2024-11-11 23:56:34,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:56:34,794 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-11 23:56:34,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 23:56:34,798 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-11 23:56:34,824 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-11 23:56:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:56:34,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-11 23:56:34,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 23:56:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:56:35,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 23:56:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:56:37,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 23:56:37,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284396183] [2024-11-11 23:56:37,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284396183] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 23:56:37,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 23:56:37,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-11 23:56:37,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646366879] [2024-11-11 23:56:37,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 23:56:37,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 23:56:37,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 23:56:37,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 23:56:37,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 23:56:37,694 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:38,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:56:38,054 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-11 23:56:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 23:56:38,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-11 23:56:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:56:38,055 INFO L225 Difference]: With dead ends: 14 [2024-11-11 23:56:38,055 INFO L226 Difference]: Without dead ends: 12 [2024-11-11 23:56:38,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-11 23:56:38,056 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:56:38,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:56:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-11 23:56:38,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-11 23:56:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-11 23:56:38,059 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-11 23:56:38,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:56:38,059 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-11 23:56:38,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:56:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-11 23:56:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 23:56:38,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:56:38,060 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-11 23:56:38,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-11 23:56:38,263 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-11 23:56:38,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:56:38,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:56:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-11 23:56:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 23:56:38,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31065653] [2024-11-11 23:56:38,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 23:56:38,266 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-11 23:56:38,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 23:56:38,267 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-11 23:56:38,268 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-11 23:56:38,389 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 23:56:38,389 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 23:56:38,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-11 23:56:38,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 23:56:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:56:39,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 23:57:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:57:00,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 23:57:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31065653] [2024-11-11 23:57:00,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31065653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 23:57:00,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 23:57:00,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-11 23:57:00,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200530398] [2024-11-11 23:57:00,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 23:57:00,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 23:57:00,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 23:57:00,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 23:57:00,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=67, Unknown=2, NotChecked=0, Total=90 [2024-11-11 23:57:00,693 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:57:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:57:15,312 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-11 23:57:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 23:57:15,313 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-11 23:57:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:57:15,313 INFO L225 Difference]: With dead ends: 17 [2024-11-11 23:57:15,313 INFO L226 Difference]: Without dead ends: 15 [2024-11-11 23:57:15,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=59, Invalid=149, Unknown=2, NotChecked=0, Total=210 [2024-11-11 23:57:15,314 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 23:57:15,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 23:57:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-11 23:57:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-11 23:57:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:57:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-11 23:57:15,320 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-11 23:57:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:57:15,321 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-11 23:57:15,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:57:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-11 23:57:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 23:57:15,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:57:15,322 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-11 23:57:15,326 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 (4)] Forceful destruction successful, exit code 0 [2024-11-11 23:57:15,523 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-11 23:57:15,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:57:15,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:57:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-11 23:57:15,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 23:57:15,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916403081] [2024-11-11 23:57:15,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 23:57:15,525 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-11 23:57:15,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 23:57:15,528 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-11 23:57:15,529 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-11 23:57:15,650 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-11 23:57:15,650 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-11 23:57:15,650 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 23:57:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 23:57:15,849 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-11 23:57:15,849 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 23:57:15,850 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 23:57:15,858 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 (5)] Ended with exit code 0 [2024-11-11 23:57:16,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-11 23:57:16,059 INFO L421 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-11 23:57:16,096 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 23:57:16,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 11:57:16 BoogieIcfgContainer [2024-11-11 23:57:16,098 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 23:57:16,099 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 23:57:16,099 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 23:57:16,099 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 23:57:16,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:34" (3/4) ... [2024-11-11 23:57:16,100 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 23:57:16,180 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 23:57:16,180 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 23:57:16,181 INFO L158 Benchmark]: Toolchain (without parser) took 42874.04ms. Allocated memory was 60.8MB in the beginning and 113.2MB in the end (delta: 52.4MB). Free memory was 40.0MB in the beginning and 35.6MB in the end (delta: 4.3MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2024-11-11 23:57:16,181 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory was 35.7MB in the beginning and 35.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 23:57:16,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.81ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 39.8MB in the beginning and 54.1MB in the end (delta: -14.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 23:57:16,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.46ms. Allocated memory is still 75.5MB. Free memory was 54.1MB in the beginning and 51.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 23:57:16,182 INFO L158 Benchmark]: Boogie Preprocessor took 53.90ms. Allocated memory is still 75.5MB. Free memory was 51.5MB in the beginning and 48.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 23:57:16,182 INFO L158 Benchmark]: RCFGBuilder took 427.98ms. Allocated memory is still 75.5MB. Free memory was 48.2MB in the beginning and 43.9MB in the end (delta: 4.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-11 23:57:16,182 INFO L158 Benchmark]: TraceAbstraction took 41936.61ms. Allocated memory was 75.5MB in the beginning and 113.2MB in the end (delta: 37.7MB). Free memory was 43.5MB in the beginning and 45.1MB in the end (delta: -1.6MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2024-11-11 23:57:16,182 INFO L158 Benchmark]: Witness Printer took 81.71ms. Allocated memory is still 113.2MB. Free memory was 45.1MB in the beginning and 35.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 23:57:16,183 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory was 35.7MB in the beginning and 35.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.81ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 39.8MB in the beginning and 54.1MB in the end (delta: -14.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.46ms. Allocated memory is still 75.5MB. Free memory was 54.1MB in the beginning and 51.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.90ms. Allocated memory is still 75.5MB. Free memory was 51.5MB in the beginning and 48.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 427.98ms. Allocated memory is still 75.5MB. Free memory was 48.2MB in the beginning and 43.9MB in the end (delta: 4.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * TraceAbstraction took 41936.61ms. Allocated memory was 75.5MB in the beginning and 113.2MB in the end (delta: 37.7MB). Free memory was 43.5MB in the beginning and 45.1MB in the end (delta: -1.6MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * Witness Printer took 81.71ms. Allocated memory is still 113.2MB. Free memory was 45.1MB in the beginning and 35.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_17 = 1; [L34] const SORT_5 var_29 = 0; [L35] const SORT_1 var_75 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_27; [L45] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] SORT_5 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] SORT_1 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_11_arg_1 = var_9; [L58] state_10 = init_11_arg_1 [L59] SORT_1 init_13_arg_1 = var_9; [L60] state_12 = init_13_arg_1 [L61] SORT_1 init_22_arg_1 = var_9; [L62] state_21 = init_22_arg_1 [L63] SORT_1 init_24_arg_1 = var_9; [L64] state_23 = init_24_arg_1 [L65] SORT_1 init_26_arg_1 = var_9; [L66] state_25 = init_26_arg_1 [L67] SORT_5 init_31_arg_1 = var_29; [L68] state_30 = init_31_arg_1 [L69] SORT_1 init_33_arg_1 = var_9; [L70] state_32 = init_33_arg_1 [L71] SORT_5 init_35_arg_1 = var_29; [L72] state_34 = init_35_arg_1 [L73] SORT_1 init_37_arg_1 = var_9; [L74] state_36 = init_37_arg_1 [L75] SORT_1 init_40_arg_1 = var_9; [L76] state_39 = init_40_arg_1 [L77] SORT_1 init_42_arg_1 = var_9; [L78] state_41 = init_42_arg_1 VAL [mask_SORT_1=-1, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.8s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 13 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 30.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 25.2s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 38 ConstructedInterpolants, 14 QuantifiedInterpolants, 1886 SizeOfPredicates, 16 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 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 proved your program to be incorrect! [2024-11-11 23:57:16,403 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-11 23:57:16,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE