./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.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 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:11:14,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:11:14,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-20 02:11:14,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:11:14,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:11:14,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:11:14,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:11:14,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:11:14,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:11:14,474 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:11:14,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:11:14,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:11:14,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:11:14,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:11:14,477 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:11:14,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:11:14,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:11:14,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:11:14,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:11:14,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:11:14,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:11:14,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:11:14,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:11:14,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:11:14,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:11:14,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:11:14,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:11:14,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:11:14,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:11:14,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:11:14,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:11:14,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:11:14,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:11:14,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:11:14,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:11:14,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:11:14,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:11:14,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:11:14,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:11:14,488 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 -> 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 [2024-11-20 02:11:14,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:11:14,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:11:14,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:11:14,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:11:14,816 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:11:14,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-11-20 02:11:16,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:11:16,554 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:11:16,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-11-20 02:11:16,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a96c30b/1298fc4f28ea47ea8f573fc3b328a9e0/FLAG53224d6a8 [2024-11-20 02:11:16,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a96c30b/1298fc4f28ea47ea8f573fc3b328a9e0 [2024-11-20 02:11:16,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:11:16,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:11:16,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:11:16,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:11:16,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:11:16,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:11:16" (1/1) ... [2024-11-20 02:11:16,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f4635e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:16, skipping insertion in model container [2024-11-20 02:11:16,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:11:16" (1/1) ... [2024-11-20 02:11:16,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:11:17,155 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_p14.c[1259,1272] [2024-11-20 02:11:17,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:11:17,421 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:11:17,432 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_p14.c[1259,1272] [2024-11-20 02:11:17,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:11:17,577 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:11:17,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17 WrapperNode [2024-11-20 02:11:17,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:11:17,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:11:17,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:11:17,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:11:17,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (1/1) ... [2024-11-20 02:11:17,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (1/1) ... [2024-11-20 02:11:17,882 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2137 [2024-11-20 02:11:17,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:11:17,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:11:17,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:11:17,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:11:17,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (1/1) ... [2024-11-20 02:11:17,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (1/1) ... [2024-11-20 02:11:17,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (1/1) ... [2024-11-20 02:11:18,074 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-20 02:11:18,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (1/1) ... [2024-11-20 02:11:18,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (1/1) ... [2024-11-20 02:11:18,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (1/1) ... [2024-11-20 02:11:18,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (1/1) ... [2024-11-20 02:11:18,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (1/1) ... [2024-11-20 02:11:18,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (1/1) ... [2024-11-20 02:11:18,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:11:18,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:11:18,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:11:18,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:11:18,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (1/1) ... [2024-11-20 02:11:18,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:11:18,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:11:18,291 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-20 02:11:18,298 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-20 02:11:18,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:11:18,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:11:18,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:11:18,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:11:18,738 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:11:18,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:11:20,990 INFO L? ?]: Removed 1339 outVars from TransFormulas that were not future-live. [2024-11-20 02:11:20,991 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:11:21,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:11:21,026 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:11:21,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:11:21 BoogieIcfgContainer [2024-11-20 02:11:21,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:11:21,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:11:21,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:11:21,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:11:21,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:11:16" (1/3) ... [2024-11-20 02:11:21,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d34c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:11:21, skipping insertion in model container [2024-11-20 02:11:21,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:17" (2/3) ... [2024-11-20 02:11:21,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d34c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:11:21, skipping insertion in model container [2024-11-20 02:11:21,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:11:21" (3/3) ... [2024-11-20 02:11:21,037 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-11-20 02:11:21,055 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:11:21,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:11:21,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:11:21,144 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;@74ad8fa9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:11:21,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:11:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 539 states, 537 states have (on average 1.499068901303538) internal successors, (805), 538 states have internal predecessors, (805), 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-20 02:11:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-20 02:11:21,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:21,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:11:21,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:21,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash -905463032, now seen corresponding path program 1 times [2024-11-20 02:11:21,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:11:21,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916245466] [2024-11-20 02:11:21,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:11:21,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:11:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:11:21,904 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-20 02:11:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:11:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916245466] [2024-11-20 02:11:21,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916245466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:11:21,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:11:21,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:11:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349996773] [2024-11-20 02:11:21,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:11:21,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:11:21,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:11:21,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:11:21,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:11:21,935 INFO L87 Difference]: Start difference. First operand has 539 states, 537 states have (on average 1.499068901303538) internal successors, (805), 538 states have internal predecessors, (805), 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 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-20 02:11:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:11:22,031 INFO L93 Difference]: Finished difference Result 1023 states and 1531 transitions. [2024-11-20 02:11:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:11:22,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2024-11-20 02:11:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:11:22,053 INFO L225 Difference]: With dead ends: 1023 [2024-11-20 02:11:22,053 INFO L226 Difference]: Without dead ends: 538 [2024-11-20 02:11:22,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:11:22,063 INFO L432 NwaCegarLoop]: 799 mSDtfsCounter, 0 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2391 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-20 02:11:22,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2391 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:11:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-20 02:11:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2024-11-20 02:11:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.495344506517691) internal successors, (803), 537 states have internal predecessors, (803), 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-20 02:11:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 803 transitions. [2024-11-20 02:11:22,155 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 803 transitions. Word has length 43 [2024-11-20 02:11:22,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:11:22,156 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 803 transitions. [2024-11-20 02:11:22,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-20 02:11:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 803 transitions. [2024-11-20 02:11:22,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-20 02:11:22,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:22,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:11:22,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:11:22,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:22,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:22,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1997112480, now seen corresponding path program 1 times [2024-11-20 02:11:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:11:22,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085247544] [2024-11-20 02:11:22,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:11:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:11:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:11:22,391 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-20 02:11:22,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:11:22,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085247544] [2024-11-20 02:11:22,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085247544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:11:22,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:11:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:11:22,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38141707] [2024-11-20 02:11:22,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:11:22,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:11:22,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:11:22,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:11:22,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:11:22,397 INFO L87 Difference]: Start difference. First operand 538 states and 803 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-20 02:11:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:11:22,464 INFO L93 Difference]: Finished difference Result 1024 states and 1529 transitions. [2024-11-20 02:11:22,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:11:22,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2024-11-20 02:11:22,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:11:22,468 INFO L225 Difference]: With dead ends: 1024 [2024-11-20 02:11:22,470 INFO L226 Difference]: Without dead ends: 540 [2024-11-20 02:11:22,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:11:22,474 INFO L432 NwaCegarLoop]: 799 mSDtfsCounter, 0 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2387 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-20 02:11:22,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2387 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:11:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-20 02:11:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2024-11-20 02:11:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.4935064935064934) internal successors, (805), 539 states have internal predecessors, (805), 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-20 02:11:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 805 transitions. [2024-11-20 02:11:22,495 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 805 transitions. Word has length 44 [2024-11-20 02:11:22,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:11:22,496 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 805 transitions. [2024-11-20 02:11:22,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-20 02:11:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 805 transitions. [2024-11-20 02:11:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-20 02:11:22,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:22,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:11:22,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:11:22,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:22,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:22,499 INFO L85 PathProgramCache]: Analyzing trace with hash 682979041, now seen corresponding path program 1 times [2024-11-20 02:11:22,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:11:22,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625962780] [2024-11-20 02:11:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:11:22,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:11:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:11:22,913 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-20 02:11:22,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:11:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625962780] [2024-11-20 02:11:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625962780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:11:22,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:11:22,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:11:22,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247094984] [2024-11-20 02:11:22,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:11:22,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:11:22,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:11:22,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:11:22,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:11:22,921 INFO L87 Difference]: Start difference. First operand 540 states and 805 transitions. 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-20 02:11:22,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:11:22,962 INFO L93 Difference]: Finished difference Result 1030 states and 1536 transitions. [2024-11-20 02:11:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:11:22,963 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-20 02:11:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:11:22,965 INFO L225 Difference]: With dead ends: 1030 [2024-11-20 02:11:22,965 INFO L226 Difference]: Without dead ends: 544 [2024-11-20 02:11:22,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:11:22,969 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 2 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:11:22,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2381 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:11:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-20 02:11:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 542. [2024-11-20 02:11:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.4916820702402958) internal successors, (807), 541 states have internal predecessors, (807), 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-20 02:11:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2024-11-20 02:11:22,989 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 45 [2024-11-20 02:11:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:11:22,989 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2024-11-20 02:11:22,989 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-20 02:11:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2024-11-20 02:11:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-20 02:11:22,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:22,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:11:22,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:11:22,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:22,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:22,993 INFO L85 PathProgramCache]: Analyzing trace with hash 606400839, now seen corresponding path program 1 times [2024-11-20 02:11:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:11:22,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433665051] [2024-11-20 02:11:22,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:11:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:11:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:11:23,273 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-20 02:11:23,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:11:23,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433665051] [2024-11-20 02:11:23,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433665051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:11:23,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:11:23,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 02:11:23,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529953308] [2024-11-20 02:11:23,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:11:23,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 02:11:23,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:11:23,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 02:11:23,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:11:23,277 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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-20 02:11:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:11:23,355 INFO L93 Difference]: Finished difference Result 1034 states and 1540 transitions. [2024-11-20 02:11:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 02:11:23,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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-20 02:11:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:11:23,359 INFO L225 Difference]: With dead ends: 1034 [2024-11-20 02:11:23,359 INFO L226 Difference]: Without dead ends: 546 [2024-11-20 02:11:23,360 INFO L431 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-20 02:11:23,364 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 1 mSDsluCounter, 3165 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3960 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:11:23,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3960 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:11:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-20 02:11:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 545. [2024-11-20 02:11:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4908088235294117) internal successors, (811), 544 states have internal predecessors, (811), 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-20 02:11:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 811 transitions. [2024-11-20 02:11:23,376 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 811 transitions. Word has length 46 [2024-11-20 02:11:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:11:23,377 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 811 transitions. [2024-11-20 02:11:23,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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-20 02:11:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 811 transitions. [2024-11-20 02:11:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-20 02:11:23,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:23,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:11:23,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:11:23,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:23,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash 751570958, now seen corresponding path program 1 times [2024-11-20 02:11:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:11:23,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51776095] [2024-11-20 02:11:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:11:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:11:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:11:23,805 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-20 02:11:23,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:11:23,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51776095] [2024-11-20 02:11:23,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51776095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:11:23,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:11:23,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 02:11:23,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017814873] [2024-11-20 02:11:23,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:11:23,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:11:23,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:11:23,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:11:23,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:11:23,809 INFO L87 Difference]: Start difference. First operand 545 states and 811 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-20 02:11:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:11:24,084 INFO L93 Difference]: Finished difference Result 1106 states and 1641 transitions. [2024-11-20 02:11:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 02:11:24,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-20 02:11:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:11:24,088 INFO L225 Difference]: With dead ends: 1106 [2024-11-20 02:11:24,088 INFO L226 Difference]: Without dead ends: 615 [2024-11-20 02:11:24,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-20 02:11:24,090 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 950 mSDsluCounter, 3917 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 4700 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:11:24,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 4700 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:11:24,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-20 02:11:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 554. [2024-11-20 02:11:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.4900542495479205) internal successors, (824), 553 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-20 02:11:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 824 transitions. [2024-11-20 02:11:24,102 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 824 transitions. Word has length 46 [2024-11-20 02:11:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:11:24,102 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 824 transitions. [2024-11-20 02:11:24,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-20 02:11:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 824 transitions. [2024-11-20 02:11:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-20 02:11:24,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:24,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:11:24,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:11:24,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:24,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:24,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1686098854, now seen corresponding path program 1 times [2024-11-20 02:11:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:11:24,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558756170] [2024-11-20 02:11:24,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:11:24,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:11:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:11:24,284 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-20 02:11:24,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:11:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558756170] [2024-11-20 02:11:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558756170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:11:24,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:11:24,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:11:24,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2574299] [2024-11-20 02:11:24,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:11:24,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:11:24,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:11:24,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:11:24,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:11:24,286 INFO L87 Difference]: Start difference. First operand 554 states and 824 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-20 02:11:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:11:24,381 INFO L93 Difference]: Finished difference Result 1105 states and 1639 transitions. [2024-11-20 02:11:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:11:24,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-20 02:11:24,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:11:24,385 INFO L225 Difference]: With dead ends: 1105 [2024-11-20 02:11:24,386 INFO L226 Difference]: Without dead ends: 614 [2024-11-20 02:11:24,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:11:24,391 INFO L432 NwaCegarLoop]: 789 mSDtfsCounter, 936 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:11:24,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 2367 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:11:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-20 02:11:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 555. [2024-11-20 02:11:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.4891696750902528) internal successors, (825), 554 states have internal predecessors, (825), 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-20 02:11:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 825 transitions. [2024-11-20 02:11:24,404 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 825 transitions. Word has length 47 [2024-11-20 02:11:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:11:24,404 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 825 transitions. [2024-11-20 02:11:24,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-20 02:11:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 825 transitions. [2024-11-20 02:11:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-20 02:11:24,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:24,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:11:24,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 02:11:24,406 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:24,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:24,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1937903358, now seen corresponding path program 1 times [2024-11-20 02:11:24,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:11:24,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837423375] [2024-11-20 02:11:24,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:11:24,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:11:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:11:25,033 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-20 02:11:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:11:25,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837423375] [2024-11-20 02:11:25,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837423375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:11:25,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:11:25,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 02:11:25,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311867808] [2024-11-20 02:11:25,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:11:25,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:11:25,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:11:25,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:11:25,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:11:25,036 INFO L87 Difference]: Start difference. First operand 555 states and 825 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 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-20 02:11:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:11:25,159 INFO L93 Difference]: Finished difference Result 1051 states and 1563 transitions. [2024-11-20 02:11:25,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 02:11:25,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 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-20 02:11:25,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:11:25,162 INFO L225 Difference]: With dead ends: 1051 [2024-11-20 02:11:25,162 INFO L226 Difference]: Without dead ends: 560 [2024-11-20 02:11:25,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:11:25,164 INFO L432 NwaCegarLoop]: 789 mSDtfsCounter, 773 mSDsluCounter, 3930 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 4719 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:11:25,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 4719 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:11:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-20 02:11:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 559. [2024-11-20 02:11:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.4874551971326164) internal successors, (830), 558 states have internal predecessors, (830), 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-20 02:11:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 830 transitions. [2024-11-20 02:11:25,174 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 830 transitions. Word has length 47 [2024-11-20 02:11:25,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:11:25,174 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 830 transitions. [2024-11-20 02:11:25,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 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-20 02:11:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 830 transitions. [2024-11-20 02:11:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-20 02:11:25,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:25,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:11:25,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 02:11:25,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:25,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:25,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1029798754, now seen corresponding path program 1 times [2024-11-20 02:11:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:11:25,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51392275] [2024-11-20 02:11:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:11:25,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:11:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:11:25,436 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-20 02:11:25,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:11:25,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51392275] [2024-11-20 02:11:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51392275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:11:25,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:11:25,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 02:11:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851326531] [2024-11-20 02:11:25,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:11:25,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 02:11:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:11:25,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 02:11:25,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:11:25,439 INFO L87 Difference]: Start difference. First operand 559 states and 830 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-20 02:11:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:11:25,615 INFO L93 Difference]: Finished difference Result 1241 states and 1839 transitions. [2024-11-20 02:11:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 02:11:25,616 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-20 02:11:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:11:25,619 INFO L225 Difference]: With dead ends: 1241 [2024-11-20 02:11:25,620 INFO L226 Difference]: Without dead ends: 745 [2024-11-20 02:11:25,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:11:25,621 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 1332 mSDsluCounter, 2339 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:11:25,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 3121 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:11:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-20 02:11:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 559. [2024-11-20 02:11:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.485663082437276) internal successors, (829), 558 states have internal predecessors, (829), 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-20 02:11:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 829 transitions. [2024-11-20 02:11:25,637 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 829 transitions. Word has length 47 [2024-11-20 02:11:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:11:25,637 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 829 transitions. [2024-11-20 02:11:25,637 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-20 02:11:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 829 transitions. [2024-11-20 02:11:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-20 02:11:25,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:25,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:11:25,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 02:11:25,639 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:25,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:25,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1510007302, now seen corresponding path program 1 times [2024-11-20 02:11:25,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:11:25,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052141752] [2024-11-20 02:11:25,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:11:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:11:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:11:25,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:11:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:11:25,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:11:25,793 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:11:25,794 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:11:25,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 02:11:25,799 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:11:25,870 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:11:25,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:11:25 BoogieIcfgContainer [2024-11-20 02:11:25,876 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:11:25,877 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:11:25,877 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:11:25,877 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:11:25,878 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:11:21" (3/4) ... [2024-11-20 02:11:25,881 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:11:25,882 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:11:25,883 INFO L158 Benchmark]: Toolchain (without parser) took 9012.29ms. Allocated memory was 186.6MB in the beginning and 486.5MB in the end (delta: 299.9MB). Free memory was 146.6MB in the beginning and 387.8MB in the end (delta: -241.1MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-11-20 02:11:25,883 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 186.6MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:11:25,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 705.83ms. Allocated memory is still 186.6MB. Free memory was 146.4MB in the beginning and 110.3MB in the end (delta: 36.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-20 02:11:25,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 302.91ms. Allocated memory is still 186.6MB. Free memory was 110.3MB in the beginning and 117.2MB in the end (delta: -6.9MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2024-11-20 02:11:25,885 INFO L158 Benchmark]: Boogie Preprocessor took 370.70ms. Allocated memory was 186.6MB in the beginning and 247.5MB in the end (delta: 60.8MB). Free memory was 117.2MB in the beginning and 172.0MB in the end (delta: -54.8MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2024-11-20 02:11:25,885 INFO L158 Benchmark]: RCFGBuilder took 2773.08ms. Allocated memory was 247.5MB in the beginning and 404.8MB in the end (delta: 157.3MB). Free memory was 172.0MB in the beginning and 320.4MB in the end (delta: -148.4MB). Peak memory consumption was 131.7MB. Max. memory is 16.1GB. [2024-11-20 02:11:25,886 INFO L158 Benchmark]: TraceAbstraction took 4846.13ms. Allocated memory was 404.8MB in the beginning and 486.5MB in the end (delta: 81.8MB). Free memory was 319.3MB in the beginning and 387.8MB in the end (delta: -68.5MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-11-20 02:11:25,886 INFO L158 Benchmark]: Witness Printer took 5.61ms. Allocated memory is still 486.5MB. Free memory is still 387.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:11:25,887 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 186.6MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 705.83ms. Allocated memory is still 186.6MB. Free memory was 146.4MB in the beginning and 110.3MB in the end (delta: 36.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 302.91ms. Allocated memory is still 186.6MB. Free memory was 110.3MB in the beginning and 117.2MB in the end (delta: -6.9MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 370.70ms. Allocated memory was 186.6MB in the beginning and 247.5MB in the end (delta: 60.8MB). Free memory was 117.2MB in the beginning and 172.0MB in the end (delta: -54.8MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2773.08ms. Allocated memory was 247.5MB in the beginning and 404.8MB in the end (delta: 157.3MB). Free memory was 172.0MB in the beginning and 320.4MB in the end (delta: -148.4MB). Peak memory consumption was 131.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4846.13ms. Allocated memory was 404.8MB in the beginning and 486.5MB in the end (delta: 81.8MB). Free memory was 319.3MB in the beginning and 387.8MB in the end (delta: -68.5MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Witness Printer took 5.61ms. Allocated memory is still 486.5MB. Free memory is still 387.8MB. 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 171, overapproximation of bitwiseAnd at line 176. 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_78 mask_SORT_78 = (SORT_78)-1 >> (sizeof(SORT_78) * 8 - 32); [L39] const SORT_78 msb_SORT_78 = (SORT_78)1 << (32 - 1); [L41] const SORT_107 mask_SORT_107 = (SORT_107)-1 >> (sizeof(SORT_107) * 8 - 4); [L42] const SORT_107 msb_SORT_107 = (SORT_107)1 << (4 - 1); [L44] const SORT_174 mask_SORT_174 = (SORT_174)-1 >> (sizeof(SORT_174) * 8 - 2); [L45] const SORT_174 msb_SORT_174 = (SORT_174)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_26 = 0; [L52] const SORT_1 var_35 = 1; [L53] const SORT_7 var_57 = 1; [L54] const SORT_7 var_62 = 4; [L55] const SORT_7 var_64 = 5; [L56] const SORT_7 var_68 = 3; [L57] const SORT_78 var_80 = 0; [L58] const SORT_3 var_94 = 2; [L59] const SORT_7 var_124 = 7; [L60] const SORT_7 var_129 = 6; [L61] const SORT_3 var_183 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_171; [L67] SORT_3 input_172; [L68] SORT_3 input_173; [L69] SORT_3 input_182; [L70] SORT_3 input_192; [L71] SORT_3 input_193; [L72] SORT_3 input_194; [L73] SORT_3 input_197; [L74] SORT_3 input_216; [L75] SORT_3 input_217; [L76] SORT_3 input_218; [L77] SORT_3 input_221; [L78] SORT_3 input_223; [L79] SORT_174 input_237; [L80] SORT_174 input_238; [L81] SORT_174 input_239; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L83] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L84] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L84] SORT_5 state_13 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L85] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L86] SORT_3 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L87] SORT_3 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L88] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L89] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L90] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L91] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L92] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L93] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L94] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L95] SORT_3 state_53 = __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_28_arg_1 = var_26; [L104] state_27 = init_28_arg_1 [L105] SORT_3 init_30_arg_1 = var_26; [L106] state_29 = init_30_arg_1 [L107] SORT_3 init_40_arg_1 = var_26; [L108] state_39 = init_40_arg_1 [L109] SORT_3 init_42_arg_1 = var_26; [L110] state_41 = init_42_arg_1 [L111] SORT_3 init_44_arg_1 = var_26; [L112] state_43 = init_44_arg_1 [L113] SORT_3 init_46_arg_1 = var_26; [L114] state_45 = init_46_arg_1 [L115] SORT_3 init_48_arg_1 = var_26; [L116] state_47 = init_48_arg_1 [L117] SORT_3 init_50_arg_1 = var_26; [L118] state_49 = init_50_arg_1 [L119] SORT_3 init_52_arg_1 = var_26; [L120] state_51 = init_52_arg_1 [L121] SORT_3 init_54_arg_1 = var_26; [L122] state_53 = init_54_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_171 = __VERIFIER_nondet_uchar() [L129] input_172 = __VERIFIER_nondet_uchar() [L130] input_173 = __VERIFIER_nondet_uchar() [L131] input_182 = __VERIFIER_nondet_uchar() [L132] input_192 = __VERIFIER_nondet_uchar() [L133] input_193 = __VERIFIER_nondet_uchar() [L134] input_194 = __VERIFIER_nondet_uchar() [L135] input_197 = __VERIFIER_nondet_uchar() [L136] input_216 = __VERIFIER_nondet_uchar() [L137] input_217 = __VERIFIER_nondet_uchar() [L138] input_218 = __VERIFIER_nondet_uchar() [L139] input_221 = __VERIFIER_nondet_uchar() [L140] input_223 = __VERIFIER_nondet_uchar() [L141] input_237 = __VERIFIER_nondet_uchar() [L142] input_238 = __VERIFIER_nondet_uchar() [L143] input_239 = __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_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_15=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L150] EXPR var_15 & mask_SORT_7 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [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_17; [L155] SORT_1 var_18 = ~var_18_arg_0; [L156] SORT_1 var_22_arg_0 = state_20; [L157] SORT_1 var_22 = ~var_22_arg_0; [L158] SORT_1 var_23_arg_0 = var_18; [L159] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_23_arg_0=-1, var_23_arg_1=-1, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L160] EXPR var_23_arg_0 | var_23_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L160] SORT_1 var_23 = var_23_arg_0 | var_23_arg_1; [L161] SORT_1 var_24_arg_0 = var_11; [L162] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_24_arg_0=0, var_24_arg_1=255, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L163] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L163] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L164] SORT_1 var_25_arg_0 = var_24; [L165] SORT_1 var_25 = ~var_25_arg_0; [L166] SORT_3 var_31_arg_0 = state_27; [L167] SORT_3 var_31_arg_1 = state_29; [L168] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L169] SORT_1 var_32_arg_0 = var_25; [L170] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_32_arg_0=-1, var_32_arg_1=1, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L171] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L171] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L172] SORT_1 var_36_arg_0 = var_32; [L173] SORT_1 var_36 = ~var_36_arg_0; [L174] SORT_1 var_37_arg_0 = var_35; [L175] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_37_arg_0=1, var_37_arg_1=-1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L176] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L176] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L177] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L177] var_37 = var_37 & mask_SORT_1 [L178] SORT_1 bad_38_arg_0 = var_37; [L179] CALL __VERIFIER_assert(!(bad_38_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 539 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3994 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3994 mSDsluCounter, 26026 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19694 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 402 IncrementalHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 6332 mSDtfsCounter, 402 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=559occurred in iteration=7, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 310 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 357 ConstructedInterpolants, 0 QuantifiedInterpolants, 828 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-20 02:11:25,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.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 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:11:28,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:11:28,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-20 02:11:28,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:11:28,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:11:28,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:11:28,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:11:28,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:11:28,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:11:28,312 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:11:28,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:11:28,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:11:28,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:11:28,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:11:28,314 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:11:28,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:11:28,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:11:28,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:11:28,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:11:28,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:11:28,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:11:28,318 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:11:28,319 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:11:28,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:11:28,319 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:11:28,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:11:28,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:11:28,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:11:28,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:11:28,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:11:28,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:11:28,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:11:28,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:11:28,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:11:28,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:11:28,322 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:11:28,322 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:11:28,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:11:28,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:11:28,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:11:28,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:11:28,325 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 -> 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 [2024-11-20 02:11:28,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:11:28,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:11:28,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:11:28,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:11:28,683 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:11:28,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-11-20 02:11:30,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:11:30,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:11:30,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-11-20 02:11:30,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a91e4084b/50d8acc056d94be8a7d2e5eb94353ae9/FLAG2f3cad3ba [2024-11-20 02:11:30,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a91e4084b/50d8acc056d94be8a7d2e5eb94353ae9 [2024-11-20 02:11:30,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:11:30,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:11:30,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:11:30,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:11:30,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:11:30,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:11:30" (1/1) ... [2024-11-20 02:11:30,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4fbe88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:30, skipping insertion in model container [2024-11-20 02:11:30,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:11:30" (1/1) ... [2024-11-20 02:11:30,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:11:30,896 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_p14.c[1259,1272] [2024-11-20 02:11:31,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:11:31,204 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:11:31,216 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_p14.c[1259,1272] [2024-11-20 02:11:31,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:11:31,325 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:11:31,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31 WrapperNode [2024-11-20 02:11:31,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:11:31,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:11:31,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:11:31,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:11:31,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (1/1) ... [2024-11-20 02:11:31,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (1/1) ... [2024-11-20 02:11:31,469 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1079 [2024-11-20 02:11:31,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:11:31,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:11:31,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:11:31,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:11:31,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (1/1) ... [2024-11-20 02:11:31,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (1/1) ... [2024-11-20 02:11:31,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (1/1) ... [2024-11-20 02:11:31,542 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-20 02:11:31,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (1/1) ... [2024-11-20 02:11:31,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (1/1) ... [2024-11-20 02:11:31,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (1/1) ... [2024-11-20 02:11:31,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (1/1) ... [2024-11-20 02:11:31,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (1/1) ... [2024-11-20 02:11:31,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (1/1) ... [2024-11-20 02:11:31,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:11:31,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:11:31,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:11:31,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:11:31,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (1/1) ... [2024-11-20 02:11:31,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:11:31,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:11:31,649 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-20 02:11:31,651 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-20 02:11:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:11:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:11:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:11:31,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:11:31,938 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:11:31,940 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:11:33,493 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-20 02:11:33,494 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:11:33,508 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:11:33,508 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:11:33,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:11:33 BoogieIcfgContainer [2024-11-20 02:11:33,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:11:33,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:11:33,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:11:33,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:11:33,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:11:30" (1/3) ... [2024-11-20 02:11:33,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127e6e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:11:33, skipping insertion in model container [2024-11-20 02:11:33,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:11:31" (2/3) ... [2024-11-20 02:11:33,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127e6e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:11:33, skipping insertion in model container [2024-11-20 02:11:33,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:11:33" (3/3) ... [2024-11-20 02:11:33,518 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-11-20 02:11:33,535 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:11:33,535 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:11:33,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:11:33,600 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;@13ce86dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:11:33,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:11:33,605 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-20 02:11:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 02:11:33,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:33,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 02:11:33,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:33,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:33,619 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-20 02:11:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:11:33,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499156512] [2024-11-20 02:11:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:11:33,633 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-20 02:11:33,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:11:33,637 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-20 02:11:33,639 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-20 02:11:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:11:33,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 02:11:33,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:11:34,090 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-20 02:11:34,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:11:34,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:11:34,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499156512] [2024-11-20 02:11:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499156512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:11:34,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:11:34,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:11:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731972845] [2024-11-20 02:11:34,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:11:34,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:11:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:11:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:11:34,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:11:34,127 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-20 02:11:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:11:34,205 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-20 02:11:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:11:34,208 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-20 02:11:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:11:34,214 INFO L225 Difference]: With dead ends: 18 [2024-11-20 02:11:34,215 INFO L226 Difference]: Without dead ends: 10 [2024-11-20 02:11:34,217 INFO L431 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-20 02:11:34,221 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:11:34,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:11:34,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-20 02:11:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-20 02:11:34,250 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-20 02:11:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-20 02:11:34,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-20 02:11:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:11:34,252 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-20 02:11:34,253 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-20 02:11:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-20 02:11:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 02:11:34,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:34,254 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-20 02:11:34,258 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-20 02:11:34,456 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-20 02:11:34,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:34,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-20 02:11:34,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:11:34,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621007438] [2024-11-20 02:11:34,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:11:34,460 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-20 02:11:34,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:11:34,461 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-20 02:11:34,462 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-20 02:11:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:11:34,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 02:11:34,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:11:35,080 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-20 02:11:35,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:11:35,329 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-20 02:11:35,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:11:35,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621007438] [2024-11-20 02:11:35,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621007438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:11:35,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:11:35,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 02:11:35,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506776341] [2024-11-20 02:11:35,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:11:35,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:11:35,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:11:35,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:11:35,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:11:35,333 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-20 02:11:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:11:35,640 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-20 02:11:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 02:11:35,640 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-20 02:11:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:11:35,641 INFO L225 Difference]: With dead ends: 18 [2024-11-20 02:11:35,641 INFO L226 Difference]: Without dead ends: 16 [2024-11-20 02:11:35,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-20 02:11:35,643 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:11:35,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:11:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-20 02:11:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-20 02:11:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 02:11:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-20 02:11:35,649 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-20 02:11:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:11:35,649 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-20 02:11:35,649 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-20 02:11:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-20 02:11:35,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 02:11:35,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:35,650 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-20 02:11:35,657 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-20 02:11:35,851 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-20 02:11:35,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:35,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-20 02:11:35,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:11:35,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740751942] [2024-11-20 02:11:35,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 02:11:35,854 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-20 02:11:35,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:11:35,859 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-20 02:11:35,860 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-20 02:11:36,703 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 02:11:36,703 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 02:11:36,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 02:11:36,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:11:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:11:37,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:11:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 02:11:38,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:11:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740751942] [2024-11-20 02:11:38,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740751942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:11:38,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:11:38,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-20 02:11:38,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876220681] [2024-11-20 02:11:38,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:11:38,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 02:11:38,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:11:38,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 02:11:38,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-20 02:11:38,125 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-20 02:11:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:11:39,364 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-20 02:11:39,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 02:11:39,364 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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 14 [2024-11-20 02:11:39,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:11:39,365 INFO L225 Difference]: With dead ends: 32 [2024-11-20 02:11:39,365 INFO L226 Difference]: Without dead ends: 30 [2024-11-20 02:11:39,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-20 02:11:39,367 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:11:39,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 02:11:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-20 02:11:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-11-20 02:11:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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-20 02:11:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-20 02:11:39,378 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 14 [2024-11-20 02:11:39,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:11:39,378 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-20 02:11:39,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-20 02:11:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-20 02:11:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 02:11:39,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:11:39,379 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-20 02:11:39,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 02:11:39,579 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-20 02:11:39,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:11:39,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:11:39,581 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 3 times [2024-11-20 02:11:39,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:11:39,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612146807] [2024-11-20 02:11:39,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 02:11:39,583 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-20 02:11:39,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:11:39,586 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-20 02:11:39,587 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-20 02:11:40,198 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-20 02:11:40,198 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 02:11:40,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-20 02:11:40,244 INFO L278 TraceCheckSpWp]: Computing forward predicates...