./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:13:21,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:13:21,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 07:13:21,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:13:21,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:13:21,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:13:21,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:13:21,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:13:21,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:13:21,995 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:13:21,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:13:21,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:13:21,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:13:21,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:13:21,999 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:13:22,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:13:22,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:13:22,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:13:22,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:13:22,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:13:22,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:13:22,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:13:22,002 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:13:22,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:13:22,002 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:13:22,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:13:22,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:13:22,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:13:22,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:13:22,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:13:22,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:13:22,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:13:22,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:13:22,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:13:22,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:13:22,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:13:22,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:13:22,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:13:22,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:13:22,008 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 [2024-10-14 07:13:22,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:13:22,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:13:22,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:13:22,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:13:22,301 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:13:22,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-10-14 07:13:23,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:13:24,023 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:13:24,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-10-14 07:13:24,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d219a2e7/8afdf972cd6a4a96a99b971fcf096a1b/FLAG6dacdea9d [2024-10-14 07:13:24,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d219a2e7/8afdf972cd6a4a96a99b971fcf096a1b [2024-10-14 07:13:24,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:13:24,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:13:24,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:13:24,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:13:24,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:13:24,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:24,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b709c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24, skipping insertion in model container [2024-10-14 07:13:24,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:24,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:13:24,318 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c[1259,1272] [2024-10-14 07:13:24,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:13:24,612 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:13:24,627 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c[1259,1272] [2024-10-14 07:13:24,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:13:24,738 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:13:24,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24 WrapperNode [2024-10-14 07:13:24,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:13:24,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:13:24,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:13:24,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:13:24,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:24,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:25,005 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2137 [2024-10-14 07:13:25,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:13:25,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:13:25,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:13:25,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:13:25,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:25,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:25,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:25,218 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-10-14 07:13:25,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:25,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:25,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:25,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:25,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:25,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:25,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:13:25,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:13:25,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:13:25,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:13:25,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (1/1) ... [2024-10-14 07:13:25,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:13:25,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:13:25,495 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-10-14 07:13:25,498 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-10-14 07:13:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:13:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:13:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:13:25,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:13:25,957 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:13:25,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:13:27,960 INFO L? ?]: Removed 1339 outVars from TransFormulas that were not future-live. [2024-10-14 07:13:27,960 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:13:28,037 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:13:28,038 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:13:28,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:13:28 BoogieIcfgContainer [2024-10-14 07:13:28,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:13:28,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:13:28,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:13:28,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:13:28,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:13:24" (1/3) ... [2024-10-14 07:13:28,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420e2522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:13:28, skipping insertion in model container [2024-10-14 07:13:28,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:24" (2/3) ... [2024-10-14 07:13:28,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420e2522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:13:28, skipping insertion in model container [2024-10-14 07:13:28,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:13:28" (3/3) ... [2024-10-14 07:13:28,056 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-10-14 07:13:28,072 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:13:28,072 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:13:28,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:13:28,168 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;@32057d06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:13:28,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:13:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 536 states, 534 states have (on average 1.5018726591760299) internal successors, (802), 535 states have internal predecessors, (802), 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-10-14 07:13:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 07:13:28,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:13:28,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:13:28,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:13:28,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:13:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1181838971, now seen corresponding path program 1 times [2024-10-14 07:13:28,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:13:28,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994161231] [2024-10-14 07:13:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:13:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:13:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:13:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:13:28,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:13:28,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994161231] [2024-10-14 07:13:28,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994161231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:13:28,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:13:28,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:13:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255302529] [2024-10-14 07:13:28,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:13:28,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:13:28,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:13:28,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:13:28,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:13:28,976 INFO L87 Difference]: Start difference. First operand has 536 states, 534 states have (on average 1.5018726591760299) internal successors, (802), 535 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 07:13:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:13:29,095 INFO L93 Difference]: Finished difference Result 1020 states and 1528 transitions. [2024-10-14 07:13:29,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:13:29,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2024-10-14 07:13:29,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:13:29,120 INFO L225 Difference]: With dead ends: 1020 [2024-10-14 07:13:29,120 INFO L226 Difference]: Without dead ends: 537 [2024-10-14 07:13:29,125 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-10-14 07:13:29,131 INFO L432 NwaCegarLoop]: 797 mSDtfsCounter, 0 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:13:29,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2386 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:13:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-10-14 07:13:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2024-10-14 07:13:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4962686567164178) internal successors, (802), 536 states have internal predecessors, (802), 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-10-14 07:13:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 802 transitions. [2024-10-14 07:13:29,225 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 802 transitions. Word has length 42 [2024-10-14 07:13:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:13:29,226 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 802 transitions. [2024-10-14 07:13:29,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 07:13:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 802 transitions. [2024-10-14 07:13:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 07:13:29,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:13:29,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:13:29,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:13:29,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:13:29,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:13:29,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2016002163, now seen corresponding path program 1 times [2024-10-14 07:13:29,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:13:29,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617975204] [2024-10-14 07:13:29,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:13:29,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:13:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:13:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:13:29,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:13:29,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617975204] [2024-10-14 07:13:29,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617975204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:13:29,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:13:29,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:13:29,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585014533] [2024-10-14 07:13:29,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:13:29,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:13:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:13:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:13:29,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:13:29,474 INFO L87 Difference]: Start difference. First operand 537 states and 802 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:13:29,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:13:29,518 INFO L93 Difference]: Finished difference Result 1023 states and 1528 transitions. [2024-10-14 07:13:29,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:13:29,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-14 07:13:29,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:13:29,522 INFO L225 Difference]: With dead ends: 1023 [2024-10-14 07:13:29,522 INFO L226 Difference]: Without dead ends: 539 [2024-10-14 07:13:29,525 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-10-14 07:13:29,529 INFO L432 NwaCegarLoop]: 797 mSDtfsCounter, 0 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:13:29,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2383 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:13:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-10-14 07:13:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2024-10-14 07:13:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.4944237918215613) internal successors, (804), 538 states have internal predecessors, (804), 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-10-14 07:13:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 804 transitions. [2024-10-14 07:13:29,563 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 804 transitions. Word has length 43 [2024-10-14 07:13:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:13:29,563 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 804 transitions. [2024-10-14 07:13:29,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:13:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 804 transitions. [2024-10-14 07:13:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 07:13:29,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:13:29,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:13:29,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:13:29,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:13:29,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:13:29,565 INFO L85 PathProgramCache]: Analyzing trace with hash 830476692, now seen corresponding path program 1 times [2024-10-14 07:13:29,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:13:29,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463907970] [2024-10-14 07:13:29,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:13:29,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:13:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:13:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:13:29,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:13:29,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463907970] [2024-10-14 07:13:29,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463907970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:13:29,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:13:29,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:13:29,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759820998] [2024-10-14 07:13:29,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:13:29,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:13:29,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:13:29,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:13:29,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:13:29,971 INFO L87 Difference]: Start difference. First operand 539 states and 804 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:13:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:13:30,022 INFO L93 Difference]: Finished difference Result 1029 states and 1535 transitions. [2024-10-14 07:13:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:13:30,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-14 07:13:30,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:13:30,026 INFO L225 Difference]: With dead ends: 1029 [2024-10-14 07:13:30,026 INFO L226 Difference]: Without dead ends: 543 [2024-10-14 07:13:30,027 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-10-14 07:13:30,029 INFO L432 NwaCegarLoop]: 794 mSDtfsCounter, 2 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:13:30,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2377 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:13:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-10-14 07:13:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2024-10-14 07:13:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.4925925925925927) internal successors, (806), 540 states have internal predecessors, (806), 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-10-14 07:13:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 806 transitions. [2024-10-14 07:13:30,048 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 806 transitions. Word has length 44 [2024-10-14 07:13:30,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:13:30,049 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 806 transitions. [2024-10-14 07:13:30,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:13:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 806 transitions. [2024-10-14 07:13:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 07:13:30,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:13:30,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:13:30,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:13:30,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:13:30,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:13:30,053 INFO L85 PathProgramCache]: Analyzing trace with hash 883860724, now seen corresponding path program 1 times [2024-10-14 07:13:30,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:13:30,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747882098] [2024-10-14 07:13:30,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:13:30,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:13:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:13:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:13:30,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:13:30,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747882098] [2024-10-14 07:13:30,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747882098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:13:30,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:13:30,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:13:30,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100278981] [2024-10-14 07:13:30,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:13:30,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:13:30,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:13:30,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:13:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:13:30,358 INFO L87 Difference]: Start difference. First operand 541 states and 806 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:13:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:13:30,440 INFO L93 Difference]: Finished difference Result 1033 states and 1539 transitions. [2024-10-14 07:13:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:13:30,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-14 07:13:30,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:13:30,445 INFO L225 Difference]: With dead ends: 1033 [2024-10-14 07:13:30,445 INFO L226 Difference]: Without dead ends: 545 [2024-10-14 07:13:30,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:13:30,447 INFO L432 NwaCegarLoop]: 793 mSDtfsCounter, 1 mSDsluCounter, 3161 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3954 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:13:30,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3954 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:13:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-14 07:13:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 544. [2024-10-14 07:13:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.4917127071823204) internal successors, (810), 543 states have internal predecessors, (810), 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-10-14 07:13:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 810 transitions. [2024-10-14 07:13:30,462 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 810 transitions. Word has length 45 [2024-10-14 07:13:30,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:13:30,463 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 810 transitions. [2024-10-14 07:13:30,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:13:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 810 transitions. [2024-10-14 07:13:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 07:13:30,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:13:30,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:13:30,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:13:30,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:13:30,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:13:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1029030843, now seen corresponding path program 1 times [2024-10-14 07:13:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:13:30,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847912373] [2024-10-14 07:13:30,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:13:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:13:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:13:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:13:30,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:13:30,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847912373] [2024-10-14 07:13:30,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847912373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:13:30,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:13:30,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:13:30,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993645549] [2024-10-14 07:13:30,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:13:30,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:13:30,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:13:30,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:13:30,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:13:30,803 INFO L87 Difference]: Start difference. First operand 544 states and 810 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:13:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:13:30,994 INFO L93 Difference]: Finished difference Result 1229 states and 1826 transitions. [2024-10-14 07:13:30,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:13:30,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-14 07:13:30,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:13:30,999 INFO L225 Difference]: With dead ends: 1229 [2024-10-14 07:13:30,999 INFO L226 Difference]: Without dead ends: 738 [2024-10-14 07:13:31,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:13:31,001 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 1337 mSDsluCounter, 2335 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:13:31,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 3115 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:13:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-10-14 07:13:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 554. [2024-10-14 07:13:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.4900542495479205) internal successors, (824), 553 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:13:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 824 transitions. [2024-10-14 07:13:31,017 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 824 transitions. Word has length 45 [2024-10-14 07:13:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:13:31,018 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 824 transitions. [2024-10-14 07:13:31,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:13:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 824 transitions. [2024-10-14 07:13:31,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 07:13:31,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:13:31,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:13:31,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:13:31,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:13:31,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:13:31,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1949225201, now seen corresponding path program 1 times [2024-10-14 07:13:31,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:13:31,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442403481] [2024-10-14 07:13:31,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:13:31,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:13:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:13:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:13:31,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:13:31,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442403481] [2024-10-14 07:13:31,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442403481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:13:31,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:13:31,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 07:13:31,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579078520] [2024-10-14 07:13:31,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:13:31,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:13:31,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:13:31,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:13:31,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:13:31,527 INFO L87 Difference]: Start difference. First operand 554 states and 824 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:13:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:13:31,676 INFO L93 Difference]: Finished difference Result 1050 states and 1562 transitions. [2024-10-14 07:13:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:13:31,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-14 07:13:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:13:31,680 INFO L225 Difference]: With dead ends: 1050 [2024-10-14 07:13:31,680 INFO L226 Difference]: Without dead ends: 559 [2024-10-14 07:13:31,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:13:31,684 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 773 mSDsluCounter, 3925 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 4712 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:13:31,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 4712 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:13:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-14 07:13:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 558. [2024-10-14 07:13:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 1.488330341113106) internal successors, (829), 557 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:13:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 829 transitions. [2024-10-14 07:13:31,695 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 829 transitions. Word has length 46 [2024-10-14 07:13:31,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:13:31,695 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 829 transitions. [2024-10-14 07:13:31,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:13:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 829 transitions. [2024-10-14 07:13:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 07:13:31,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:13:31,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:13:31,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 07:13:31,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:13:31,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:13:31,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1860984435, now seen corresponding path program 1 times [2024-10-14 07:13:31,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:13:31,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887747524] [2024-10-14 07:13:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:13:31,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:13:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:13:31,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:13:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:13:31,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:13:31,838 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:13:31,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:13:31,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 07:13:31,843 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:13:31,907 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:13:31,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:13:31 BoogieIcfgContainer [2024-10-14 07:13:31,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:13:31,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:13:31,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:13:31,915 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:13:31,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:13:28" (3/4) ... [2024-10-14 07:13:31,917 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:13:31,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:13:31,919 INFO L158 Benchmark]: Toolchain (without parser) took 7862.88ms. Allocated memory was 178.3MB in the beginning and 432.0MB in the end (delta: 253.8MB). Free memory was 125.1MB in the beginning and 288.8MB in the end (delta: -163.7MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2024-10-14 07:13:31,919 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 96.5MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:13:31,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 682.32ms. Allocated memory is still 178.3MB. Free memory was 125.1MB in the beginning and 124.9MB in the end (delta: 240.6kB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2024-10-14 07:13:31,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 266.04ms. Allocated memory is still 178.3MB. Free memory was 124.9MB in the beginning and 75.6MB in the end (delta: 49.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-14 07:13:31,920 INFO L158 Benchmark]: Boogie Preprocessor took 451.90ms. Allocated memory was 178.3MB in the beginning and 272.6MB in the end (delta: 94.4MB). Free memory was 75.6MB in the beginning and 201.9MB in the end (delta: -126.2MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-10-14 07:13:31,920 INFO L158 Benchmark]: RCFGBuilder took 2578.27ms. Allocated memory was 272.6MB in the beginning and 432.0MB in the end (delta: 159.4MB). Free memory was 201.9MB in the beginning and 336.5MB in the end (delta: -134.7MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2024-10-14 07:13:31,921 INFO L158 Benchmark]: TraceAbstraction took 3870.03ms. Allocated memory is still 432.0MB. Free memory was 335.5MB in the beginning and 288.8MB in the end (delta: 46.7MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-10-14 07:13:31,921 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 432.0MB. Free memory is still 288.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:13:31,922 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.31ms. Allocated memory is still 96.5MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 682.32ms. Allocated memory is still 178.3MB. Free memory was 125.1MB in the beginning and 124.9MB in the end (delta: 240.6kB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 266.04ms. Allocated memory is still 178.3MB. Free memory was 124.9MB in the beginning and 75.6MB in the end (delta: 49.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 451.90ms. Allocated memory was 178.3MB in the beginning and 272.6MB in the end (delta: 94.4MB). Free memory was 75.6MB in the beginning and 201.9MB in the end (delta: -126.2MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * RCFGBuilder took 2578.27ms. Allocated memory was 272.6MB in the beginning and 432.0MB in the end (delta: 159.4MB). Free memory was 201.9MB in the beginning and 336.5MB in the end (delta: -134.7MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3870.03ms. Allocated memory is still 432.0MB. Free memory was 335.5MB in the beginning and 288.8MB in the end (delta: 46.7MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 432.0MB. Free memory is still 288.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 171, overapproximation of bitwiseAnd at line 176. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_78 mask_SORT_78 = (SORT_78)-1 >> (sizeof(SORT_78) * 8 - 32); [L39] const SORT_78 msb_SORT_78 = (SORT_78)1 << (32 - 1); [L41] const SORT_107 mask_SORT_107 = (SORT_107)-1 >> (sizeof(SORT_107) * 8 - 4); [L42] const SORT_107 msb_SORT_107 = (SORT_107)1 << (4 - 1); [L44] const SORT_174 mask_SORT_174 = (SORT_174)-1 >> (sizeof(SORT_174) * 8 - 2); [L45] const SORT_174 msb_SORT_174 = (SORT_174)1 << (2 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_5 var_12 = 0; [L49] const SORT_7 var_16 = 2; [L50] const SORT_1 var_19 = 0; [L51] const SORT_3 var_26 = 0; [L52] const SORT_1 var_35 = 1; [L53] const SORT_7 var_57 = 1; [L54] const SORT_7 var_62 = 4; [L55] const SORT_7 var_64 = 5; [L56] const SORT_7 var_68 = 3; [L57] const SORT_78 var_80 = 0; [L58] const SORT_3 var_94 = 2; [L59] const SORT_7 var_124 = 7; [L60] const SORT_7 var_129 = 6; [L61] const SORT_3 var_183 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_171; [L67] SORT_3 input_172; [L68] SORT_3 input_173; [L69] SORT_3 input_182; [L70] SORT_3 input_192; [L71] SORT_3 input_193; [L72] SORT_3 input_194; [L73] SORT_3 input_197; [L74] SORT_3 input_216; [L75] SORT_3 input_217; [L76] SORT_3 input_218; [L77] SORT_3 input_221; [L78] SORT_3 input_223; [L79] SORT_174 input_237; [L80] SORT_174 input_238; [L81] SORT_174 input_239; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L83] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L84] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L84] SORT_5 state_13 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L85] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L86] SORT_3 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L87] SORT_3 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L88] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L89] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L90] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L91] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L92] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L93] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L94] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L95] SORT_3 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_7 init_10_arg_1 = var_8; [L98] state_9 = init_10_arg_1 [L99] SORT_5 init_14_arg_1 = var_12; [L100] state_13 = init_14_arg_1 [L101] SORT_1 init_21_arg_1 = var_19; [L102] state_20 = init_21_arg_1 [L103] SORT_3 init_28_arg_1 = var_26; [L104] state_27 = init_28_arg_1 [L105] SORT_3 init_30_arg_1 = var_26; [L106] state_29 = init_30_arg_1 [L107] SORT_3 init_40_arg_1 = var_26; [L108] state_39 = init_40_arg_1 [L109] SORT_3 init_42_arg_1 = var_26; [L110] state_41 = init_42_arg_1 [L111] SORT_3 init_44_arg_1 = var_26; [L112] state_43 = init_44_arg_1 [L113] SORT_3 init_46_arg_1 = var_26; [L114] state_45 = init_46_arg_1 [L115] SORT_3 init_48_arg_1 = var_26; [L116] state_47 = init_48_arg_1 [L117] SORT_3 init_50_arg_1 = var_26; [L118] state_49 = init_50_arg_1 [L119] SORT_3 init_52_arg_1 = var_26; [L120] state_51 = init_52_arg_1 [L121] SORT_3 init_54_arg_1 = var_26; [L122] state_53 = init_54_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_171 = __VERIFIER_nondet_uchar() [L129] input_172 = __VERIFIER_nondet_uchar() [L130] input_173 = __VERIFIER_nondet_uchar() [L131] input_182 = __VERIFIER_nondet_uchar() [L132] input_192 = __VERIFIER_nondet_uchar() [L133] input_193 = __VERIFIER_nondet_uchar() [L134] input_194 = __VERIFIER_nondet_uchar() [L135] input_197 = __VERIFIER_nondet_uchar() [L136] input_216 = __VERIFIER_nondet_uchar() [L137] input_217 = __VERIFIER_nondet_uchar() [L138] input_218 = __VERIFIER_nondet_uchar() [L139] input_221 = __VERIFIER_nondet_uchar() [L140] input_223 = __VERIFIER_nondet_uchar() [L141] input_237 = __VERIFIER_nondet_uchar() [L142] input_238 = __VERIFIER_nondet_uchar() [L143] input_239 = __VERIFIER_nondet_uchar() [L146] SORT_7 var_11_arg_0 = state_9; [L147] SORT_1 var_11 = var_11_arg_0 >> 2; [L148] SORT_5 var_15_arg_0 = state_13; [L149] SORT_7 var_15 = var_15_arg_0 >> 9; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_15=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L150] EXPR var_15 & mask_SORT_7 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L150] var_15 = var_15 & mask_SORT_7 [L151] SORT_7 var_17_arg_0 = var_15; [L152] SORT_7 var_17_arg_1 = var_16; [L153] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L154] SORT_1 var_18_arg_0 = var_17; [L155] SORT_1 var_18 = ~var_18_arg_0; [L156] SORT_1 var_22_arg_0 = state_20; [L157] SORT_1 var_22 = ~var_22_arg_0; [L158] SORT_1 var_23_arg_0 = var_18; [L159] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_23_arg_0=-1, var_23_arg_1=-1, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L160] EXPR var_23_arg_0 | var_23_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L160] SORT_1 var_23 = var_23_arg_0 | var_23_arg_1; [L161] SORT_1 var_24_arg_0 = var_11; [L162] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_24_arg_0=0, var_24_arg_1=255, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L163] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L163] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L164] SORT_1 var_25_arg_0 = var_24; [L165] SORT_1 var_25 = ~var_25_arg_0; [L166] SORT_3 var_31_arg_0 = state_27; [L167] SORT_3 var_31_arg_1 = state_29; [L168] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L169] SORT_1 var_32_arg_0 = var_25; [L170] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_32_arg_0=-1, var_32_arg_1=1, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L171] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L171] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L172] SORT_1 var_36_arg_0 = var_32; [L173] SORT_1 var_36 = ~var_36_arg_0; [L174] SORT_1 var_37_arg_0 = var_35; [L175] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_37_arg_0=1, var_37_arg_1=-1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L176] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L176] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L177] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L177] var_37 = var_37 & mask_SORT_1 [L178] SORT_1 bad_38_arg_0 = var_37; [L179] CALL __VERIFIER_assert(!(bad_38_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 536 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2113 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2113 mSDsluCounter, 18927 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14179 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 4748 mSDtfsCounter, 267 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=558occurred in iteration=6, InterpolantAutomatonStates: 32, 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, 6 MinimizatonAttempts, 188 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-10-14 07:13:31,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:13:34,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:13:34,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 07:13:34,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:13:34,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:13:34,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:13:34,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:13:34,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:13:34,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:13:34,357 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:13:34,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:13:34,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:13:34,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:13:34,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:13:34,360 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:13:34,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:13:34,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:13:34,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:13:34,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:13:34,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:13:34,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:13:34,365 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:13:34,365 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:13:34,366 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:13:34,366 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:13:34,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:13:34,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:13:34,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:13:34,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:13:34,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:13:34,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:13:34,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:13:34,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:13:34,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:13:34,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:13:34,369 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:13:34,378 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:13:34,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:13:34,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:13:34,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:13:34,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:13:34,379 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:13:34,379 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 [2024-10-14 07:13:34,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:13:34,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:13:34,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:13:34,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:13:34,725 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:13:34,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-10-14 07:13:36,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:13:36,616 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:13:36,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-10-14 07:13:36,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d0107e5/ef3337a3b58b4f1086ddcbd2b5188440/FLAGf3f0da96c [2024-10-14 07:13:36,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d0107e5/ef3337a3b58b4f1086ddcbd2b5188440 [2024-10-14 07:13:36,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:13:36,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:13:36,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:13:36,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:13:36,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:13:36,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:13:36" (1/1) ... [2024-10-14 07:13:36,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff570d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:36, skipping insertion in model container [2024-10-14 07:13:36,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:13:36" (1/1) ... [2024-10-14 07:13:36,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:13:37,159 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c[1259,1272] [2024-10-14 07:13:37,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:13:37,420 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:13:37,440 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c[1259,1272] [2024-10-14 07:13:37,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:13:37,572 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:13:37,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37 WrapperNode [2024-10-14 07:13:37,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:13:37,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:13:37,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:13:37,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:13:37,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (1/1) ... [2024-10-14 07:13:37,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (1/1) ... [2024-10-14 07:13:37,707 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1079 [2024-10-14 07:13:37,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:13:37,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:13:37,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:13:37,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:13:37,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (1/1) ... [2024-10-14 07:13:37,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (1/1) ... [2024-10-14 07:13:37,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (1/1) ... [2024-10-14 07:13:37,767 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-10-14 07:13:37,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (1/1) ... [2024-10-14 07:13:37,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (1/1) ... [2024-10-14 07:13:37,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (1/1) ... [2024-10-14 07:13:37,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (1/1) ... [2024-10-14 07:13:37,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (1/1) ... [2024-10-14 07:13:37,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (1/1) ... [2024-10-14 07:13:37,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:13:37,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:13:37,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:13:37,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:13:37,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (1/1) ... [2024-10-14 07:13:37,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:13:37,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:13:37,866 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-10-14 07:13:37,873 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-10-14 07:13:37,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:13:37,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:13:37,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:13:37,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:13:38,162 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:13:38,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:13:39,692 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-14 07:13:39,692 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:13:39,746 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:13:39,747 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:13:39,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:13:39 BoogieIcfgContainer [2024-10-14 07:13:39,748 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:13:39,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:13:39,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:13:39,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:13:39,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:13:36" (1/3) ... [2024-10-14 07:13:39,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ece4fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:13:39, skipping insertion in model container [2024-10-14 07:13:39,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:37" (2/3) ... [2024-10-14 07:13:39,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ece4fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:13:39, skipping insertion in model container [2024-10-14 07:13:39,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:13:39" (3/3) ... [2024-10-14 07:13:39,757 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p14.c [2024-10-14 07:13:39,773 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:13:39,773 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:13:39,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:13:39,840 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;@725a5e50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:13:39,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:13:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-10-14 07:13:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 07:13:39,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:13:39,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 07:13:39,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:13:39,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:13:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 07:13:39,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:13:39,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84581112] [2024-10-14 07:13:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:13:39,878 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-10-14 07:13:39,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:13:39,881 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-10-14 07:13:39,883 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-10-14 07:13:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:13:40,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 07:13:40,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:13:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:13:40,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:13:40,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:13:40,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84581112] [2024-10-14 07:13:40,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84581112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:13:40,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:13:40,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:13:40,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054217070] [2024-10-14 07:13:40,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:13:40,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:13:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:13:40,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:13:40,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:13:40,347 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-14 07:13:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:13:40,430 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 07:13:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:13:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-14 07:13:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:13:40,438 INFO L225 Difference]: With dead ends: 15 [2024-10-14 07:13:40,439 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 07:13:40,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-14 07:13:40,444 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:13:40,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:13:40,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 07:13:40,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 07:13:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-10-14 07:13:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 07:13:40,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 07:13:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:13:40,470 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 07:13:40,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-14 07:13:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 07:13:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 07:13:40,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:13:40,471 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 07:13:40,477 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-10-14 07:13:40,672 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-10-14 07:13:40,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:13:40,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:13:40,673 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 07:13:40,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:13:40,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014353043] [2024-10-14 07:13:40,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:13:40,675 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-10-14 07:13:40,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:13:40,677 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-10-14 07:13:40,678 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-10-14 07:13:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:13:41,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 07:13:41,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:13:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:13:41,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:13:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:13:41,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:13:41,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014353043] [2024-10-14 07:13:41,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014353043] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:13:41,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:13:41,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 07:13:41,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337480963] [2024-10-14 07:13:41,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:13:41,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:13:41,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:13:41,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:13:41,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:13:41,485 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-10-14 07:13:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:13:41,868 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-14 07:13:41,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:13:41,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 7 [2024-10-14 07:13:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:13:41,870 INFO L225 Difference]: With dead ends: 17 [2024-10-14 07:13:41,870 INFO L226 Difference]: Without dead ends: 15 [2024-10-14 07:13:41,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:13:41,873 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:13:41,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:13:41,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-14 07:13:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-14 07:13:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-10-14 07:13:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-14 07:13:41,881 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-14 07:13:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:13:41,882 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-14 07:13:41,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-10-14 07:13:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-14 07:13:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 07:13:41,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:13:41,883 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-14 07:13:41,889 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 (3)] Forceful destruction successful, exit code 0 [2024-10-14 07:13:42,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:13:42,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:13:42,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:13:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-14 07:13:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:13:42,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351222121] [2024-10-14 07:13:42,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 07:13:42,091 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-10-14 07:13:42,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:13:42,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:13:42,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 07:13:42,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 07:13:42,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 07:13:42,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 07:13:42,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:13:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:13:43,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:13:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:13:44,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:13:44,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351222121] [2024-10-14 07:13:44,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351222121] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:13:44,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:13:44,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-14 07:13:44,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184064704] [2024-10-14 07:13:44,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:13:44,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 07:13:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:13:44,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 07:13:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:13:44,267 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-10-14 07:13:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:13:45,546 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-10-14 07:13:45,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 07:13:45,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 13 [2024-10-14 07:13:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:13:45,547 INFO L225 Difference]: With dead ends: 31 [2024-10-14 07:13:45,548 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 07:13:45,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-14 07:13:45,550 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:13:45,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:13:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 07:13:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-10-14 07:13:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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-10-14 07:13:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-10-14 07:13:45,563 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 13 [2024-10-14 07:13:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:13:45,564 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-10-14 07:13:45,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-10-14 07:13:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-10-14 07:13:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 07:13:45,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:13:45,565 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2024-10-14 07:13:45,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 07:13:45,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:13:45,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:13:45,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:13:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash 181792434, now seen corresponding path program 3 times [2024-10-14 07:13:45,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:13:45,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632605639] [2024-10-14 07:13:45,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 07:13:45,772 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-10-14 07:13:45,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:13:45,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:13:45,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 07:13:46,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 07:13:46,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 07:13:46,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-10-14 07:13:46,358 INFO L278 TraceCheckSpWp]: Computing forward predicates...