./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.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 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:57:52,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:57:52,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:57:52,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:57:52,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:57:52,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:57:52,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:57:52,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:57:52,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:57:52,955 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:57:52,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:57:52,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:57:52,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:57:52,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:57:52,959 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:57:52,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:57:52,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:57:52,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:57:52,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:57:52,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:57:52,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:57:52,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:57:52,964 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:57:52,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:57:52,965 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:57:52,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:57:52,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:57:52,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:57:52,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:57:52,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:57:52,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:57:52,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:57:52,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:57:52,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:57:52,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:57:52,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:57:52,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:57:52,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:57:52,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:57:52,968 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 -> 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 [2024-11-12 00:57:53,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:57:53,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:57:53,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:57:53,262 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:57:53,263 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:57:53,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2024-11-12 00:57:54,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:57:55,003 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:57:55,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2024-11-12 00:57:55,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeedfdb66/7c09898cbeb243149ce7c331133b65d6/FLAGefe75827a [2024-11-12 00:57:55,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeedfdb66/7c09898cbeb243149ce7c331133b65d6 [2024-11-12 00:57:55,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:57:55,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:57:55,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:57:55,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:57:55,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:57:55,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:55,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55221c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55, skipping insertion in model container [2024-11-12 00:57:55,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:55,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:57:55,316 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.vis_arrays_vsaR_p13.c[1259,1272] [2024-11-12 00:57:55,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:57:55,606 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:57:55,617 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.vis_arrays_vsaR_p13.c[1259,1272] [2024-11-12 00:57:55,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:57:55,785 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:57:55,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55 WrapperNode [2024-11-12 00:57:55,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:57:55,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:57:55,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:57:55,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:57:55,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:55,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:56,152 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2160 [2024-11-12 00:57:56,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:57:56,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:57:56,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:57:56,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:57:56,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:56,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:56,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:56,345 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-12 00:57:56,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:56,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:56,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:56,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:56,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:56,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:56,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:57:56,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:57:56,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:57:56,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:57:56,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (1/1) ... [2024-11-12 00:57:56,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:57:56,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:57:56,583 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-12 00:57:56,587 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-12 00:57:56,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:57:56,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:57:56,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:57:56,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:57:56,954 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:57:56,956 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:57:59,111 INFO L? ?]: Removed 1352 outVars from TransFormulas that were not future-live. [2024-11-12 00:57:59,111 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:57:59,135 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:57:59,136 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:57:59,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:59 BoogieIcfgContainer [2024-11-12 00:57:59,136 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:57:59,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:57:59,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:57:59,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:57:59,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:57:55" (1/3) ... [2024-11-12 00:57:59,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493320b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:59, skipping insertion in model container [2024-11-12 00:57:59,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:55" (2/3) ... [2024-11-12 00:57:59,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493320b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:59, skipping insertion in model container [2024-11-12 00:57:59,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:59" (3/3) ... [2024-11-12 00:57:59,149 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p13.c [2024-11-12 00:57:59,166 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:57:59,166 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:57:59,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:57:59,246 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;@3ccbc473, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:57:59,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:57:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 547 states, 545 states have (on average 1.4990825688073395) internal successors, (817), 546 states have internal predecessors, (817), 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-12 00:57:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 00:57:59,263 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:59,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:59,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:59,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1728403634, now seen corresponding path program 1 times [2024-11-12 00:57:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:59,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134397855] [2024-11-12 00:57:59,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:59,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:59,961 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-12 00:57:59,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:59,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134397855] [2024-11-12 00:57:59,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134397855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:59,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:59,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:57:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372991127] [2024-11-12 00:57:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:59,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:57:59,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:59,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:57:59,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:00,001 INFO L87 Difference]: Start difference. First operand has 547 states, 545 states have (on average 1.4990825688073395) internal successors, (817), 546 states have internal predecessors, (817), 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 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-12 00:58:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:00,159 INFO L93 Difference]: Finished difference Result 1039 states and 1555 transitions. [2024-11-12 00:58:00,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:58:00,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 45 [2024-11-12 00:58:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:00,183 INFO L225 Difference]: With dead ends: 1039 [2024-11-12 00:58:00,183 INFO L226 Difference]: Without dead ends: 546 [2024-11-12 00:58:00,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:00,195 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 0 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2427 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-12 00:58:00,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2427 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:58:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-12 00:58:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2024-11-12 00:58:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.4954128440366972) internal successors, (815), 545 states have internal predecessors, (815), 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-12 00:58:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 815 transitions. [2024-11-12 00:58:00,276 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 815 transitions. Word has length 45 [2024-11-12 00:58:00,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:00,276 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 815 transitions. [2024-11-12 00:58:00,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-12 00:58:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 815 transitions. [2024-11-12 00:58:00,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-12 00:58:00,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:00,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:00,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:58:00,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:00,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2042600515, now seen corresponding path program 1 times [2024-11-12 00:58:00,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:00,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488130394] [2024-11-12 00:58:00,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:00,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:00,525 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-12 00:58:00,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:00,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488130394] [2024-11-12 00:58:00,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488130394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:00,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:00,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:58:00,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369890512] [2024-11-12 00:58:00,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:00,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:58:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:00,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:58:00,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:00,529 INFO L87 Difference]: Start difference. First operand 546 states and 815 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-12 00:58:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:00,576 INFO L93 Difference]: Finished difference Result 1040 states and 1553 transitions. [2024-11-12 00:58:00,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:58:00,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2024-11-12 00:58:00,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:00,580 INFO L225 Difference]: With dead ends: 1040 [2024-11-12 00:58:00,581 INFO L226 Difference]: Without dead ends: 548 [2024-11-12 00:58:00,582 INFO L434 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-12 00:58:00,584 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 0 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2423 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-12 00:58:00,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2423 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:58:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-12 00:58:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2024-11-12 00:58:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.493601462522852) internal successors, (817), 547 states have internal predecessors, (817), 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-12 00:58:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 817 transitions. [2024-11-12 00:58:00,609 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 817 transitions. Word has length 46 [2024-11-12 00:58:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:00,609 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 817 transitions. [2024-11-12 00:58:00,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-12 00:58:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 817 transitions. [2024-11-12 00:58:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 00:58:00,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:00,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:00,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:58:00,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:00,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2093108139, now seen corresponding path program 1 times [2024-11-12 00:58:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:00,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992588810] [2024-11-12 00:58:00,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:01,166 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-12 00:58:01,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:01,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992588810] [2024-11-12 00:58:01,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992588810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:01,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:01,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:58:01,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206972524] [2024-11-12 00:58:01,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:01,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:58:01,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:01,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:58:01,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:58:01,170 INFO L87 Difference]: Start difference. First operand 548 states and 817 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-12 00:58:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:01,261 INFO L93 Difference]: Finished difference Result 1048 states and 1563 transitions. [2024-11-12 00:58:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:58:01,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 47 [2024-11-12 00:58:01,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:01,264 INFO L225 Difference]: With dead ends: 1048 [2024-11-12 00:58:01,264 INFO L226 Difference]: Without dead ends: 554 [2024-11-12 00:58:01,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:58:01,269 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 2 mSDsluCounter, 3211 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4017 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:01,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4017 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:58:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-12 00:58:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 553. [2024-11-12 00:58:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.4927536231884058) internal successors, (824), 552 states have internal predecessors, (824), 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-12 00:58:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 824 transitions. [2024-11-12 00:58:01,287 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 824 transitions. Word has length 47 [2024-11-12 00:58:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:01,288 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 824 transitions. [2024-11-12 00:58:01,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-12 00:58:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 824 transitions. [2024-11-12 00:58:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 00:58:01,290 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:01,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:01,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:58:01,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:01,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1515900049, now seen corresponding path program 1 times [2024-11-12 00:58:01,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:01,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781562920] [2024-11-12 00:58:01,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:01,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:01,493 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-12 00:58:01,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:01,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781562920] [2024-11-12 00:58:01,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781562920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:01,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:01,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:58:01,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142581675] [2024-11-12 00:58:01,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:01,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:58:01,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:01,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:58:01,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:01,498 INFO L87 Difference]: Start difference. First operand 553 states and 824 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-12 00:58:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:01,536 INFO L93 Difference]: Finished difference Result 1054 states and 1571 transitions. [2024-11-12 00:58:01,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:58:01,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2024-11-12 00:58:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:01,540 INFO L225 Difference]: With dead ends: 1054 [2024-11-12 00:58:01,541 INFO L226 Difference]: Without dead ends: 555 [2024-11-12 00:58:01,543 INFO L434 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-12 00:58:01,544 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 0 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2423 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-12 00:58:01,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2423 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:58:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-12 00:58:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-12 00:58:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.4909747292418774) internal successors, (826), 554 states have internal predecessors, (826), 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-12 00:58:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 826 transitions. [2024-11-12 00:58:01,556 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 826 transitions. Word has length 48 [2024-11-12 00:58:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:01,557 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 826 transitions. [2024-11-12 00:58:01,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-12 00:58:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 826 transitions. [2024-11-12 00:58:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 00:58:01,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:01,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:01,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:58:01,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:01,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:01,563 INFO L85 PathProgramCache]: Analyzing trace with hash -137698584, now seen corresponding path program 1 times [2024-11-12 00:58:01,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:01,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573389723] [2024-11-12 00:58:01,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:01,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:02,133 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-12 00:58:02,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:02,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573389723] [2024-11-12 00:58:02,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573389723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:02,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:02,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:58:02,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654411347] [2024-11-12 00:58:02,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:02,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:58:02,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:02,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:58:02,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:58:02,140 INFO L87 Difference]: Start difference. First operand 555 states and 826 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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-12 00:58:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:02,322 INFO L93 Difference]: Finished difference Result 1063 states and 1581 transitions. [2024-11-12 00:58:02,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:58:02,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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 49 [2024-11-12 00:58:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:02,325 INFO L225 Difference]: With dead ends: 1063 [2024-11-12 00:58:02,326 INFO L226 Difference]: Without dead ends: 562 [2024-11-12 00:58:02,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:58:02,329 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 786 mSDsluCounter, 3992 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 4793 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:02,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 4793 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:58:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-12 00:58:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 559. [2024-11-12 00:58:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.489247311827957) internal successors, (831), 558 states have internal predecessors, (831), 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-12 00:58:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 831 transitions. [2024-11-12 00:58:02,340 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 831 transitions. Word has length 49 [2024-11-12 00:58:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:02,340 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 831 transitions. [2024-11-12 00:58:02,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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-12 00:58:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 831 transitions. [2024-11-12 00:58:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 00:58:02,341 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:02,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:02,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:58:02,342 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:02,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:02,342 INFO L85 PathProgramCache]: Analyzing trace with hash 533266500, now seen corresponding path program 1 times [2024-11-12 00:58:02,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:02,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443544702] [2024-11-12 00:58:02,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:02,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:02,537 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-12 00:58:02,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:02,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443544702] [2024-11-12 00:58:02,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443544702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:02,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:02,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:58:02,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045391058] [2024-11-12 00:58:02,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:02,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:58:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:02,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:58:02,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:02,541 INFO L87 Difference]: Start difference. First operand 559 states and 831 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-12 00:58:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:02,583 INFO L93 Difference]: Finished difference Result 1066 states and 1585 transitions. [2024-11-12 00:58:02,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:58:02,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2024-11-12 00:58:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:02,586 INFO L225 Difference]: With dead ends: 1066 [2024-11-12 00:58:02,586 INFO L226 Difference]: Without dead ends: 561 [2024-11-12 00:58:02,587 INFO L434 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-12 00:58:02,588 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 0 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2423 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-12 00:58:02,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2423 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:58:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-12 00:58:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2024-11-12 00:58:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 1.4875) internal successors, (833), 560 states have internal predecessors, (833), 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-12 00:58:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 833 transitions. [2024-11-12 00:58:02,601 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 833 transitions. Word has length 49 [2024-11-12 00:58:02,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:02,602 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 833 transitions. [2024-11-12 00:58:02,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-12 00:58:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 833 transitions. [2024-11-12 00:58:02,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 00:58:02,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:02,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:02,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:58:02,608 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:02,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:02,609 INFO L85 PathProgramCache]: Analyzing trace with hash -781062024, now seen corresponding path program 1 times [2024-11-12 00:58:02,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:02,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211187629] [2024-11-12 00:58:02,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:02,785 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-12 00:58:02,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:02,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211187629] [2024-11-12 00:58:02,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211187629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:02,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:02,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:58:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051596694] [2024-11-12 00:58:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:02,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:58:02,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:02,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:58:02,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:58:02,788 INFO L87 Difference]: Start difference. First operand 561 states and 833 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-12 00:58:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:02,898 INFO L93 Difference]: Finished difference Result 1178 states and 1743 transitions. [2024-11-12 00:58:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:58:02,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 50 [2024-11-12 00:58:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:02,901 INFO L225 Difference]: With dead ends: 1178 [2024-11-12 00:58:02,902 INFO L226 Difference]: Without dead ends: 671 [2024-11-12 00:58:02,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:58:02,903 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 1076 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 3204 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:02,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 3204 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:58:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-11-12 00:58:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 569. [2024-11-12 00:58:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.4876760563380282) internal successors, (845), 568 states have internal predecessors, (845), 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-12 00:58:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 845 transitions. [2024-11-12 00:58:02,913 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 845 transitions. Word has length 50 [2024-11-12 00:58:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:02,914 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 845 transitions. [2024-11-12 00:58:02,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-12 00:58:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 845 transitions. [2024-11-12 00:58:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 00:58:02,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:02,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:02,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:58:02,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:02,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:02,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1590856553, now seen corresponding path program 1 times [2024-11-12 00:58:02,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:02,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841135521] [2024-11-12 00:58:02,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:02,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:58:03,004 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 00:58:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:58:03,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 00:58:03,127 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 00:58:03,128 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 00:58:03,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 00:58:03,134 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:03,202 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 00:58:03,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:58:03 BoogieIcfgContainer [2024-11-12 00:58:03,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 00:58:03,206 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 00:58:03,206 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 00:58:03,206 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 00:58:03,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:59" (3/4) ... [2024-11-12 00:58:03,209 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 00:58:03,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 00:58:03,211 INFO L158 Benchmark]: Toolchain (without parser) took 8175.12ms. Allocated memory was 169.9MB in the beginning and 429.9MB in the end (delta: 260.0MB). Free memory was 137.3MB in the beginning and 317.7MB in the end (delta: -180.4MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2024-11-12 00:58:03,211 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:58:03,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 749.67ms. Allocated memory is still 169.9MB. Free memory was 137.3MB in the beginning and 89.5MB in the end (delta: 47.8MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-12 00:58:03,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 366.10ms. Allocated memory is still 169.9MB. Free memory was 89.5MB in the beginning and 109.6MB in the end (delta: -20.0MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2024-11-12 00:58:03,212 INFO L158 Benchmark]: Boogie Preprocessor took 391.47ms. Allocated memory is still 169.9MB. Free memory was 109.6MB in the beginning and 86.8MB in the end (delta: 22.8MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-11-12 00:58:03,212 INFO L158 Benchmark]: RCFGBuilder took 2590.39ms. Allocated memory was 169.9MB in the beginning and 339.7MB in the end (delta: 169.9MB). Free memory was 86.2MB in the beginning and 232.3MB in the end (delta: -146.2MB). Peak memory consumption was 101.6MB. Max. memory is 16.1GB. [2024-11-12 00:58:03,212 INFO L158 Benchmark]: TraceAbstraction took 4063.70ms. Allocated memory was 339.7MB in the beginning and 429.9MB in the end (delta: 90.2MB). Free memory was 231.3MB in the beginning and 317.7MB in the end (delta: -86.5MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-12 00:58:03,212 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 429.9MB. Free memory is still 317.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:58:03,214 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.20ms. Allocated memory is still 117.4MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 749.67ms. Allocated memory is still 169.9MB. Free memory was 137.3MB in the beginning and 89.5MB in the end (delta: 47.8MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 366.10ms. Allocated memory is still 169.9MB. Free memory was 89.5MB in the beginning and 109.6MB in the end (delta: -20.0MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 391.47ms. Allocated memory is still 169.9MB. Free memory was 109.6MB in the beginning and 86.8MB in the end (delta: 22.8MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2590.39ms. Allocated memory was 169.9MB in the beginning and 339.7MB in the end (delta: 169.9MB). Free memory was 86.2MB in the beginning and 232.3MB in the end (delta: -146.2MB). Peak memory consumption was 101.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4063.70ms. Allocated memory was 339.7MB in the beginning and 429.9MB in the end (delta: 90.2MB). Free memory was 231.3MB in the beginning and 317.7MB in the end (delta: -86.5MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 429.9MB. Free memory is still 317.7MB. 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 bitwiseOr at line 177, overapproximation of bitwiseAnd at line 182. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_80 mask_SORT_80 = (SORT_80)-1 >> (sizeof(SORT_80) * 8 - 32); [L39] const SORT_80 msb_SORT_80 = (SORT_80)1 << (32 - 1); [L41] const SORT_91 mask_SORT_91 = (SORT_91)-1 >> (sizeof(SORT_91) * 8 - 4); [L42] const SORT_91 msb_SORT_91 = (SORT_91)1 << (4 - 1); [L44] const SORT_176 mask_SORT_176 = (SORT_176)-1 >> (sizeof(SORT_176) * 8 - 2); [L45] const SORT_176 msb_SORT_176 = (SORT_176)1 << (2 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_5 var_12 = 0; [L49] const SORT_7 var_16 = 2; [L50] const SORT_1 var_19 = 0; [L51] const SORT_3 var_23 = 0; [L52] const SORT_1 var_39 = 1; [L53] const SORT_7 var_59 = 1; [L54] const SORT_7 var_64 = 4; [L55] const SORT_7 var_66 = 5; [L56] const SORT_7 var_70 = 3; [L57] const SORT_80 var_82 = 0; [L58] const SORT_7 var_108 = 7; [L59] const SORT_7 var_113 = 6; [L60] const SORT_3 var_140 = 2; [L61] const SORT_3 var_185 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_173; [L67] SORT_3 input_174; [L68] SORT_3 input_175; [L69] SORT_3 input_184; [L70] SORT_3 input_194; [L71] SORT_3 input_195; [L72] SORT_3 input_196; [L73] SORT_3 input_199; [L74] SORT_3 input_218; [L75] SORT_3 input_219; [L76] SORT_3 input_220; [L77] SORT_3 input_223; [L78] SORT_3 input_225; [L79] SORT_176 input_239; [L80] SORT_176 input_240; [L81] SORT_176 input_241; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L83] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L84] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L84] SORT_5 state_13 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L85] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L86] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L87] SORT_3 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L88] SORT_3 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L89] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L90] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L91] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L92] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L93] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L94] SORT_3 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, var_108=7, var_113=6, var_12=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L95] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_7 init_10_arg_1 = var_8; [L98] state_9 = init_10_arg_1 [L99] SORT_5 init_14_arg_1 = var_12; [L100] state_13 = init_14_arg_1 [L101] SORT_1 init_21_arg_1 = var_19; [L102] state_20 = init_21_arg_1 [L103] SORT_3 init_25_arg_1 = var_23; [L104] state_24 = init_25_arg_1 [L105] SORT_3 init_27_arg_1 = var_23; [L106] state_26 = init_27_arg_1 [L107] SORT_3 init_33_arg_1 = var_23; [L108] state_32 = init_33_arg_1 [L109] SORT_3 init_44_arg_1 = var_23; [L110] state_43 = init_44_arg_1 [L111] SORT_3 init_46_arg_1 = var_23; [L112] state_45 = init_46_arg_1 [L113] SORT_3 init_48_arg_1 = var_23; [L114] state_47 = init_48_arg_1 [L115] SORT_3 init_50_arg_1 = var_23; [L116] state_49 = init_50_arg_1 [L117] SORT_3 init_52_arg_1 = var_23; [L118] state_51 = init_52_arg_1 [L119] SORT_3 init_54_arg_1 = var_23; [L120] state_53 = init_54_arg_1 [L121] SORT_3 init_56_arg_1 = var_23; [L122] state_55 = init_56_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_173 = __VERIFIER_nondet_uchar() [L129] input_174 = __VERIFIER_nondet_uchar() [L130] input_175 = __VERIFIER_nondet_uchar() [L131] input_184 = __VERIFIER_nondet_uchar() [L132] input_194 = __VERIFIER_nondet_uchar() [L133] input_195 = __VERIFIER_nondet_uchar() [L134] input_196 = __VERIFIER_nondet_uchar() [L135] input_199 = __VERIFIER_nondet_uchar() [L136] input_218 = __VERIFIER_nondet_uchar() [L137] input_219 = __VERIFIER_nondet_uchar() [L138] input_220 = __VERIFIER_nondet_uchar() [L139] input_223 = __VERIFIER_nondet_uchar() [L140] input_225 = __VERIFIER_nondet_uchar() [L141] input_239 = __VERIFIER_nondet_uchar() [L142] input_240 = __VERIFIER_nondet_uchar() [L143] input_241 = __VERIFIER_nondet_uchar() [L146] SORT_7 var_11_arg_0 = state_9; [L147] SORT_1 var_11 = var_11_arg_0 >> 2; [L148] SORT_5 var_15_arg_0 = state_13; [L149] SORT_7 var_15 = var_15_arg_0 >> 9; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_11=0, var_140=2, var_15=0, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L150] EXPR var_15 & mask_SORT_7 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_11=0, var_140=2, var_16=2, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L150] var_15 = var_15 & mask_SORT_7 [L151] SORT_7 var_17_arg_0 = var_15; [L152] SORT_7 var_17_arg_1 = var_16; [L153] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L154] SORT_1 var_18_arg_0 = var_11; [L155] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_18_arg_0=0, var_18_arg_1=0, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L156] EXPR var_18_arg_0 & var_18_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L156] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L157] SORT_1 var_22_arg_0 = var_18; [L158] SORT_1 var_22_arg_1 = state_20; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_22_arg_0=0, var_22_arg_1=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L159] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L159] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L160] SORT_3 var_28_arg_0 = state_24; [L161] SORT_3 var_28_arg_1 = state_26; [L162] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L163] SORT_1 var_29_arg_0 = var_28; [L164] SORT_1 var_29 = ~var_29_arg_0; [L165] SORT_1 var_30_arg_0 = var_22; [L166] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_30_arg_0=0, var_30_arg_1=-2, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L167] EXPR var_30_arg_0 & var_30_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L167] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L168] SORT_1 var_31_arg_0 = var_30; [L169] SORT_1 var_31 = ~var_31_arg_0; [L170] SORT_3 var_34_arg_0 = state_32; [L171] SORT_3 var_34_arg_1 = state_26; [L172] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L173] SORT_1 var_35_arg_0 = var_34; [L174] SORT_1 var_35 = ~var_35_arg_0; [L175] SORT_1 var_36_arg_0 = var_31; [L176] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_36_arg_0=-1, var_36_arg_1=-2, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L177] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L177] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L178] SORT_1 var_40_arg_0 = var_36; [L179] SORT_1 var_40 = ~var_40_arg_0; [L180] SORT_1 var_41_arg_0 = var_39; [L181] SORT_1 var_41_arg_1 = var_40; VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_41_arg_0=1, var_41_arg_1=-1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L182] EXPR var_41_arg_0 & var_41_arg_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L182] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L183] EXPR var_41 & mask_SORT_1 VAL [mask_SORT_176=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_91=15, state_13=0, state_20=0, state_24=0, state_26=0, state_32=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_9=0, var_108=7, var_113=6, var_140=2, var_15=0, var_16=2, var_17=0, var_185=31, var_19=0, var_23=0, var_39=1, var_59=1, var_64=4, var_66=5, var_70=3, var_82=0, var_8=0] [L183] var_41 = var_41 & mask_SORT_1 [L184] SORT_1 bad_42_arg_0 = var_41; [L185] CALL __VERIFIER_assert(!(bad_42_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 547 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1864 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1864 mSDsluCounter, 21710 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16055 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 5655 mSDtfsCounter, 247 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=569occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 106 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-12 00:58:03,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.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 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:58:05,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:58:05,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-12 00:58:05,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:58:05,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:58:05,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:58:05,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:58:05,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:58:05,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:58:05,590 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:58:05,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:58:05,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:58:05,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:58:05,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:58:05,592 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:58:05,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:58:05,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:58:05,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:58:05,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:58:05,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:58:05,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:58:05,598 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 00:58:05,598 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 00:58:05,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:58:05,599 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 00:58:05,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:58:05,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:58:05,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:58:05,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:58:05,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:58:05,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:58:05,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:58:05,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:58:05,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:58:05,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:58:05,601 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 00:58:05,602 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 00:58:05,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:58:05,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:58:05,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:58:05,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:58:05,604 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 -> 07c94e5cd3bc71d2316ee023f3c3de7a743ac154d633131bf7b85324be3bb818 [2024-11-12 00:58:05,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:58:05,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:58:05,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:58:05,966 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:58:05,966 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:58:05,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2024-11-12 00:58:07,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:58:07,783 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:58:07,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p13.c [2024-11-12 00:58:07,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e084d738d/8081e49ebd43467cb4658ca203ca08ed/FLAGdc9105f0d [2024-11-12 00:58:08,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e084d738d/8081e49ebd43467cb4658ca203ca08ed [2024-11-12 00:58:08,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:58:08,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:58:08,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:58:08,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:58:08,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:58:08,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:08,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d27b306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08, skipping insertion in model container [2024-11-12 00:58:08,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:08,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:58:08,380 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.vis_arrays_vsaR_p13.c[1259,1272] [2024-11-12 00:58:08,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:58:08,662 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:58:08,691 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.vis_arrays_vsaR_p13.c[1259,1272] [2024-11-12 00:58:08,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:58:08,788 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:58:08,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08 WrapperNode [2024-11-12 00:58:08,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:58:08,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:58:08,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:58:08,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:58:08,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:08,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:08,902 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1086 [2024-11-12 00:58:08,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:58:08,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:58:08,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:58:08,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:58:08,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:08,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:08,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:08,981 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-12 00:58:08,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:08,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:09,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:09,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:09,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:09,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:09,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:58:09,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:58:09,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:58:09,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:58:09,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (1/1) ... [2024-11-12 00:58:09,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:58:09,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:58:09,104 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-12 00:58:09,107 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-12 00:58:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:58:09,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 00:58:09,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:58:09,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:58:09,480 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:58:09,482 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:58:10,851 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-12 00:58:10,852 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:58:10,863 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:58:10,864 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:58:10,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:58:10 BoogieIcfgContainer [2024-11-12 00:58:10,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:58:10,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:58:10,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:58:10,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:58:10,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:58:08" (1/3) ... [2024-11-12 00:58:10,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5703ed05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:58:10, skipping insertion in model container [2024-11-12 00:58:10,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:08" (2/3) ... [2024-11-12 00:58:10,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5703ed05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:58:10, skipping insertion in model container [2024-11-12 00:58:10,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:58:10" (3/3) ... [2024-11-12 00:58:10,874 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p13.c [2024-11-12 00:58:10,891 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:58:10,892 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:58:10,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:58:10,947 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;@3caaa7a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:58:10,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:58:10,951 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-12 00:58:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 00:58:10,956 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:10,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 00:58:10,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:10,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:10,961 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-12 00:58:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:58:10,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250903610] [2024-11-12 00:58:10,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:10,974 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-12 00:58:10,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:58:10,977 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-12 00:58:10,978 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-12 00:58:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:11,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 00:58:11,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:58:11,510 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-12 00:58:11,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:58:11,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:58:11,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250903610] [2024-11-12 00:58:11,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250903610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:11,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:11,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:58:11,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292952869] [2024-11-12 00:58:11,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:11,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:58:11,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:58:11,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:58:11,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:11,547 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-12 00:58:11,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:11,636 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-12 00:58:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:58:11,638 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-12 00:58:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:11,645 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:58:11,645 INFO L226 Difference]: Without dead ends: 10 [2024-11-12 00:58:11,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:58:11,652 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:11,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:58:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-12 00:58:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-12 00:58:11,680 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-12 00:58:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-12 00:58:11,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-12 00:58:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:11,682 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-12 00:58:11,682 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-12 00:58:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-12 00:58:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 00:58:11,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:11,684 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:11,688 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-12 00:58:11,887 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-12 00:58:11,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:11,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-12 00:58:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:58:11,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200247163] [2024-11-12 00:58:11,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:11,890 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-12 00:58:11,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:58:11,892 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-12 00:58:11,914 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-12 00:58:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:12,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 00:58:12,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:58:12,681 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-12 00:58:12,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:58:13,331 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-12 00:58:13,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:58:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200247163] [2024-11-12 00:58:13,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200247163] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:58:13,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:58:13,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 00:58:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420847954] [2024-11-12 00:58:13,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:58:13,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:58:13,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:58:13,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:58:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:58:13,335 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-12 00:58:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:13,495 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-12 00:58:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:58:13,496 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-12 00:58:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:13,497 INFO L225 Difference]: With dead ends: 15 [2024-11-12 00:58:13,497 INFO L226 Difference]: Without dead ends: 13 [2024-11-12 00:58:13,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:58:13,499 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:13,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 16 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:58:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-12 00:58:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-12 00:58:13,505 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-12 00:58:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-12 00:58:13,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-12 00:58:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:13,507 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-12 00:58:13,507 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-12 00:58:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-12 00:58:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 00:58:13,508 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:13,508 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-12 00:58:13,515 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-12 00:58:13,712 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-12 00:58:13,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:13,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:13,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-12 00:58:13,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:58:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86242259] [2024-11-12 00:58:13,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 00:58:13,715 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-12 00:58:13,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:58:13,719 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-12 00:58:13,720 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-12 00:58:14,255 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 00:58:14,255 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:58:14,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 00:58:14,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:58:14,456 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-12 00:58:14,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:58:20,176 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-12 00:58:20,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:58:20,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86242259] [2024-11-12 00:58:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86242259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:58:20,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:58:20,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-12 00:58:20,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64294657] [2024-11-12 00:58:20,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:58:20,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 00:58:20,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:58:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 00:58:20,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=63, Unknown=1, NotChecked=0, Total=90 [2024-11-12 00:58:20,180 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-12 00:58:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:21,693 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-12 00:58:21,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 00:58:21,694 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-12 00:58:21,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:21,694 INFO L225 Difference]: With dead ends: 21 [2024-11-12 00:58:21,695 INFO L226 Difference]: Without dead ends: 19 [2024-11-12 00:58:21,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=67, Invalid=142, Unknown=1, NotChecked=0, Total=210 [2024-11-12 00:58:21,696 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:21,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 00:58:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-12 00:58:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-12 00:58:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-12 00:58:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-12 00:58:21,704 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2024-11-12 00:58:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:21,705 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-12 00:58:21,705 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-12 00:58:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-12 00:58:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 00:58:21,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:21,706 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-12 00:58:21,714 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-12 00:58:21,906 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-12 00:58:21,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:21,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:21,908 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 3 times [2024-11-12 00:58:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:58:21,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608382771] [2024-11-12 00:58:21,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 00:58:21,910 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-12 00:58:21,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:58:21,913 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-12 00:58:21,914 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-12 00:58:22,524 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-12 00:58:22,524 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:58:22,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-12 00:58:22,560 INFO L279 TraceCheckSpWp]: Computing forward predicates...