./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.vcegar_QF_BV_itc99_b13_p22.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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.vcegar_QF_BV_itc99_b13_p22.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 81099e1fe8016daaefd672ebf53a7cbfe30573425760bd713b63c430b338ca02 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:58:46,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:58:46,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 04:58:46,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:58:46,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:58:46,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:58:46,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:58:46,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:58:46,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:58:46,829 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:58:46,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:58:46,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:58:46,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:58:46,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:58:46,833 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:58:46,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:58:46,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:58:46,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 04:58:46,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:58:46,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:58:46,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:58:46,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:58:46,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:58:46,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:58:46,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:58:46,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:58:46,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:58:46,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:58:46,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:58:46,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:58:46,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:58:46,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:58:46,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:58:46,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 04:58:46,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 04:58:46,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:58:46,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:58:46,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:58:46,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:58:46,843 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 -> 81099e1fe8016daaefd672ebf53a7cbfe30573425760bd713b63c430b338ca02 [2024-10-24 04:58:47,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:58:47,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:58:47,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:58:47,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:58:47,117 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:58:47,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2024-10-24 04:58:48,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:58:48,759 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:58:48,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2024-10-24 04:58:48,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ee925bcc/e2c5474b793b4bc3aa0aa44b38fcddc4/FLAGb830ae3b6 [2024-10-24 04:58:49,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ee925bcc/e2c5474b793b4bc3aa0aa44b38fcddc4 [2024-10-24 04:58:49,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:58:49,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:58:49,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:58:49,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:58:49,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:58:49,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5d6fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49, skipping insertion in model container [2024-10-24 04:58:49,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:58:49,351 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.vcegar_QF_BV_itc99_b13_p22.c[1266,1279] [2024-10-24 04:58:49,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:58:49,518 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:58:49,529 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.vcegar_QF_BV_itc99_b13_p22.c[1266,1279] [2024-10-24 04:58:49,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:58:49,624 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:58:49,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49 WrapperNode [2024-10-24 04:58:49,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:58:49,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:58:49,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:58:49,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:58:49,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,739 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 732 [2024-10-24 04:58:49,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:58:49,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:58:49,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:58:49,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:58:49,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,826 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-24 04:58:49,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:58:49,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:58:49,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:58:49,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:58:49,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (1/1) ... [2024-10-24 04:58:49,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:58:49,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:58:49,928 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-24 04:58:49,931 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-24 04:58:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:58:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 04:58:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:58:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:58:50,121 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:58:50,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 04:58:50,937 INFO L? ?]: Removed 381 outVars from TransFormulas that were not future-live. [2024-10-24 04:58:50,937 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 04:58:50,970 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 04:58:50,971 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 04:58:50,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:58:50 BoogieIcfgContainer [2024-10-24 04:58:50,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 04:58:50,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 04:58:50,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 04:58:50,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 04:58:50,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:58:49" (1/3) ... [2024-10-24 04:58:50,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21376cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:58:50, skipping insertion in model container [2024-10-24 04:58:50,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:49" (2/3) ... [2024-10-24 04:58:50,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21376cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:58:50, skipping insertion in model container [2024-10-24 04:58:50,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:58:50" (3/3) ... [2024-10-24 04:58:50,981 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2024-10-24 04:58:50,996 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 04:58:50,997 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 04:58:51,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 04:58:51,059 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;@21e97fae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 04:58:51,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 04:58:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 137 states have (on average 1.5036496350364963) internal successors, (206), 138 states have internal predecessors, (206), 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-24 04:58:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 04:58:51,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:51,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:58:51,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:51,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:51,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1832313884, now seen corresponding path program 1 times [2024-10-24 04:58:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:58:51,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666781728] [2024-10-24 04:58:51,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:51,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:58:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:58:51,692 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-24 04:58:51,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:58:51,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666781728] [2024-10-24 04:58:51,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666781728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:58:51,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:58:51,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:58:51,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455175127] [2024-10-24 04:58:51,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:58:51,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:58:51,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:58:51,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:58:51,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:58:51,728 INFO L87 Difference]: Start difference. First operand has 139 states, 137 states have (on average 1.5036496350364963) internal successors, (206), 138 states have internal predecessors, (206), 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.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:51,788 INFO L93 Difference]: Finished difference Result 226 states and 336 transitions. [2024-10-24 04:58:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:58:51,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-24 04:58:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:51,798 INFO L225 Difference]: With dead ends: 226 [2024-10-24 04:58:51,798 INFO L226 Difference]: Without dead ends: 140 [2024-10-24 04:58:51,801 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-24 04:58:51,804 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 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-24 04:58:51,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:58:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-24 04:58:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-24 04:58:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4820143884892085) internal successors, (206), 139 states have internal predecessors, (206), 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-24 04:58:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2024-10-24 04:58:51,852 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 40 [2024-10-24 04:58:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:51,853 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2024-10-24 04:58:51,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2024-10-24 04:58:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 04:58:51,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:51,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:58:51,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 04:58:51,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:51,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash 968850943, now seen corresponding path program 1 times [2024-10-24 04:58:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:58:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352967477] [2024-10-24 04:58:51,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:51,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:58:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:58:52,096 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-24 04:58:52,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:58:52,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352967477] [2024-10-24 04:58:52,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352967477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:58:52,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:58:52,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:58:52,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137917389] [2024-10-24 04:58:52,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:58:52,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:58:52,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:58:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:58:52,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:58:52,102 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:52,150 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2024-10-24 04:58:52,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:58:52,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-24 04:58:52,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:52,155 INFO L225 Difference]: With dead ends: 229 [2024-10-24 04:58:52,156 INFO L226 Difference]: Without dead ends: 142 [2024-10-24 04:58:52,156 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-24 04:58:52,160 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 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-24 04:58:52,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:58:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-24 04:58:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-24 04:58:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 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-24 04:58:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2024-10-24 04:58:52,178 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 41 [2024-10-24 04:58:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:52,179 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2024-10-24 04:58:52,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:58:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2024-10-24 04:58:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 04:58:52,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:52,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:58:52,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 04:58:52,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:52,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1128357547, now seen corresponding path program 1 times [2024-10-24 04:58:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:58:52,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302305289] [2024-10-24 04:58:52,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:52,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:58:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:58:52,848 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-24 04:58:52,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:58:52,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302305289] [2024-10-24 04:58:52,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302305289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:58:52,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:58:52,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 04:58:52,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641031485] [2024-10-24 04:58:52,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:58:52,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 04:58:52,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:58:52,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 04:58:52,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 04:58:52,854 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 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-24 04:58:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:52,994 INFO L93 Difference]: Finished difference Result 235 states and 343 transitions. [2024-10-24 04:58:52,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 04:58:52,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 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-24 04:58:52,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:52,996 INFO L225 Difference]: With dead ends: 235 [2024-10-24 04:58:52,997 INFO L226 Difference]: Without dead ends: 146 [2024-10-24 04:58:52,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 04:58:52,998 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 175 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 04:58:52,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 904 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 04:58:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-24 04:58:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-10-24 04:58:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 144 states have internal predecessors, (211), 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-24 04:58:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2024-10-24 04:58:53,006 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 42 [2024-10-24 04:58:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:53,007 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2024-10-24 04:58:53,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 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-24 04:58:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2024-10-24 04:58:53,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-24 04:58:53,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:53,008 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-24 04:58:53,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 04:58:53,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:53,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:53,009 INFO L85 PathProgramCache]: Analyzing trace with hash 945199746, now seen corresponding path program 1 times [2024-10-24 04:58:53,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:58:53,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477626641] [2024-10-24 04:58:53,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:53,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:58:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:58:53,551 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-24 04:58:53,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:58:53,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477626641] [2024-10-24 04:58:53,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477626641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:58:53,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:58:53,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 04:58:53,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298157787] [2024-10-24 04:58:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:58:53,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 04:58:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:58:53,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 04:58:53,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 04:58:53,555 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 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-24 04:58:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:53,651 INFO L93 Difference]: Finished difference Result 246 states and 356 transitions. [2024-10-24 04:58:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 04:58:53,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 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-24 04:58:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:53,654 INFO L225 Difference]: With dead ends: 246 [2024-10-24 04:58:53,654 INFO L226 Difference]: Without dead ends: 154 [2024-10-24 04:58:53,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 04:58:53,655 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 193 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:58:53,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 780 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:58:53,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-24 04:58:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 149. [2024-10-24 04:58:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.4594594594594594) internal successors, (216), 148 states have internal predecessors, (216), 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-24 04:58:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 216 transitions. [2024-10-24 04:58:53,673 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 216 transitions. Word has length 43 [2024-10-24 04:58:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:53,674 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 216 transitions. [2024-10-24 04:58:53,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 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-24 04:58:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 216 transitions. [2024-10-24 04:58:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 04:58:53,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:53,675 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-24 04:58:53,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 04:58:53,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:53,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:53,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2139265334, now seen corresponding path program 1 times [2024-10-24 04:58:53,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:58:53,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918587609] [2024-10-24 04:58:53,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:53,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:58:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:58:53,960 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-24 04:58:53,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:58:53,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918587609] [2024-10-24 04:58:53,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918587609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:58:53,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:58:53,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 04:58:53,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620012706] [2024-10-24 04:58:53,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:58:53,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 04:58:53,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:58:53,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 04:58:53,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 04:58:53,964 INFO L87 Difference]: Start difference. First operand 149 states and 216 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 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-24 04:58:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:58:54,411 INFO L93 Difference]: Finished difference Result 281 states and 400 transitions. [2024-10-24 04:58:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 04:58:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 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-24 04:58:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:58:54,414 INFO L225 Difference]: With dead ends: 281 [2024-10-24 04:58:54,414 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 04:58:54,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-24 04:58:54,417 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 268 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 04:58:54,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 202 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 04:58:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 04:58:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 158. [2024-10-24 04:58:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4585987261146496) internal successors, (229), 157 states have internal predecessors, (229), 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-24 04:58:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 229 transitions. [2024-10-24 04:58:54,431 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 229 transitions. Word has length 44 [2024-10-24 04:58:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:58:54,431 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 229 transitions. [2024-10-24 04:58:54,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 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-24 04:58:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 229 transitions. [2024-10-24 04:58:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 04:58:54,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:58:54,436 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-24 04:58:54,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 04:58:54,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:58:54,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:58:54,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1950395569, now seen corresponding path program 1 times [2024-10-24 04:58:54,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:58:54,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757750589] [2024-10-24 04:58:54,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:58:54,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:58:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:58:54,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 04:58:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:58:54,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 04:58:54,548 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 04:58:54,550 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 04:58:54,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 04:58:54,554 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 04:58:54,610 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 04:58:54,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:58:54 BoogieIcfgContainer [2024-10-24 04:58:54,613 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 04:58:54,613 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 04:58:54,616 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 04:58:54,616 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 04:58:54,616 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:58:50" (3/4) ... [2024-10-24 04:58:54,618 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 04:58:54,619 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 04:58:54,620 INFO L158 Benchmark]: Toolchain (without parser) took 5500.95ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 120.8MB in the beginning and 115.4MB in the end (delta: 5.4MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2024-10-24 04:58:54,620 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:58:54,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.18ms. Allocated memory is still 176.2MB. Free memory was 120.8MB in the beginning and 97.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 04:58:54,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.05ms. Allocated memory is still 176.2MB. Free memory was 97.7MB in the beginning and 83.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 04:58:54,621 INFO L158 Benchmark]: Boogie Preprocessor took 146.68ms. Allocated memory is still 176.2MB. Free memory was 83.7MB in the beginning and 74.6MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 04:58:54,621 INFO L158 Benchmark]: RCFGBuilder took 1082.79ms. Allocated memory is still 176.2MB. Free memory was 74.6MB in the beginning and 80.4MB in the end (delta: -5.8MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-10-24 04:58:54,621 INFO L158 Benchmark]: TraceAbstraction took 3639.41ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 80.4MB in the beginning and 115.4MB in the end (delta: -35.0MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2024-10-24 04:58:54,622 INFO L158 Benchmark]: Witness Printer took 5.91ms. Allocated memory is still 251.7MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:58:54,623 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.18ms. Allocated memory is still 176.2MB. Free memory was 120.8MB in the beginning and 97.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.05ms. Allocated memory is still 176.2MB. Free memory was 97.7MB in the beginning and 83.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.68ms. Allocated memory is still 176.2MB. Free memory was 83.7MB in the beginning and 74.6MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1082.79ms. Allocated memory is still 176.2MB. Free memory was 74.6MB in the beginning and 80.4MB in the end (delta: -5.8MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3639.41ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 80.4MB in the beginning and 115.4MB in the end (delta: -35.0MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * Witness Printer took 5.91ms. Allocated memory is still 251.7MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 169. 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 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_33 mask_SORT_33 = (SORT_33)-1 >> (sizeof(SORT_33) * 8 - 4); [L36] const SORT_33 msb_SORT_33 = (SORT_33)1 << (4 - 1); [L38] const SORT_69 mask_SORT_69 = (SORT_69)-1 >> (sizeof(SORT_69) * 8 - 10); [L39] const SORT_69 msb_SORT_69 = (SORT_69)1 << (10 - 1); [L41] const SORT_3 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_14 = 0; [L44] const SORT_10 var_18 = 1; [L45] const SORT_1 var_23 = 1; [L46] const SORT_69 var_70 = 0; [L47] const SORT_10 var_113 = 104; [L49] SORT_1 input_2; [L50] SORT_3 input_4; [L51] SORT_1 input_5; [L52] SORT_1 input_6; [L53] SORT_1 input_31; [L54] SORT_33 input_34; [L55] SORT_1 input_36; [L56] SORT_33 input_38; [L57] SORT_1 input_40; [L58] SORT_1 input_42; [L59] SORT_1 input_48; [L60] SORT_1 input_50; [L61] SORT_1 input_52; [L62] SORT_1 input_57; [L63] SORT_1 input_67; [L64] SORT_3 input_75; [L65] SORT_1 input_82; [L66] SORT_1 input_89; [L67] SORT_1 input_95; [L68] SORT_1 input_101; [L69] SORT_1 input_107; [L70] SORT_1 input_108; [L71] SORT_1 input_109; [L72] SORT_1 input_126; [L73] SORT_69 input_136; [L74] SORT_1 input_144; [L75] SORT_1 input_145; [L76] SORT_1 input_146; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L78] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L79] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L80] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L81] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L82] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L83] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L84] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L85] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L86] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L87] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L88] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_ushort() & mask_SORT_69 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L89] SORT_69 state_71 = __VERIFIER_nondet_ushort() & mask_SORT_69; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L90] SORT_1 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_3 init_9_arg_1 = var_7; [L93] state_8 = init_9_arg_1 [L94] SORT_1 init_16_arg_1 = var_14; [L95] state_15 = init_16_arg_1 [L96] SORT_1 init_28_arg_1 = var_14; [L97] state_27 = init_28_arg_1 [L98] SORT_1 init_30_arg_1 = var_14; [L99] state_29 = init_30_arg_1 [L100] SORT_1 init_45_arg_1 = var_14; [L101] state_44 = init_45_arg_1 [L102] SORT_1 init_47_arg_1 = var_14; [L103] state_46 = init_47_arg_1 [L104] SORT_1 init_55_arg_1 = var_23; [L105] state_54 = init_55_arg_1 [L106] SORT_1 init_60_arg_1 = var_14; [L107] state_59 = init_60_arg_1 [L108] SORT_1 init_62_arg_1 = var_14; [L109] state_61 = init_62_arg_1 [L110] SORT_1 init_64_arg_1 = var_14; [L111] state_63 = init_64_arg_1 [L112] SORT_1 init_66_arg_1 = var_14; [L113] state_65 = init_66_arg_1 [L114] SORT_69 init_72_arg_1 = var_70; [L115] state_71 = init_72_arg_1 [L116] SORT_1 init_74_arg_1 = var_14; [L117] state_73 = init_74_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L120] input_2 = __VERIFIER_nondet_uchar() [L121] input_4 = __VERIFIER_nondet_uchar() [L122] input_5 = __VERIFIER_nondet_uchar() [L123] input_6 = __VERIFIER_nondet_uchar() [L124] input_31 = __VERIFIER_nondet_uchar() [L125] input_34 = __VERIFIER_nondet_uchar() [L126] input_36 = __VERIFIER_nondet_uchar() [L127] input_38 = __VERIFIER_nondet_uchar() [L128] input_40 = __VERIFIER_nondet_uchar() [L129] input_42 = __VERIFIER_nondet_uchar() [L130] input_48 = __VERIFIER_nondet_uchar() [L131] input_50 = __VERIFIER_nondet_uchar() [L132] input_52 = __VERIFIER_nondet_uchar() [L133] input_57 = __VERIFIER_nondet_uchar() [L134] input_67 = __VERIFIER_nondet_uchar() [L135] input_75 = __VERIFIER_nondet_uchar() [L136] input_82 = __VERIFIER_nondet_uchar() [L137] input_89 = __VERIFIER_nondet_uchar() [L138] input_95 = __VERIFIER_nondet_uchar() [L139] input_101 = __VERIFIER_nondet_uchar() [L140] input_107 = __VERIFIER_nondet_uchar() [L141] input_108 = __VERIFIER_nondet_uchar() [L142] input_109 = __VERIFIER_nondet_uchar() [L143] input_126 = __VERIFIER_nondet_uchar() [L144] input_136 = __VERIFIER_nondet_ushort() [L145] input_144 = __VERIFIER_nondet_uchar() [L146] input_145 = __VERIFIER_nondet_uchar() [L147] input_146 = __VERIFIER_nondet_uchar() [L150] SORT_3 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_11_arg_0=0, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L151] EXPR var_11_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L151] var_11_arg_0 = var_11_arg_0 & mask_SORT_3 [L152] SORT_10 var_11 = var_11_arg_0; [L153] SORT_10 var_13_arg_0 = var_11; [L154] SORT_10 var_13_arg_1 = var_12; [L155] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L156] SORT_1 var_17_arg_0 = state_15; VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_13=1, var_14=0, var_17_arg_0=0, var_18=1, var_23=1, var_70=0] [L157] EXPR var_17_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_13=1, var_14=0, var_18=1, var_23=1, var_70=0] [L157] var_17_arg_0 = var_17_arg_0 & mask_SORT_1 [L158] SORT_10 var_17 = var_17_arg_0; [L159] SORT_10 var_19_arg_0 = var_17; [L160] SORT_10 var_19_arg_1 = var_18; [L161] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L162] SORT_1 var_20_arg_0 = var_13; [L163] SORT_1 var_20_arg_1 = var_19; VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_20_arg_0=1, var_20_arg_1=0, var_23=1, var_70=0] [L164] EXPR var_20_arg_0 | var_20_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L164] SORT_1 var_20 = var_20_arg_0 | var_20_arg_1; [L165] SORT_1 var_24_arg_0 = var_20; [L166] SORT_1 var_24 = ~var_24_arg_0; [L167] SORT_1 var_25_arg_0 = var_23; [L168] SORT_1 var_25_arg_1 = var_24; VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_25_arg_0=1, var_25_arg_1=-2, var_70=0] [L169] EXPR var_25_arg_0 & var_25_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L169] SORT_1 var_25 = var_25_arg_0 & var_25_arg_1; [L170] EXPR var_25 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L170] var_25 = var_25 & mask_SORT_1 [L171] SORT_1 bad_26_arg_0 = var_25; [L172] CALL __VERIFIER_assert(!(bad_26_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 636 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 636 mSDsluCounter, 3079 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2230 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 584 IncrementalHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 849 mSDtfsCounter, 584 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 1038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-24 04:58:54,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.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 81099e1fe8016daaefd672ebf53a7cbfe30573425760bd713b63c430b338ca02 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:58:56,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:58:56,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-24 04:58:56,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:58:56,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:58:56,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:58:56,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:58:56,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:58:56,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:58:56,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:58:56,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:58:56,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:58:56,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:58:56,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:58:56,861 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:58:56,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:58:56,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:58:56,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:58:56,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:58:56,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:58:56,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:58:56,867 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 04:58:56,868 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 04:58:56,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:58:56,868 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 04:58:56,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:58:56,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:58:56,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:58:56,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:58:56,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:58:56,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:58:56,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:58:56,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:58:56,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:58:56,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:58:56,871 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 04:58:56,871 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 04:58:56,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:58:56,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:58:56,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:58:56,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:58:56,876 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 04:58:56,876 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 -> 81099e1fe8016daaefd672ebf53a7cbfe30573425760bd713b63c430b338ca02 [2024-10-24 04:58:57,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:58:57,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:58:57,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:58:57,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:58:57,203 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:58:57,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2024-10-24 04:58:58,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:58:58,825 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:58:58,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2024-10-24 04:58:58,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/016506d61/c6627459e7034526a927ebee8e96363b/FLAGd9efcfece [2024-10-24 04:58:58,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/016506d61/c6627459e7034526a927ebee8e96363b [2024-10-24 04:58:58,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:58:58,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:58:58,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:58:58,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:58:58,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:58:58,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:58:58" (1/1) ... [2024-10-24 04:58:58,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a8fd519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:58, skipping insertion in model container [2024-10-24 04:58:58,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:58:58" (1/1) ... [2024-10-24 04:58:58,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:58:59,094 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.vcegar_QF_BV_itc99_b13_p22.c[1266,1279] [2024-10-24 04:58:59,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:58:59,230 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:58:59,242 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.vcegar_QF_BV_itc99_b13_p22.c[1266,1279] [2024-10-24 04:58:59,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:58:59,342 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:58:59,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59 WrapperNode [2024-10-24 04:58:59,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:58:59,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:58:59,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:58:59,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:58:59,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (1/1) ... [2024-10-24 04:58:59,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (1/1) ... [2024-10-24 04:58:59,422 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 468 [2024-10-24 04:58:59,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:58:59,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:58:59,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:58:59,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:58:59,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (1/1) ... [2024-10-24 04:58:59,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (1/1) ... [2024-10-24 04:58:59,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (1/1) ... [2024-10-24 04:58:59,475 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-24 04:58:59,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (1/1) ... [2024-10-24 04:58:59,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (1/1) ... [2024-10-24 04:58:59,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (1/1) ... [2024-10-24 04:58:59,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (1/1) ... [2024-10-24 04:58:59,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (1/1) ... [2024-10-24 04:58:59,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (1/1) ... [2024-10-24 04:58:59,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:58:59,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:58:59,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:58:59,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:58:59,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (1/1) ... [2024-10-24 04:58:59,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:58:59,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:58:59,565 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-24 04:58:59,572 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-24 04:58:59,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:58:59,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 04:58:59,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:58:59,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:58:59,771 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:58:59,777 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 04:59:00,142 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-10-24 04:59:00,142 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 04:59:00,187 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 04:59:00,187 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 04:59:00,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:59:00 BoogieIcfgContainer [2024-10-24 04:59:00,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 04:59:00,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 04:59:00,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 04:59:00,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 04:59:00,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:58:58" (1/3) ... [2024-10-24 04:59:00,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346fae32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:59:00, skipping insertion in model container [2024-10-24 04:59:00,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:58:59" (2/3) ... [2024-10-24 04:59:00,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346fae32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:59:00, skipping insertion in model container [2024-10-24 04:59:00,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:59:00" (3/3) ... [2024-10-24 04:59:00,195 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2024-10-24 04:59:00,220 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 04:59:00,221 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 04:59:00,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 04:59:00,284 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;@42aec6f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 04:59:00,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 04:59:00,288 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-24 04:59:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 04:59:00,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:59:00,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 04:59:00,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:59:00,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:59:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-24 04:59:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:59:00,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718020998] [2024-10-24 04:59:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:59:00,314 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-24 04:59:00,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:59:00,317 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-24 04:59:00,318 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-24 04:59:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:59:00,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 04:59:00,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:59:00,670 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-24 04:59:00,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 04:59:00,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:59:00,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718020998] [2024-10-24 04:59:00,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718020998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:59:00,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:59:00,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 04:59:00,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867359530] [2024-10-24 04:59:00,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:59:00,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:59:00,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:59:00,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:59:00,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:59:00,707 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-24 04:59:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:59:00,763 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-24 04:59:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:59:00,766 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-24 04:59:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:59:00,772 INFO L225 Difference]: With dead ends: 15 [2024-10-24 04:59:00,772 INFO L226 Difference]: Without dead ends: 9 [2024-10-24 04:59:00,775 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-24 04:59:00,778 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:59:00,779 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.0s Time] [2024-10-24 04:59:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-24 04:59:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-24 04:59:00,805 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-24 04:59:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-24 04:59:00,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-24 04:59:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:59:00,807 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-24 04:59:00,807 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-24 04:59:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-24 04:59:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 04:59:00,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:59:00,808 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 04:59:00,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 04:59:01,010 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-24 04:59:01,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:59:01,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:59:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-24 04:59:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:59:01,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835087259] [2024-10-24 04:59:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:59:01,013 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-24 04:59:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:59:01,015 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-24 04:59:01,029 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-24 04:59:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:59:01,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 04:59:01,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:59:01,445 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-24 04:59:01,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 04:59:07,481 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_8~0#1|)))) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse10 (forall ((|v_ULTIMATE.start_main_~var_25_arg_0~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_0~0#1_16|)))))) (_ bv0 8)))) (.cse11 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_46~0#1|)) (.cse12 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse9))))) (.cse8 (forall ((|v_ULTIMATE.start_main_~var_25_arg_0~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_0~0#1_16|)))))) (_ bv0 8))))) (let ((.cse6 (or (forall ((|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|)))) |c_ULTIMATE.start_main_~var_12~0#1|))) .cse8)) (.cse2 (or (and (or .cse8 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|)))))))))))))) (or .cse10 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|)))))))))))))) .cse11)) (.cse7 (or (forall ((|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|)))) |c_ULTIMATE.start_main_~var_12~0#1|)) .cse10)) (.cse3 (or (and (or .cse8 (forall ((|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|)))))))) (or .cse10 (forall ((|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|)))))))) (not .cse11)))) (let ((.cse0 (and .cse6 .cse2 .cse7 .cse3)) (.cse4 (forall ((|ULTIMATE.start_main_~var_23~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_23~0#1|))))))))))) (.cse1 (forall ((|ULTIMATE.start_main_~var_23~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_23~0#1|))))))))))))) (and (or (and (or .cse0 .cse1) (or (and .cse2 .cse3) .cse4)) (forall ((|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))))))))))) (or (and (or .cse0 .cse4) (or (and .cse6 .cse7) .cse1)) (forall ((|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))))))))))))))))) is different from false [2024-10-24 04:59:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 04:59:13,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:59:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835087259] [2024-10-24 04:59:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835087259] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 04:59:13,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 04:59:13,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-24 04:59:13,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716044760] [2024-10-24 04:59:13,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 04:59:13,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 04:59:13,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:59:13,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 04:59:13,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-10-24 04:59:13,673 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-24 04:59:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:59:14,924 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-24 04:59:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 04:59:14,924 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-24 04:59:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:59:14,925 INFO L225 Difference]: With dead ends: 14 [2024-10-24 04:59:14,925 INFO L226 Difference]: Without dead ends: 12 [2024-10-24 04:59:14,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=31, Invalid=44, Unknown=1, NotChecked=14, Total=90 [2024-10-24 04:59:14,927 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 04:59:14,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 12 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 6 Unchecked, 0.5s Time] [2024-10-24 04:59:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-24 04:59:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-24 04:59:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:59:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-24 04:59:14,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-24 04:59:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:59:14,934 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-24 04:59:14,934 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-24 04:59:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-24 04:59:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 04:59:14,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:59:14,936 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-24 04:59:14,940 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-24 04:59:15,136 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-24 04:59:15,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:59:15,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:59:15,138 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-24 04:59:15,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:59:15,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044707213] [2024-10-24 04:59:15,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 04:59:15,139 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-24 04:59:15,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:59:15,142 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-24 04:59:15,144 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-24 04:59:15,352 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 04:59:15,352 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 04:59:15,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 04:59:15,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:59:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:59:18,739 INFO L311 TraceCheckSpWp]: Computing backward predicates...