./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.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 caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 05:05:40,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 05:05:40,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-22 05:05:40,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 05:05:40,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 05:05:40,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 05:05:40,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 05:05:40,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 05:05:40,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 05:05:40,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 05:05:40,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 05:05:40,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 05:05:40,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 05:05:40,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 05:05:40,941 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 05:05:40,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 05:05:40,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 05:05:40,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 05:05:40,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 05:05:40,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 05:05:40,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 05:05:40,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 05:05:40,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 05:05:40,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 05:05:40,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 05:05:40,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 05:05:40,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 05:05:40,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 05:05:40,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 05:05:40,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:05:40,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 05:05:40,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 05:05:40,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 05:05:40,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 05:05:40,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 05:05:40,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 05:05:40,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 05:05:40,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 05:05:40,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 05:05:40,948 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 -> caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a [2024-11-22 05:05:41,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 05:05:41,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 05:05:41,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 05:05:41,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 05:05:41,180 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 05:05:41,180 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_v1.c [2024-11-22 05:05:42,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 05:05:42,800 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 05:05:42,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2024-11-22 05:05:42,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa255d8b/f35be02f21e14c04b03465e9448bf649/FLAGfb6635008 [2024-11-22 05:05:43,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa255d8b/f35be02f21e14c04b03465e9448bf649 [2024-11-22 05:05:43,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 05:05:43,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 05:05:43,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 05:05:43,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 05:05:43,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 05:05:43,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21de279f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43, skipping insertion in model container [2024-11-22 05:05:43,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 05:05:43,431 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_v1.c[1249,1262] [2024-11-22 05:05:43,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:05:43,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 05:05:43,528 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_v1.c[1249,1262] [2024-11-22 05:05:43,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:05:43,573 INFO L204 MainTranslator]: Completed translation [2024-11-22 05:05:43,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43 WrapperNode [2024-11-22 05:05:43,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 05:05:43,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 05:05:43,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 05:05:43,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 05:05:43,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,663 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 418 [2024-11-22 05:05:43,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 05:05:43,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 05:05:43,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 05:05:43,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 05:05:43,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,707 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-22 05:05:43,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 05:05:43,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 05:05:43,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 05:05:43,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 05:05:43,751 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (1/1) ... [2024-11-22 05:05:43,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:05:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:05:43,782 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-22 05:05:43,791 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-22 05:05:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 05:05:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 05:05:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 05:05:43,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 05:05:43,897 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 05:05:43,899 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 05:05:44,382 INFO L? ?]: Removed 169 outVars from TransFormulas that were not future-live. [2024-11-22 05:05:44,383 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 05:05:44,397 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 05:05:44,398 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 05:05:44,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:05:44 BoogieIcfgContainer [2024-11-22 05:05:44,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 05:05:44,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 05:05:44,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 05:05:44,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 05:05:44,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:05:43" (1/3) ... [2024-11-22 05:05:44,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534fcbc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:05:44, skipping insertion in model container [2024-11-22 05:05:44,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:43" (2/3) ... [2024-11-22 05:05:44,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534fcbc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:05:44, skipping insertion in model container [2024-11-22 05:05:44,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:05:44" (3/3) ... [2024-11-22 05:05:44,406 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v1.c [2024-11-22 05:05:44,418 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 05:05:44,419 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 05:05:44,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 05:05:44,476 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;@60f061d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 05:05:44,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 05:05:44,481 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-22 05:05:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 05:05:44,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:05:44,487 INFO L215 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, 1] [2024-11-22 05:05:44,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:05:44,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:05:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1381663579, now seen corresponding path program 1 times [2024-11-22 05:05:44,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:05:44,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399689823] [2024-11-22 05:05:44,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:05:44,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:05:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:05:44,973 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-22 05:05:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:05:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399689823] [2024-11-22 05:05:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399689823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:05:44,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:05:44,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:05:44,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496617914] [2024-11-22 05:05:44,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:05:44,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:05:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:05:45,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:05:45,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:05:45,030 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 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-22 05:05:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:05:45,129 INFO L93 Difference]: Finished difference Result 137 states and 201 transitions. [2024-11-22 05:05:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:05:45,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2024-11-22 05:05:45,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:05:45,139 INFO L225 Difference]: With dead ends: 137 [2024-11-22 05:05:45,139 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 05:05:45,141 INFO L431 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-22 05:05:45,144 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 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-22 05:05:45,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:05:45,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 05:05:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 05:05:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 92 states have internal predecessors, (135), 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-22 05:05:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-22 05:05:45,178 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 39 [2024-11-22 05:05:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:05:45,178 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-22 05:05:45,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-22 05:05:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-22 05:05:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 05:05:45,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:05:45,180 INFO L215 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, 1, 1] [2024-11-22 05:05:45,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 05:05:45,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:05:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:05:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash -116406637, now seen corresponding path program 1 times [2024-11-22 05:05:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:05:45,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181770037] [2024-11-22 05:05:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:05:45,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:05:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:05:45,312 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-22 05:05:45,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:05:45,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181770037] [2024-11-22 05:05:45,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181770037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:05:45,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:05:45,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:05:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346704162] [2024-11-22 05:05:45,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:05:45,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:05:45,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:05:45,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:05:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:05:45,318 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-22 05:05:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:05:45,360 INFO L93 Difference]: Finished difference Result 138 states and 199 transitions. [2024-11-22 05:05:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:05:45,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-11-22 05:05:45,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:05:45,364 INFO L225 Difference]: With dead ends: 138 [2024-11-22 05:05:45,364 INFO L226 Difference]: Without dead ends: 95 [2024-11-22 05:05:45,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-22 05:05:45,365 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:05:45,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:05:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-22 05:05:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-22 05:05:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 94 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-22 05:05:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-22 05:05:45,372 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 40 [2024-11-22 05:05:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:05:45,373 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-22 05:05:45,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-22 05:05:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-22 05:05:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 05:05:45,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:05:45,374 INFO L215 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, 1, 1, 1] [2024-11-22 05:05:45,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 05:05:45,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:05:45,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:05:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash -411604172, now seen corresponding path program 1 times [2024-11-22 05:05:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:05:45,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27999769] [2024-11-22 05:05:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:05:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:05:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:05:45,607 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-22 05:05:45,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:05:45,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27999769] [2024-11-22 05:05:45,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27999769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:05:45,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:05:45,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 05:05:45,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233730812] [2024-11-22 05:05:45,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:05:45,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 05:05:45,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:05:45,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 05:05:45,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:05:45,609 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-22 05:05:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:05:45,668 INFO L93 Difference]: Finished difference Result 138 states and 198 transitions. [2024-11-22 05:05:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:05:45,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 41 [2024-11-22 05:05:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:05:45,669 INFO L225 Difference]: With dead ends: 138 [2024-11-22 05:05:45,669 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 05:05:45,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 05:05:45,671 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 101 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:05:45,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 372 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:05:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 05:05:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 05:05:45,680 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-22 05:05:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-22 05:05:45,681 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 41 [2024-11-22 05:05:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:05:45,685 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-22 05:05:45,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-22 05:05:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-22 05:05:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 05:05:45,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:05:45,686 INFO L215 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, 1, 1, 1, 1] [2024-11-22 05:05:45,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 05:05:45,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:05:45,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:05:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1689717878, now seen corresponding path program 1 times [2024-11-22 05:05:45,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:05:45,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700485859] [2024-11-22 05:05:45,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:05:45,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:05:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 05:05:45,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 05:05:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 05:05:45,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 05:05:45,785 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 05:05:45,786 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 05:05:45,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 05:05:45,789 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-22 05:05:45,831 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 05:05:45,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:05:45 BoogieIcfgContainer [2024-11-22 05:05:45,836 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 05:05:45,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 05:05:45,837 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 05:05:45,837 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 05:05:45,837 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:05:44" (3/4) ... [2024-11-22 05:05:45,840 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 05:05:45,843 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 05:05:45,844 INFO L158 Benchmark]: Toolchain (without parser) took 2666.50ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 113.1MB in the beginning and 86.8MB in the end (delta: 26.3MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. [2024-11-22 05:05:45,845 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:05:45,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.07ms. Allocated memory is still 169.9MB. Free memory was 112.8MB in the beginning and 94.8MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 05:05:45,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.57ms. Allocated memory is still 169.9MB. Free memory was 94.8MB in the beginning and 85.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-22 05:05:45,846 INFO L158 Benchmark]: Boogie Preprocessor took 85.29ms. Allocated memory is still 169.9MB. Free memory was 85.9MB in the beginning and 79.9MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 05:05:45,846 INFO L158 Benchmark]: RCFGBuilder took 648.01ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 79.9MB in the beginning and 174.3MB in the end (delta: -94.4MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-22 05:05:45,847 INFO L158 Benchmark]: TraceAbstraction took 1436.27ms. Allocated memory is still 247.5MB. Free memory was 174.3MB in the beginning and 87.9MB in the end (delta: 86.4MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. [2024-11-22 05:05:45,847 INFO L158 Benchmark]: Witness Printer took 6.56ms. Allocated memory is still 247.5MB. Free memory was 87.9MB in the beginning and 86.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:05:45,851 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.16ms. Allocated memory is still 169.9MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.07ms. Allocated memory is still 169.9MB. Free memory was 112.8MB in the beginning and 94.8MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.57ms. Allocated memory is still 169.9MB. Free memory was 94.8MB in the beginning and 85.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.29ms. Allocated memory is still 169.9MB. Free memory was 85.9MB in the beginning and 79.9MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 648.01ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 79.9MB in the beginning and 174.3MB in the end (delta: -94.4MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1436.27ms. Allocated memory is still 247.5MB. Free memory was 174.3MB in the beginning and 87.9MB in the end (delta: 86.4MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. * Witness Printer took 6.56ms. Allocated memory is still 247.5MB. Free memory was 87.9MB in the beginning and 86.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 102. 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_10 = 0; [L33] const SORT_5 var_18 = 1; [L34] const SORT_5 var_28 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_5 input_6; [L40] SORT_5 input_7; [L41] SORT_5 input_8; [L42] SORT_5 input_9; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L44] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L45] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L46] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L47] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L48] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L49] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L50] SORT_5 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L51] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L52] SORT_5 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L53] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L54] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L55] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_12_arg_1 = var_10; [L58] state_11 = init_12_arg_1 [L59] SORT_1 init_14_arg_1 = var_10; [L60] state_13 = init_14_arg_1 [L61] SORT_1 init_23_arg_1 = var_10; [L62] state_22 = init_23_arg_1 [L63] SORT_1 init_25_arg_1 = var_10; [L64] state_24 = init_25_arg_1 [L65] SORT_1 init_27_arg_1 = var_10; [L66] state_26 = init_27_arg_1 [L67] SORT_5 init_30_arg_1 = var_28; [L68] state_29 = init_30_arg_1 [L69] SORT_5 init_32_arg_1 = var_28; [L70] state_31 = init_32_arg_1 [L71] SORT_1 init_34_arg_1 = var_10; [L72] state_33 = init_34_arg_1 [L73] SORT_5 init_36_arg_1 = var_28; [L74] state_35 = init_36_arg_1 [L75] SORT_1 init_38_arg_1 = var_10; [L76] state_37 = init_38_arg_1 [L77] SORT_1 init_41_arg_1 = var_10; [L78] state_40 = init_41_arg_1 [L79] SORT_1 init_43_arg_1 = var_10; [L80] state_42 = init_43_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] EXPR input_9 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] EXPR var_20 & mask_SORT_5 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_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.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 1142 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 755 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 387 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=2, InterpolantAutomatonStates: 12, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-22 05:05:45,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.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 caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 05:05:48,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 05:05:48,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-22 05:05:48,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 05:05:48,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 05:05:48,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 05:05:48,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 05:05:48,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 05:05:48,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 05:05:48,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 05:05:48,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 05:05:48,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 05:05:48,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 05:05:48,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 05:05:48,160 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 05:05:48,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 05:05:48,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 05:05:48,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 05:05:48,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 05:05:48,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 05:05:48,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 05:05:48,162 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 05:05:48,162 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 05:05:48,162 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 05:05:48,162 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 05:05:48,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 05:05:48,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 05:05:48,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 05:05:48,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 05:05:48,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 05:05:48,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 05:05:48,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:05:48,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 05:05:48,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 05:05:48,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 05:05:48,164 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 05:05:48,164 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 05:05:48,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 05:05:48,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 05:05:48,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 05:05:48,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 05:05:48,165 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 -> caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a [2024-11-22 05:05:48,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 05:05:48,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 05:05:48,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 05:05:48,474 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 05:05:48,474 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 05:05:48,475 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_v1.c [2024-11-22 05:05:49,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 05:05:50,175 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 05:05:50,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2024-11-22 05:05:50,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a3ad494/3e61b4c06b3945318026a9f2e141aedb/FLAG2263e1489 [2024-11-22 05:05:50,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a3ad494/3e61b4c06b3945318026a9f2e141aedb [2024-11-22 05:05:50,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 05:05:50,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 05:05:50,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 05:05:50,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 05:05:50,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 05:05:50,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:50,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b97bfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50, skipping insertion in model container [2024-11-22 05:05:50,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:50,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 05:05:50,763 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_v1.c[1249,1262] [2024-11-22 05:05:50,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:05:50,825 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 05:05:50,836 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_v1.c[1249,1262] [2024-11-22 05:05:50,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:05:50,889 INFO L204 MainTranslator]: Completed translation [2024-11-22 05:05:50,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50 WrapperNode [2024-11-22 05:05:50,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 05:05:50,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 05:05:50,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 05:05:50,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 05:05:50,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:50,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:50,951 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 250 [2024-11-22 05:05:50,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 05:05:50,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 05:05:50,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 05:05:50,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 05:05:50,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:50,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:50,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:50,996 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-22 05:05:50,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:50,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:51,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:51,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:51,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:51,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:51,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 05:05:51,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 05:05:51,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 05:05:51,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 05:05:51,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (1/1) ... [2024-11-22 05:05:51,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:05:51,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:05:51,058 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-22 05:05:51,061 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-22 05:05:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 05:05:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 05:05:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 05:05:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 05:05:51,193 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 05:05:51,194 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 05:05:51,411 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-22 05:05:51,411 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 05:05:51,420 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 05:05:51,420 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 05:05:51,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:05:51 BoogieIcfgContainer [2024-11-22 05:05:51,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 05:05:51,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 05:05:51,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 05:05:51,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 05:05:51,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:05:50" (1/3) ... [2024-11-22 05:05:51,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a24606e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:05:51, skipping insertion in model container [2024-11-22 05:05:51,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:05:50" (2/3) ... [2024-11-22 05:05:51,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a24606e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:05:51, skipping insertion in model container [2024-11-22 05:05:51,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:05:51" (3/3) ... [2024-11-22 05:05:51,428 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v1.c [2024-11-22 05:05:51,442 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 05:05:51,443 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 05:05:51,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 05:05:51,493 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;@6e9d7996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 05:05:51,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 05:05:51,496 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-22 05:05:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 05:05:51,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:05:51,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 05:05:51,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:05:51,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:05:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-22 05:05:51,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:05:51,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606147902] [2024-11-22 05:05:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:05:51,524 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-22 05:05:51,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:05:51,527 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-22 05:05:51,528 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-22 05:05:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:05:51,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 05:05:51,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:05:51,823 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-22 05:05:51,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 05:05:51,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:05:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606147902] [2024-11-22 05:05:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606147902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:05:51,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:05:51,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:05:51,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190838647] [2024-11-22 05:05:51,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:05:51,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:05:51,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:05:51,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:05:51,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:05:51,851 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-22 05:05:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:05:51,874 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-22 05:05:51,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:05:51,876 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-22 05:05:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:05:51,881 INFO L225 Difference]: With dead ends: 17 [2024-11-22 05:05:51,881 INFO L226 Difference]: Without dead ends: 9 [2024-11-22 05:05:51,883 INFO L431 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-22 05:05:51,885 INFO L432 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-22 05:05:51,886 INFO L433 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-22 05:05:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-22 05:05:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-22 05:05:51,906 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-22 05:05:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-22 05:05:51,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-22 05:05:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:05:51,908 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-22 05:05:51,908 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-22 05:05:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-22 05:05:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 05:05:51,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:05:51,909 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-22 05:05:51,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 05:05:52,109 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-22 05:05:52,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:05:52,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:05:52,111 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-22 05:05:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:05:52,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076049062] [2024-11-22 05:05:52,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:05:52,112 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-22 05:05:52,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:05:52,115 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-22 05:05:52,116 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-22 05:05:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:05:52,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 05:05:52,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:05:52,384 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-22 05:05:52,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:05:54,695 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-22 05:05:54,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:05:54,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076049062] [2024-11-22 05:05:54,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076049062] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:05:54,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 05:05:54,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 05:05:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096442135] [2024-11-22 05:05:54,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 05:05:54,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 05:05:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:05:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 05:05:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 05:05:54,699 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-22 05:05:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:05:55,042 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-22 05:05:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 05:05:55,043 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-22 05:05:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:05:55,044 INFO L225 Difference]: With dead ends: 14 [2024-11-22 05:05:55,044 INFO L226 Difference]: Without dead ends: 12 [2024-11-22 05:05:55,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-22 05:05:55,045 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:05:55,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:05:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-22 05:05:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-22 05:05:55,048 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-22 05:05:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-22 05:05:55,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-22 05:05:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:05:55,048 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-22 05:05:55,049 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-22 05:05:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-22 05:05:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 05:05:55,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:05:55,049 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-22 05:05:55,053 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-22 05:05:55,249 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-22 05:05:55,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:05:55,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:05:55,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-22 05:05:55,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:05:55,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610671218] [2024-11-22 05:05:55,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 05:05:55,252 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-22 05:05:55,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:05:55,256 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-22 05:05:55,257 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-22 05:05:55,351 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 05:05:55,352 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:05:55,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 05:05:55,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:05:56,975 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-22 05:05:56,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:06:08,426 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse1 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_16|))))))))) (.cse7 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_16|))))))))) (.cse8 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_31~0#1|))) .cse23)))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_26~0#1|)))) (.cse17 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_29~0#1|))) (let ((.cse0 (not .cse17)) (.cse3 (bvneg .cse9)) (.cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_40~0#1|)))))) (.cse6 (not .cse8)) (.cse11 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_24~0#1|)) (.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_22~0#1|)) (.cse13 (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_10~0#1|))))) (let ((.cse21 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_28~0#1|))) .cse23)) (_ bv0 8))) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) .cse18)))) (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvmul .cse18 (_ bv2 32)))))))) .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse20)))))) .cse21 .cse7) .cse1 (or (not .cse21) (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 (bvneg .cse18)))))))) .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse20)))))) .cse7)))))) (and (or .cse0 (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse11) .cse12))))))))) (and .cse1 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 .cse3))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse4)))))) .cse6 .cse7) (or .cse8 .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 .cse9))))))) .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse10)))))))))) (or .cse0 .cse13) (or (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse12))))))))) (and .cse1 (or .cse8 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 .cse9))))))) .cse15))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse15)))))) .cse7) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 .cse3))))))) .cse16))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse16)))))) .cse6 .cse7))) .cse17) (or .cse17 .cse13))))) is different from false [2024-11-22 05:06:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-22 05:06:12,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:06:12,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610671218] [2024-11-22 05:06:12,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610671218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:06:12,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 05:06:12,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-22 05:06:12,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370863083] [2024-11-22 05:06:12,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 05:06:12,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 05:06:12,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:06:12,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 05:06:12,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-22 05:06:12,888 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-22 05:06:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:06:20,522 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-22 05:06:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 05:06:20,523 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-22 05:06:20,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:06:20,524 INFO L225 Difference]: With dead ends: 17 [2024-11-22 05:06:20,524 INFO L226 Difference]: Without dead ends: 15 [2024-11-22 05:06:20,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=55, Invalid=130, Unknown=1, NotChecked=24, Total=210 [2024-11-22 05:06:20,525 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 05:06:20,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 8 Unchecked, 0.8s Time] [2024-11-22 05:06:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-22 05:06:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-22 05:06:20,529 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-22 05:06:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-22 05:06:20,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-22 05:06:20,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:06:20,529 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-22 05:06:20,530 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-22 05:06:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-22 05:06:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 05:06:20,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:06:20,530 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-22 05:06:20,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 05:06:20,731 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-22 05:06:20,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:06:20,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:06:20,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-22 05:06:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:06:20,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882128870] [2024-11-22 05:06:20,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 05:06:20,736 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-22 05:06:20,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:06:20,739 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-22 05:06:20,741 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-22 05:06:20,917 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-22 05:06:20,917 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:06:20,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-22 05:06:20,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:07:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:07:12,664 INFO L311 TraceCheckSpWp]: Computing backward predicates...