./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.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 ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:04:31,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:04:31,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 03:04:31,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:04:31,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:04:31,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:04:31,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:04:31,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:04:31,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:04:31,522 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:04:31,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:04:31,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:04:31,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:04:31,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:04:31,523 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:04:31,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:04:31,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:04:31,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:04:31,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:04:31,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:04:31,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:04:31,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:04:31,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:04:31,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:04:31,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:04:31,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:04:31,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:04:31,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:04:31,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:04:31,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:04:31,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:04:31,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:04:31,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:04:31,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:04:31,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:04:31,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:04:31,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:04:31,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:04:31,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:04:31,532 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 -> ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 [2024-11-10 03:04:31,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:04:31,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:04:31,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:04:31,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:04:31,824 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:04:31,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-11-10 03:04:33,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:04:33,531 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:04:33,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-11-10 03:04:33,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b812d1e4/632f551363ef44179c571d23e6f9ed6b/FLAGaa42f1177 [2024-11-10 03:04:33,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b812d1e4/632f551363ef44179c571d23e6f9ed6b [2024-11-10 03:04:33,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:04:33,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:04:33,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:04:33,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:04:33,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:04:33,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:04:33" (1/1) ... [2024-11-10 03:04:33,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b689642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:33, skipping insertion in model container [2024-11-10 03:04:33,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:04:33" (1/1) ... [2024-11-10 03:04:33,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:04:34,148 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_p11.c[1259,1272] [2024-11-10 03:04:34,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:04:34,397 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:04:34,407 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_p11.c[1259,1272] [2024-11-10 03:04:34,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:04:34,634 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:04:34,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34 WrapperNode [2024-11-10 03:04:34,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:04:34,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:04:34,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:04:34,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:04:34,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (1/1) ... [2024-11-10 03:04:34,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (1/1) ... [2024-11-10 03:04:34,880 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2172 [2024-11-10 03:04:34,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:04:34,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:04:34,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:04:34,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:04:34,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (1/1) ... [2024-11-10 03:04:34,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (1/1) ... [2024-11-10 03:04:34,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (1/1) ... [2024-11-10 03:04:35,008 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-10 03:04:35,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (1/1) ... [2024-11-10 03:04:35,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (1/1) ... [2024-11-10 03:04:35,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (1/1) ... [2024-11-10 03:04:35,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (1/1) ... [2024-11-10 03:04:35,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (1/1) ... [2024-11-10 03:04:35,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (1/1) ... [2024-11-10 03:04:35,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:04:35,234 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:04:35,235 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:04:35,235 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:04:35,236 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (1/1) ... [2024-11-10 03:04:35,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:04:35,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:04:35,277 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-10 03:04:35,281 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-10 03:04:35,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:04:35,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:04:35,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:04:35,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:04:35,648 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:04:35,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:04:37,743 INFO L? ?]: Removed 1359 outVars from TransFormulas that were not future-live. [2024-11-10 03:04:37,743 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:04:37,848 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:04:37,848 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:04:37,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:04:37 BoogieIcfgContainer [2024-11-10 03:04:37,849 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:04:37,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:04:37,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:04:37,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:04:37,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:04:33" (1/3) ... [2024-11-10 03:04:37,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b02774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:04:37, skipping insertion in model container [2024-11-10 03:04:37,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:34" (2/3) ... [2024-11-10 03:04:37,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b02774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:04:37, skipping insertion in model container [2024-11-10 03:04:37,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:04:37" (3/3) ... [2024-11-10 03:04:37,861 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-11-10 03:04:37,878 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:04:37,879 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:04:37,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:04:37,964 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;@23e1a444, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:04:37,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:04:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 554 states, 552 states have (on average 1.4963768115942029) internal successors, (826), 553 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 03:04:37,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:37,982 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, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:37,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:37,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash 699231502, now seen corresponding path program 1 times [2024-11-10 03:04:37,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:37,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538839999] [2024-11-10 03:04:37,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:38,755 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-10 03:04:38,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:38,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538839999] [2024-11-10 03:04:38,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538839999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:38,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:38,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:04:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284758617] [2024-11-10 03:04:38,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:38,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:04:38,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:38,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:04:38,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:04:38,796 INFO L87 Difference]: Start difference. First operand has 554 states, 552 states have (on average 1.4963768115942029) internal successors, (826), 553 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-10 03:04:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:39,189 INFO L93 Difference]: Finished difference Result 1051 states and 1571 transitions. [2024-11-10 03:04:39,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:04:39,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2024-11-10 03:04:39,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:39,210 INFO L225 Difference]: With dead ends: 1051 [2024-11-10 03:04:39,210 INFO L226 Difference]: Without dead ends: 551 [2024-11-10 03:04:39,215 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-10 03:04:39,218 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 0 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:39,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2044 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:04:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-10 03:04:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2024-11-10 03:04:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.4945454545454546) internal successors, (822), 550 states have internal predecessors, (822), 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-10 03:04:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 822 transitions. [2024-11-10 03:04:39,280 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 822 transitions. Word has length 54 [2024-11-10 03:04:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:39,281 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 822 transitions. [2024-11-10 03:04:39,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-10 03:04:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 822 transitions. [2024-11-10 03:04:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 03:04:39,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:39,283 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:39,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:04:39,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:39,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:39,285 INFO L85 PathProgramCache]: Analyzing trace with hash 346394238, now seen corresponding path program 1 times [2024-11-10 03:04:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553201394] [2024-11-10 03:04:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:39,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:39,598 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-10 03:04:39,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:39,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553201394] [2024-11-10 03:04:39,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553201394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:39,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:39,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:04:39,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808639025] [2024-11-10 03:04:39,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:39,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:04:39,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:39,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:04:39,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:04:39,605 INFO L87 Difference]: Start difference. First operand 551 states and 822 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10 03:04:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:39,932 INFO L93 Difference]: Finished difference Result 1050 states and 1567 transitions. [2024-11-10 03:04:39,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:04:39,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-11-10 03:04:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:39,936 INFO L225 Difference]: With dead ends: 1050 [2024-11-10 03:04:39,936 INFO L226 Difference]: Without dead ends: 553 [2024-11-10 03:04:39,937 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-10 03:04:39,939 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 0 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:39,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2041 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:04:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-10 03:04:39,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-10 03:04:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.4927536231884058) internal successors, (824), 552 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 824 transitions. [2024-11-10 03:04:39,956 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 824 transitions. Word has length 55 [2024-11-10 03:04:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:39,956 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 824 transitions. [2024-11-10 03:04:39,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10 03:04:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 824 transitions. [2024-11-10 03:04:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 03:04:39,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:39,958 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:39,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:04:39,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:39,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:39,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1895531123, now seen corresponding path program 1 times [2024-11-10 03:04:39,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:39,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332061253] [2024-11-10 03:04:39,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:40,580 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-10 03:04:40,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:40,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332061253] [2024-11-10 03:04:40,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332061253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:40,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:40,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:04:40,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321891468] [2024-11-10 03:04:40,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:40,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:04:40,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:40,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:04:40,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:04:40,584 INFO L87 Difference]: Start difference. First operand 553 states and 824 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-10 03:04:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:41,182 INFO L93 Difference]: Finished difference Result 1065 states and 1587 transitions. [2024-11-10 03:04:41,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:04:41,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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 56 [2024-11-10 03:04:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:41,187 INFO L225 Difference]: With dead ends: 1065 [2024-11-10 03:04:41,187 INFO L226 Difference]: Without dead ends: 566 [2024-11-10 03:04:41,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:04:41,190 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 10 mSDsluCounter, 3371 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4047 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:41,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4047 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 03:04:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-10 03:04:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 561. [2024-11-10 03:04:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 1.4910714285714286) internal successors, (835), 560 states have internal predecessors, (835), 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-10 03:04:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 835 transitions. [2024-11-10 03:04:41,224 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 835 transitions. Word has length 56 [2024-11-10 03:04:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:41,225 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 835 transitions. [2024-11-10 03:04:41,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-10 03:04:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 835 transitions. [2024-11-10 03:04:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 03:04:41,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:41,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:41,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:04:41,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:41,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:41,231 INFO L85 PathProgramCache]: Analyzing trace with hash 148021076, now seen corresponding path program 1 times [2024-11-10 03:04:41,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:41,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140104400] [2024-11-10 03:04:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:41,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:41,720 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-10 03:04:41,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:41,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140104400] [2024-11-10 03:04:41,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140104400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:41,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:41,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:04:41,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031016548] [2024-11-10 03:04:41,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:41,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:04:41,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:41,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:04:41,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:04:41,723 INFO L87 Difference]: Start difference. First operand 561 states and 835 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-10 03:04:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:42,301 INFO L93 Difference]: Finished difference Result 1076 states and 1602 transitions. [2024-11-10 03:04:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:04:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 57 [2024-11-10 03:04:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:42,304 INFO L225 Difference]: With dead ends: 1076 [2024-11-10 03:04:42,304 INFO L226 Difference]: Without dead ends: 569 [2024-11-10 03:04:42,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:04:42,307 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 783 mSDsluCounter, 3360 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 4036 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:42,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 4036 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 03:04:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-10 03:04:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2024-11-10 03:04:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.488495575221239) internal successors, (841), 565 states have internal predecessors, (841), 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-10 03:04:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 841 transitions. [2024-11-10 03:04:42,326 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 841 transitions. Word has length 57 [2024-11-10 03:04:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:42,328 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 841 transitions. [2024-11-10 03:04:42,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-10 03:04:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 841 transitions. [2024-11-10 03:04:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 03:04:42,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:42,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:42,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:04:42,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:42,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:42,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1336586137, now seen corresponding path program 1 times [2024-11-10 03:04:42,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:42,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653952671] [2024-11-10 03:04:42,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:42,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:42,682 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-10 03:04:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653952671] [2024-11-10 03:04:42,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653952671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:42,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:42,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:04:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436110827] [2024-11-10 03:04:42,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:42,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:04:42,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:42,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:04:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:04:42,688 INFO L87 Difference]: Start difference. First operand 566 states and 841 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-10 03:04:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:43,207 INFO L93 Difference]: Finished difference Result 1090 states and 1619 transitions. [2024-11-10 03:04:43,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:04:43,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 57 [2024-11-10 03:04:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:43,211 INFO L225 Difference]: With dead ends: 1090 [2024-11-10 03:04:43,213 INFO L226 Difference]: Without dead ends: 576 [2024-11-10 03:04:43,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:04:43,215 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 9 mSDsluCounter, 3377 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4055 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:43,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4055 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 03:04:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-10 03:04:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 573. [2024-11-10 03:04:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 1.4877622377622377) internal successors, (851), 572 states have internal predecessors, (851), 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-10 03:04:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 851 transitions. [2024-11-10 03:04:43,228 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 851 transitions. Word has length 57 [2024-11-10 03:04:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:43,229 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 851 transitions. [2024-11-10 03:04:43,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-10 03:04:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 851 transitions. [2024-11-10 03:04:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 03:04:43,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:43,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:43,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:04:43,233 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:43,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash 396437130, now seen corresponding path program 1 times [2024-11-10 03:04:43,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:43,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930244308] [2024-11-10 03:04:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:43,395 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-10 03:04:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:43,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930244308] [2024-11-10 03:04:43,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930244308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:43,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:43,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:04:43,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027290866] [2024-11-10 03:04:43,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:43,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:04:43,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:43,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:04:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:04:43,399 INFO L87 Difference]: Start difference. First operand 573 states and 851 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-10 03:04:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:43,716 INFO L93 Difference]: Finished difference Result 1102 states and 1637 transitions. [2024-11-10 03:04:43,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:04:43,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 57 [2024-11-10 03:04:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:43,724 INFO L225 Difference]: With dead ends: 1102 [2024-11-10 03:04:43,724 INFO L226 Difference]: Without dead ends: 583 [2024-11-10 03:04:43,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:04:43,726 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 8 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:43,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2718 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:04:43,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-10 03:04:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2024-11-10 03:04:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.486254295532646) internal successors, (865), 582 states have internal predecessors, (865), 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-10 03:04:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 865 transitions. [2024-11-10 03:04:43,738 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 865 transitions. Word has length 57 [2024-11-10 03:04:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:43,738 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 865 transitions. [2024-11-10 03:04:43,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-10 03:04:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 865 transitions. [2024-11-10 03:04:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 03:04:43,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:43,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:43,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:04:43,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:43,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:43,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1386483010, now seen corresponding path program 1 times [2024-11-10 03:04:43,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:43,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123098532] [2024-11-10 03:04:43,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:43,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:44,105 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-10 03:04:44,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123098532] [2024-11-10 03:04:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123098532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:44,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:44,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 03:04:44,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662227744] [2024-11-10 03:04:44,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:44,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 03:04:44,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:44,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 03:04:44,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:04:44,108 INFO L87 Difference]: Start difference. First operand 583 states and 865 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-10 03:04:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:44,552 INFO L93 Difference]: Finished difference Result 1114 states and 1653 transitions. [2024-11-10 03:04:44,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:04:44,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 58 [2024-11-10 03:04:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:44,556 INFO L225 Difference]: With dead ends: 1114 [2024-11-10 03:04:44,556 INFO L226 Difference]: Without dead ends: 585 [2024-11-10 03:04:44,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:04:44,560 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 790 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:44,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 2700 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:04:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-10 03:04:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2024-11-10 03:04:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4845890410958904) internal successors, (867), 584 states have internal predecessors, (867), 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-10 03:04:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 867 transitions. [2024-11-10 03:04:44,572 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 867 transitions. Word has length 58 [2024-11-10 03:04:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:44,572 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 867 transitions. [2024-11-10 03:04:44,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-10 03:04:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 867 transitions. [2024-11-10 03:04:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 03:04:44,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:44,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:44,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 03:04:44,575 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:44,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1657414694, now seen corresponding path program 1 times [2024-11-10 03:04:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:44,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236338610] [2024-11-10 03:04:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:44,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:45,230 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-10 03:04:45,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:45,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236338610] [2024-11-10 03:04:45,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236338610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:45,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 03:04:45,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077038346] [2024-11-10 03:04:45,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:45,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 03:04:45,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:45,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 03:04:45,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:04:45,234 INFO L87 Difference]: Start difference. First operand 585 states and 867 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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-10 03:04:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:46,109 INFO L93 Difference]: Finished difference Result 1126 states and 1667 transitions. [2024-11-10 03:04:46,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 03:04:46,110 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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 58 [2024-11-10 03:04:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:46,112 INFO L225 Difference]: With dead ends: 1126 [2024-11-10 03:04:46,113 INFO L226 Difference]: Without dead ends: 595 [2024-11-10 03:04:46,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:04:46,116 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 806 mSDsluCounter, 4675 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 5345 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:46,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 5345 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 03:04:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-10 03:04:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 591. [2024-11-10 03:04:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.4830508474576272) internal successors, (875), 590 states have internal predecessors, (875), 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-10 03:04:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 875 transitions. [2024-11-10 03:04:46,129 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 875 transitions. Word has length 58 [2024-11-10 03:04:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:46,129 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 875 transitions. [2024-11-10 03:04:46,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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-10 03:04:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 875 transitions. [2024-11-10 03:04:46,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 03:04:46,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:46,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:46,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 03:04:46,130 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:46,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:46,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1632472263, now seen corresponding path program 1 times [2024-11-10 03:04:46,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:46,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360004328] [2024-11-10 03:04:46,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:46,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:46,730 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-10 03:04:46,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:04:46,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360004328] [2024-11-10 03:04:46,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360004328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:46,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:46,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 03:04:46,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811958021] [2024-11-10 03:04:46,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:46,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 03:04:46,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:04:46,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 03:04:46,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:04:46,733 INFO L87 Difference]: Start difference. First operand 591 states and 875 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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-10 03:04:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:47,555 INFO L93 Difference]: Finished difference Result 1136 states and 1681 transitions. [2024-11-10 03:04:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 03:04:47,555 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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 59 [2024-11-10 03:04:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:47,558 INFO L225 Difference]: With dead ends: 1136 [2024-11-10 03:04:47,558 INFO L226 Difference]: Without dead ends: 599 [2024-11-10 03:04:47,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:04:47,563 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 800 mSDsluCounter, 4717 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 5394 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:47,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 5394 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 03:04:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-10 03:04:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 589. [2024-11-10 03:04:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.4846938775510203) internal successors, (873), 588 states have internal predecessors, (873), 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-10 03:04:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 873 transitions. [2024-11-10 03:04:47,577 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 873 transitions. Word has length 59 [2024-11-10 03:04:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:47,577 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 873 transitions. [2024-11-10 03:04:47,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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-10 03:04:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 873 transitions. [2024-11-10 03:04:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 03:04:47,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:47,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:47,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 03:04:47,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:47,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:47,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2046714472, now seen corresponding path program 1 times [2024-11-10 03:04:47,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:04:47,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021517877] [2024-11-10 03:04:47,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:47,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:04:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:04:47,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:04:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:04:47,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:04:47,751 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:04:47,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:04:47,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 03:04:47,758 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:47,840 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:04:47,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:04:47 BoogieIcfgContainer [2024-11-10 03:04:47,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:04:47,844 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:04:47,844 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:04:47,844 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:04:47,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:04:37" (3/4) ... [2024-11-10 03:04:47,847 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:04:47,848 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:04:47,849 INFO L158 Benchmark]: Toolchain (without parser) took 13987.21ms. Allocated memory was 186.6MB in the beginning and 536.9MB in the end (delta: 350.2MB). Free memory was 114.0MB in the beginning and 326.1MB in the end (delta: -212.1MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. [2024-11-10 03:04:47,849 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:04:47,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 772.83ms. Allocated memory is still 186.6MB. Free memory was 114.0MB in the beginning and 137.5MB in the end (delta: -23.6MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2024-11-10 03:04:47,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 244.43ms. Allocated memory is still 186.6MB. Free memory was 137.5MB in the beginning and 87.2MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-10 03:04:47,850 INFO L158 Benchmark]: Boogie Preprocessor took 352.08ms. Allocated memory is still 186.6MB. Free memory was 87.2MB in the beginning and 121.6MB in the end (delta: -34.4MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2024-11-10 03:04:47,850 INFO L158 Benchmark]: IcfgBuilder took 2614.56ms. Allocated memory was 186.6MB in the beginning and 358.6MB in the end (delta: 172.0MB). Free memory was 121.6MB in the beginning and 226.8MB in the end (delta: -105.2MB). Peak memory consumption was 129.7MB. Max. memory is 16.1GB. [2024-11-10 03:04:47,851 INFO L158 Benchmark]: TraceAbstraction took 9992.69ms. Allocated memory was 358.6MB in the beginning and 536.9MB in the end (delta: 178.3MB). Free memory was 226.8MB in the beginning and 326.1MB in the end (delta: -99.3MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2024-11-10 03:04:47,851 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 536.9MB. Free memory is still 326.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:04:47,853 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 772.83ms. Allocated memory is still 186.6MB. Free memory was 114.0MB in the beginning and 137.5MB in the end (delta: -23.6MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 244.43ms. Allocated memory is still 186.6MB. Free memory was 137.5MB in the beginning and 87.2MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 352.08ms. Allocated memory is still 186.6MB. Free memory was 87.2MB in the beginning and 121.6MB in the end (delta: -34.4MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. * IcfgBuilder took 2614.56ms. Allocated memory was 186.6MB in the beginning and 358.6MB in the end (delta: 172.0MB). Free memory was 121.6MB in the beginning and 226.8MB in the end (delta: -105.2MB). Peak memory consumption was 129.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9992.69ms. Allocated memory was 358.6MB in the beginning and 536.9MB in the end (delta: 178.3MB). Free memory was 226.8MB in the beginning and 326.1MB in the end (delta: -99.3MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 536.9MB. Free memory is still 326.1MB. 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 189, overapproximation of bitwiseAnd at line 194. 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_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 3); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (3 - 1); [L38] const SORT_18 mask_SORT_18 = (SORT_18)-1 >> (sizeof(SORT_18) * 8 - 2); [L39] const SORT_18 msb_SORT_18 = (SORT_18)1 << (2 - 1); [L41] const SORT_84 mask_SORT_84 = (SORT_84)-1 >> (sizeof(SORT_84) * 8 - 4); [L42] const SORT_84 msb_SORT_84 = (SORT_84)1 << (4 - 1); [L44] const SORT_148 mask_SORT_148 = (SORT_148)-1 >> (sizeof(SORT_148) * 8 - 32); [L45] const SORT_148 msb_SORT_148 = (SORT_148)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_10 var_12 = 3; [L49] const SORT_10 var_15 = 1; [L50] const SORT_10 var_24 = 0; [L51] const SORT_1 var_28 = 0; [L52] const SORT_3 var_30 = 0; [L53] const SORT_1 var_38 = 1; [L54] const SORT_10 var_62 = 2; [L55] const SORT_10 var_70 = 4; [L56] const SORT_10 var_72 = 5; [L57] const SORT_10 var_100 = 7; [L58] const SORT_10 var_105 = 6; [L59] const SORT_148 var_150 = 0; [L60] const SORT_3 var_165 = 2; [L61] const SORT_3 var_187 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_176; [L67] SORT_3 input_177; [L68] SORT_3 input_178; [L69] SORT_3 input_186; [L70] SORT_3 input_195; [L71] SORT_3 input_196; [L72] SORT_3 input_197; [L73] SORT_3 input_200; [L74] SORT_3 input_219; [L75] SORT_3 input_220; [L76] SORT_3 input_221; [L77] SORT_3 input_224; [L78] SORT_3 input_226; [L79] SORT_18 input_240; [L80] SORT_18 input_241; [L81] SORT_18 input_242; [L83] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L83] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L84] SORT_10 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L85] SORT_3 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L86] SORT_3 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L87] SORT_3 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L88] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L89] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L90] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L91] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L92] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L93] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L94] SORT_3 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L95] SORT_3 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_5 init_9_arg_1 = var_7; [L98] state_8 = init_9_arg_1 [L99] SORT_10 init_26_arg_1 = var_24; [L100] state_25 = init_26_arg_1 [L101] SORT_3 init_32_arg_1 = var_30; [L102] state_31 = init_32_arg_1 [L103] SORT_3 init_43_arg_1 = var_30; [L104] state_42 = init_43_arg_1 [L105] SORT_3 init_45_arg_1 = var_30; [L106] state_44 = init_45_arg_1 [L107] SORT_1 init_47_arg_1 = var_28; [L108] state_46 = init_47_arg_1 [L109] SORT_3 init_49_arg_1 = var_30; [L110] state_48 = init_49_arg_1 [L111] SORT_3 init_51_arg_1 = var_30; [L112] state_50 = init_51_arg_1 [L113] SORT_3 init_53_arg_1 = var_30; [L114] state_52 = init_53_arg_1 [L115] SORT_3 init_55_arg_1 = var_30; [L116] state_54 = init_55_arg_1 [L117] SORT_3 init_57_arg_1 = var_30; [L118] state_56 = init_57_arg_1 [L119] SORT_3 init_59_arg_1 = var_30; [L120] state_58 = init_59_arg_1 [L121] SORT_3 init_61_arg_1 = var_30; [L122] state_60 = init_61_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_176 = __VERIFIER_nondet_uchar() [L129] input_177 = __VERIFIER_nondet_uchar() [L130] input_178 = __VERIFIER_nondet_uchar() [L131] input_186 = __VERIFIER_nondet_uchar() [L132] input_195 = __VERIFIER_nondet_uchar() [L133] input_196 = __VERIFIER_nondet_uchar() [L134] input_197 = __VERIFIER_nondet_uchar() [L135] input_200 = __VERIFIER_nondet_uchar() [L136] input_219 = __VERIFIER_nondet_uchar() [L137] input_220 = __VERIFIER_nondet_uchar() [L138] input_221 = __VERIFIER_nondet_uchar() [L139] input_224 = __VERIFIER_nondet_uchar() [L140] input_226 = __VERIFIER_nondet_uchar() [L141] input_240 = __VERIFIER_nondet_uchar() [L142] input_241 = __VERIFIER_nondet_uchar() [L143] input_242 = __VERIFIER_nondet_uchar() [L146] SORT_5 var_11_arg_0 = state_8; [L147] SORT_10 var_11 = var_11_arg_0 >> 9; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L148] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L148] var_11 = var_11 & mask_SORT_10 [L149] SORT_10 var_13_arg_0 = var_11; [L150] SORT_10 var_13_arg_1 = var_12; [L151] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L152] SORT_5 var_14_arg_0 = state_8; [L153] SORT_10 var_14 = var_14_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L154] EXPR var_14 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L154] var_14 = var_14 & mask_SORT_10 [L155] SORT_10 var_16_arg_0 = var_14; [L156] SORT_10 var_16_arg_1 = var_15; [L157] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L158] SORT_1 var_17_arg_0 = var_13; [L159] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17_arg_0=0, var_17_arg_1=0, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L160] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L160] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L161] SORT_5 var_19_arg_0 = state_8; [L162] SORT_18 var_19 = var_19_arg_0 >> 7; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_19=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L163] EXPR var_19 & mask_SORT_18 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L163] var_19 = var_19 & mask_SORT_18 [L164] SORT_5 var_20_arg_0 = state_8; [L165] SORT_18 var_20 = var_20_arg_0 >> 5; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_19=0, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L166] EXPR var_20 & mask_SORT_18 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_19=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L166] var_20 = var_20 & mask_SORT_18 [L167] SORT_18 var_21_arg_0 = var_19; [L168] SORT_18 var_21_arg_1 = var_20; [L169] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L170] SORT_1 var_22_arg_0 = var_17; [L171] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_22_arg_0=0, var_22_arg_1=1, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L172] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L172] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L173] SORT_1 var_23_arg_0 = var_22; [L174] SORT_1 var_23 = ~var_23_arg_0; [L175] SORT_10 var_27_arg_0 = state_25; [L176] SORT_1 var_27 = var_27_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_27=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L177] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L177] var_27 = var_27 & mask_SORT_1 [L178] SORT_1 var_29_arg_0 = var_27; [L179] SORT_1 var_29_arg_1 = var_28; [L180] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L181] SORT_3 var_33_arg_0 = state_31; [L182] SORT_3 var_33_arg_1 = var_30; [L183] SORT_1 var_33 = var_33_arg_0 == var_33_arg_1; [L184] SORT_1 var_34_arg_0 = var_29; [L185] SORT_1 var_34_arg_1 = var_33; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_28=0, var_30=0, var_34_arg_0=1, var_34_arg_1=1, var_38=1, var_62=2, var_70=4, var_72=5] [L186] EXPR var_34_arg_0 | var_34_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L186] SORT_1 var_34 = var_34_arg_0 | var_34_arg_1; [L187] SORT_1 var_35_arg_0 = var_23; [L188] SORT_1 var_35_arg_1 = var_34; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_35_arg_0=-1, var_35_arg_1=1, var_38=1, var_62=2, var_70=4, var_72=5] [L189] EXPR var_35_arg_0 | var_35_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L189] SORT_1 var_35 = var_35_arg_0 | var_35_arg_1; [L190] SORT_1 var_39_arg_0 = var_35; [L191] SORT_1 var_39 = ~var_39_arg_0; [L192] SORT_1 var_40_arg_0 = var_38; [L193] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_40_arg_0=1, var_40_arg_1=-1, var_62=2, var_70=4, var_72=5] [L194] EXPR var_40_arg_0 & var_40_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L194] SORT_1 var_40 = var_40_arg_0 & var_40_arg_1; [L195] EXPR var_40 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L195] var_40 = var_40 & mask_SORT_1 [L196] SORT_1 bad_41_arg_0 = var_40; [L197] CALL __VERIFIER_assert(!(bad_41_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 554 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3206 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3206 mSDsluCounter, 32380 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26277 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7067 IncrementalHoareTripleChecker+Invalid, 7072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 6103 mSDtfsCounter, 7067 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=8, InterpolantAutomatonStates: 62, 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, 9 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 570 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 1372 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-10 03:04:47,890 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.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 ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:04:50,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:04:50,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 03:04:50,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:04:50,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:04:50,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:04:50,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:04:50,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:04:50,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:04:50,332 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:04:50,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:04:50,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:04:50,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:04:50,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:04:50,335 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:04:50,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:04:50,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:04:50,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:04:50,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:04:50,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:04:50,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:04:50,341 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:04:50,342 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:04:50,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:04:50,342 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:04:50,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:04:50,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:04:50,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:04:50,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:04:50,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:04:50,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:04:50,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:04:50,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:04:50,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:04:50,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:04:50,344 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:04:50,345 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:04:50,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:04:50,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:04:50,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:04:50,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:04:50,347 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 -> ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 [2024-11-10 03:04:50,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:04:50,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:04:50,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:04:50,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:04:50,696 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:04:50,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-11-10 03:04:52,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:04:52,543 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:04:52,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-11-10 03:04:52,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31d8fb84/b8a76a84485c4de58f539458b5cb4246/FLAG18e391f7f [2024-11-10 03:04:52,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31d8fb84/b8a76a84485c4de58f539458b5cb4246 [2024-11-10 03:04:52,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:04:52,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:04:52,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:04:52,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:04:52,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:04:52,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:04:52" (1/1) ... [2024-11-10 03:04:52,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33fea300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:52, skipping insertion in model container [2024-11-10 03:04:52,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:04:52" (1/1) ... [2024-11-10 03:04:52,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:04:52,910 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_p11.c[1259,1272] [2024-11-10 03:04:53,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:04:53,141 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:04:53,152 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_p11.c[1259,1272] [2024-11-10 03:04:53,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:04:53,288 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:04:53,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53 WrapperNode [2024-11-10 03:04:53,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:04:53,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:04:53,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:04:53,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:04:53,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,424 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1090 [2024-11-10 03:04:53,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:04:53,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:04:53,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:04:53,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:04:53,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,505 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-10 03:04:53,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:04:53,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:04:53,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:04:53,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:04:53,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (1/1) ... [2024-11-10 03:04:53,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:04:53,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:04:53,629 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-10 03:04:53,634 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-10 03:04:53,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:04:53,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:04:53,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:04:53,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:04:53,939 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:04:53,942 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:04:55,599 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-11-10 03:04:55,600 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:04:55,610 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:04:55,610 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:04:55,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:04:55 BoogieIcfgContainer [2024-11-10 03:04:55,612 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:04:55,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:04:55,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:04:55,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:04:55,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:04:52" (1/3) ... [2024-11-10 03:04:55,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8ca404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:04:55, skipping insertion in model container [2024-11-10 03:04:55,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:53" (2/3) ... [2024-11-10 03:04:55,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8ca404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:04:55, skipping insertion in model container [2024-11-10 03:04:55,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:04:55" (3/3) ... [2024-11-10 03:04:55,621 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-11-10 03:04:55,637 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:04:55,637 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:04:55,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:04:55,698 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;@5b98f22a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:04:55,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:04:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 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-10 03:04:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 03:04:55,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:55,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 03:04:55,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:55,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:55,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 03:04:55,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:04:55,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944380536] [2024-11-10 03:04:55,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:55,727 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-10 03:04:55,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:04:55,730 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-10 03:04:55,753 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-10 03:04:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:56,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 03:04:56,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:04:56,190 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-10 03:04:56,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:04:56,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:04:56,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944380536] [2024-11-10 03:04:56,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944380536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:56,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:56,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:04:56,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515000386] [2024-11-10 03:04:56,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:56,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:04:56,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:04:56,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:04:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:04:56,217 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-10 03:04:56,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:56,296 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 03:04:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:04:56,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-10 03:04:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:56,305 INFO L225 Difference]: With dead ends: 22 [2024-11-10 03:04:56,306 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 03:04:56,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10 03:04:56,311 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:56,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:04:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 03:04:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 03:04:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-10 03:04:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 03:04:56,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 03:04:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:56,342 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 03:04:56,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-10 03:04:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 03:04:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 03:04:56,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:56,343 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:56,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:04:56,547 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-10 03:04:56,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:56,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 03:04:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:04:56,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393896518] [2024-11-10 03:04:56,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:56,550 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-10 03:04:56,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:04:56,553 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-10 03:04:56,554 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-10 03:04:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:56,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 03:04:57,002 INFO L278 TraceCheckSpWp]: Computing forward predicates...